Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1251.65045
Carpentieri, B.; Jing, Y.-F.; Huang, T.-Z.
The BiCOR and CORS iterative algorithms for solving nonsymmetric linear systems. (English)
[J] SIAM J. Sci. Comput. 33, No. 5, 3020-3036 (2011). ISSN 1064-8275; ISSN 1095-7197/e

The paper describes the theoretical background and computational aspects of two iterative algorithms for solving real nonsymmetric and complex non-Hermetian linear systems. These algorithms are developed from variants of the nonsymmetric Lanczos method. The convergence properties of these two methods are then analyzed using a large number of numerical experiments. The paper also includes a comparison of the two methods under examination with other common iterative algorithms for solving nonsymmetic linear systems.
[Andrew Douglas (New York)]

MSC 2000:: *65F10 Iterative methods for linear systems
65F50 Sparse matrices

Keywords: Krylov subspace methods; nonsymmetric Lanczos method; sparse and dense matrix computation; iterative algorithms; real nonsymmetric and complex non-Hermetian linear systems; numerical experiments; comparison of methods

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]