Krylov subspace methods for solving large unsymmetric linear systems
Some algorithms based upon a projection process onto the Krylov subspace K/sub m/ = Span(r/sub 0/, Ar/sub 0/,..., A/sup m-1/r/sub 0/) are developed, generalizing the method of conjugate gradients to unsymmetric systems. These methods are extensions of Arnoldi's algorithm for solving eigenvalue problems. The convergence is analyzed in terms of the distance of the solution to the subspace K/sub m/ and some error bounds are established showing in particular a similarity with the conjugate gradient method (for symmetric matrices) when the eigenvalues are real. Several numerical experiments are described and discussed.
- Research Organization:
- Illinois Univ., Urbana (USA). Dept. of Computer Science
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AS02-76ER02383
- OSTI ID:
- 6560074
- Report Number(s):
- DOE/ER/02383-T3; COO-2382-0077; UILU-ENG-81-1701; UIUCDCS-R-81-1047
- Country of Publication:
- United States
- Language:
- English
Similar Records
Krylov subspace methods for solving large unsymmetric linear systems
Diomres (k,m): An efficient method based on Krylov subspaces to solve big, dispersed, unsymmetrical linear systems
Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM
Journal Article
·
Wed Jul 01 00:00:00 EDT 1981
· Math. Comput.; (United States)
·
OSTI ID:6244468
Diomres (k,m): An efficient method based on Krylov subspaces to solve big, dispersed, unsymmetrical linear systems
Conference
·
Tue Feb 28 23:00:00 EST 1995
·
OSTI ID:107199
Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM
Journal Article
·
Wed May 20 00:00:00 EDT 2020
· SIAM Journal on Matrix Analysis and Applications
·
OSTI ID:1832747