A class of incomplete orthogonal factorization methods. II: Implemetation and results (Q2568630): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(10 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Iain S. Duff / rank
Normal rank
 
Property / author
 
Property / author: Iain S. Duff / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LSQR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SPARSKIT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SparseMatrix / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MatrixMarket / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CRAIG / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CIMGS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10543-005-2642-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026041872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of incomplete orthogonal factorization methods. I: Methods and theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning Highly Indefinite and Nonsymmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4868585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioners for least squares problems by LU factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of sparse linear least squares problems using Givens rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete Methods for Solving $A^T Ax = b$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incomplete Factorization Technique for Positive Definite Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning techniques for nonsymmetric and indefinite linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CIMGS: An Incomplete Orthogonal FactorizationPreconditioner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large and sparse linear least-squares problems by conjugate gradient algorithms / rank
 
Normal rank

Latest revision as of 16:43, 10 June 2024

scientific article
Language Label Description Also known as
English
A class of incomplete orthogonal factorization methods. II: Implemetation and results
scientific article

    Statements

    A class of incomplete orthogonal factorization methods. II: Implemetation and results (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2005
    0 references
    The authors present a considerable amount of implementation research following up on their previous theoretical research [\textit{Z. Bai}, \textit{I. S. Duff} and \textit{A. J. Wathen}, BIT 41, No. 1, 53--70 (2001; Zbl 0990.65038)] regarding incomplete orthogonal factorization methods, using Given's rotations, for square and rectangular sparse matrices. The approach stems from the idea to compute the orthogonal factorization of a matrix which is sufficiently close to the original one. Three separate methods are discussed in details, and abundant practical considerations are presented including algorithmic aspects and numerical examples.
    0 references
    preconditioning
    0 references
    sparse linear systems
    0 references
    sparse least-squares
    0 references
    iterative methods
    0 references
    incomplete orthogonal factorizations
    0 references
    Givens rotations
    0 references
    numerical examples
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references