ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (3)
  • Linear systems  (3)
  • Wiley-Blackwell  (3)
  • Sage Publications
  • 2020-2023
  • 2015-2019
  • 1990-1994  (3)
  • Mathematics  (3)
  • Energy, Environment Protection, Nuclear Power Engineering
Collection
  • Articles  (3)
Publisher
  • Wiley-Blackwell  (3)
  • Sage Publications
  • Springer  (12)
Years
  • 2020-2023
  • 2015-2019
  • 1990-1994  (3)
Year
Topic
  • Mathematics  (3)
  • Energy, Environment Protection, Nuclear Power Engineering
  • 1
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Linear Algebra with Applications 1 (1994), S. 287-311 
    ISSN: 1070-5325
    Keywords: Linear systems ; Incomplete factorizations ; Parallel computation ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: In this paper two new implementations of SSOR and incomplete factorization preconditioners are given, for shared memory and distributed memory parallel computers respectively. These new implementations give increased solution speeds for matrix problems such as those arising from discretized partial differential equations with natural ordering of the grid points, for which it is well-known that the standard implementation of these preconditioners is difficult to parallelize effectively. For shared memory machines, a new technique is presented here which decreases the number of synchronization points in each preconditioning step and thus allows better parallel speedups. For distributed memory machines, an implementation based on block cyclic reduction is given which circumvents the problem of idle processors during the preconditioning phase. Descriptions of the implementations are given, and numerical comparisons are given for a model diffusion problem on the Cray Y-MP and the CM-2 Connection Machine.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Linear Algebra with Applications 1 (1994), S. 45-63 
    ISSN: 1070-5325
    Keywords: Conjugate gradients ; Convergence ; Linear systems ; Acceleration of conjugate gradients ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: The solution of linear systems has considerable importance for the computation of problems resulting from engineering, physics, chemistry, computer science, mathematics, medicine and economics. The calculation of costly and time-consuming problems, e.g. crash tests, simulation of the human lung and skin, calculation of electrical and magnetical fields, thermal analysis and fluid dynamics, to name only a few, has become possible with the recent developments of advanced computer architectures and iterative solvers. Generalized conjugate gradient (CG) methods are the most important iterative solvers because they converge very quickly under certain conditions. Therefore they are widely used and in a rapid further development.The purpose of this paper is to present new results for the convergence of generalized CG methods. A convergence result for non-symmetric and non-positive definite matrices is given that includes the classical theory for symmetric, positive definite matrices as a special case.The norm of the residuals resulting from CG methods may oscillate heavily. Different remedies for smoothing this sequence have been proposed, for example by van der Vorst. Schönauer introduced in the 1980s a smoothing algorithm to get a norm nonincreasing function of the iteration index. For this algorithm a complete theoretical analysis is given. A surprising result is obtained showing that the smoothing algorithm is in a sense optimal. Convergence estimates are derived therefrom. A geometric interpretation of the smoothing algorithm is given showing the propagation of the errors.It should be stressed that a smooth convergence of the residuals is not equivalent to a smooth convergence of the errors which is the proper aim. A class of error minimizing methods can be easily derived from the theory.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Linear Algebra with Applications 1 (1994), S. 151-154 
    ISSN: 1070-5325
    Keywords: Linear systems ; Singular systems ; Iterative methods ; Convergent methods ; Index of the iteration operator ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: Equivalence is shown between different conditions for convergence of iterative methods for consistent singular systems of linear equations on Banach spaces. These systems appear in many applications, such as Markov chains and Markov processes. The conditions considered relate the range and null spaces of different operators.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...