Krylov Subspace Iterations for Sparse Linear Systems

Are Magnus Bruaset ()
Additional contact information
Are Magnus Bruaset: SINTEF

Chapter 12 in Numerical Methods and Software Tools in Industrial Mathematics, 1997, pp 255-280 from Springer

Abstract: Abstract This chapter is concerned with efficient methods for iterative solution of large sparse systems of linear equations, typically derived from the discretization of an elliptic boundary value problem. In particular, attention is given to the family of Krylov subspace methods, as well as to several preconditioning strategies that are suitable for improving the convergence rates of such iterations.

Keywords: Conjugate Gradient Method; Krylov Subspace; Conjugate Gradient Algorithm; Krylov Subspace Method; Lanczos Method (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-1984-2_12

Ordering information: This item can be ordered from
http://www.springer.com/9781461219842

DOI: 10.1007/978-1-4612-1984-2_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().