A class of incomplete orthogonal factorization methods. I: Methods and theories (Q5937099)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1618502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A class of incomplete orthogonal factorization methods. I: Methods and theories |
scientific article; zbMATH DE number 1618502 |
Statements
A class of incomplete orthogonal factorization methods. I: Methods and theories (English)
0 references
3 December 2001
0 references
A class of incomplete orthogonal factorization methods, based on Given's rotations, for large sparse unsymmetrical systems of linear algebraic equations is presented. The analysis indicates that such methods can produce one nonsingular sparse incomplete upper triangular factor, while the second factor can be either a complete orthogonal one or a sparse nonsingular incomplete orthogonal factor for a general nonsingular matrix. This enables the generation of efficient preconditioners for Krylov subspace methods for solving large sparse linear systems. Generation of preconditioners for least squares problems in normal form is also discussed.
0 references
modified Gram-Schmidt orthogonalization
0 references
incomplete orthogonal factorization methods
0 references
Given's rotations
0 references
large sparse unsymmetrical systems
0 references
preconditioners
0 references
Krylov subspace methods
0 references
least squares problems
0 references
0.8924070596694946
0 references
0.8882860541343689
0 references
0.8372669219970703
0 references
