Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1985-1989  (11)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 51 (1987), S. 209-227 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65F10 ; CR:G1.3
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary A generalizeds-term truncated conjugate gradient method of least square type, proposed in [1a, b], is extended to a form more suitable for proving when the truncated version is identical to the full-term version. Advantages with keeping a control term in the truncated version is pointed out. A computationally efficient new algorithm, based on a special inner product with a small demand of storage is also presented. We also give simplified and slightly extended proofs of termination of the iterative sequence and of existence of ans-term recursion, identical to the full-term version. Important earlier results on this latter topic are found in [15, 16, 8 and 11].
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    ISSN: 1572-9125
    Keywords: 65F10 ; 65N30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Standard Galerkin finite element methods or finite difference methods for singular perturbation problems lead to strongly unsymmetric matrices, which furthermore are in general notM-matrices. Accordingly, preconditioned iterative methods such as preconditioned (generalized) conjugate gradient methods, which have turned out to be very successful for symmetric and positive definite problems, can fail to converge or require an excessive number of iterations for singular perturbation problems. This is not so much due to the asymmetry, as it is to the fact that the spectrum can have both eigenvalues with positive and negative real parts, or eigenvalues with arbitrary small positive real parts and nonnegligible imaginary parts. This will be the case for a standard Galerkin method, unless the meshparameterh is chosen excessively small. There exist other discretization methods, however, for which the corresponding bilinear form is coercive, whence its finite element matrix has only eigenvalues with positive real parts; in fact, the real parts are positive uniformly in the singular perturbation parameter. In the present paper we examine the streamline diffusion finite element method in this respect. It is found that incomplete block-matrix factorization methods, both on classical form and on an inverse-free (vectorizable) form, coupled with a general least squares conjugate gradient method, can work exceptionally well on this type of problem. The number of iterations is sometimes significantly smaller than for the corresponding almost symmetric problem where the velocity field is close to zero or the singular perturbation parameter ε=1.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    BIT 25 (1985), S. 165-187 
    ISSN: 1572-9125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We survey preconditioned iterative methods with the emphasis on solving large sparse systems such as arise by discretization of boundary value problems for partial differential equations. We discuss shortly various acceleration methods but the main emphasis is on efficient preconditioning techniques. Numerical simulations on practical problems have indicated that an efficient preconditioner is the most important part of an iterative algorithm. We report in particular on the state of the art of preconditioning methods for vectorizable and/or parallel computers.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    BIT 29 (1989), S. 769-793 
    ISSN: 1572-9125
    Keywords: 65F10 ; 65N20 ; 65N30 ; two-level ; multilevel methods ; optimal preconditioners ; survey
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We survey multilevel iterative methods applied for solving large sparse systems with matrices, which depend on a level parameter, such as arise by the discretization of boundary value problems for partial differential equations when successive refinements of an initial discretization mesh is used to construct a sequence of nested difference or finite element meshes. We discuss various two-level (two-grid) preconditioning techniques, including some for nonsymmetric problems. The generalization of these techniques to the multilevel case is a nontrivial task. We emphasize several ways this can be done including classical multigrid methods and a recently proposed algebraic multilevel preconditioning method. Conditions for which the methods have an optimal order of computational complexity are presented.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    BIT 29 (1989), S. 577-582 
    ISSN: 1572-9125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 26 (1988), S. 1236-1236 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 28 (1989), S. 2085-2111 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The stability of time-stepping methods for parabolic differential equations is mostly a critical issue. Furthermore, solving such equations with a classical time-stepping approach can be very expensive because many small time-steps have to be taken if steep gradients occur in the solution, even if these occur only in a narrow part of the space domain. In this paper we present a discretization technique in which finite element approximations are used in time and space simultaneously for a relatively large time period called a ‘time-slab’. This technique may be repeatedly applied to obtain further parts of the solution in subsequent time-intervals. It will be shown that, with the proposed method, the solution can be computed cheaply even if it has steep gradients and that stability is automatically guaranteed. For the solution of the non-linear algebraic equations on each time-slab fast iterative methods can be used.
    Additional Material: 9 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 26 (1988), S. 2345-2345 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 27 (1989), S. 637-654 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The standard implementations of iterative solvers for finite element and finite difference methods frequently use a diagonal (Jacobi) preconditioner, particularly for element-by-element schemes. However, for such methods the actual order of the condition number with respect to mesh size is not reduced by the preconditioner. In the present paper we describe an iterative method where, in addition, the condition number is reduced by an order of magnitude. Moreover, the scheme may also be implemented as an element-by-element method. The method uses a generalized SSOR preconditioner and a wave front or multi-frontal ordering of the mesh nodes. For a general irregular finite element mesh a striped irregular wave front ordering may be used. The performance of the method as well as various iterative acceleration techniques for a parallel computer are examined in the numerical studies.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Communications in Applied Numerical Methods 4 (1988), S. 521-530 
    ISSN: 0748-8025
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A generalized preconditioned conjugate gradient method for the iterative solution of a preconditioned linear system Bx = b was recently derived and analysed by the author. Here is presented a special version of it which is efficient in cases where the matrix-vector multiplication with the given matrix is costly, as in various substructuring methods, where the matrix is usually not present in explicit form but the action of it can be computed.For a restarted version, it is shown that the residuals decrease monotonically for any nonsingular matrix B except when a certain inner product is zero. It is shown why it is advantageous to let the maximal number of search directions in each cycle be not smaller than the number of clusters of eigenvalues of B in the complex plane. An upper bound is derived for the rate of convergence of the algorithm when the clusters can be transformed to an ellipse by a polynomial mapping.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...