A linear system solver based on a modified Krylov subspace method for breakdown recovery (Q1921331): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Harwell-Boeing sparse matrix collection / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding breakdown in the CGS algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lanczos-type algorithms for solving systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding breakdown and near-breakdown in Lanczos type algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse matrix test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: QMR: A quasi-minimal residual method for non-Hermitian linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix interpretations and applications of the continued fraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Modification of the Unsymmetric Lanczos Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction to Tridiagonal Form and Minimal Realizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices / 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: A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms / rank
 
Normal rank

Latest revision as of 13:05, 24 May 2024

scientific article
Language Label Description Also known as
English
A linear system solver based on a modified Krylov subspace method for breakdown recovery
scientific article

    Statements

    A linear system solver based on a modified Krylov subspace method for breakdown recovery (English)
    0 references
    0 references
    0 references
    11 August 1996
    0 references
    The authors present a scheme based on a modified Krylov subspace approach to Lanczos' biorthogonalization method of the solution of nonsymmetric linear systems. When the scheme breaks down it is replaced by a modified dual Krylov subspace which is the sum of the original subspace and a new Krylov subspace which depends on a new start vector and the original matrix. Based on this strategy, they develop a practical algorithm for solving linear systems (the MLAN/QM algorithm) which also incorporates the residual quasi-minimization proposed by \textit{R. W. Freund} and \textit{N. M. Nachtigal} [Numer. Math. 60, No. 3, 315-339 (1991; Zbl 0754.65034)]. The algorithm is presented in some computational detail. Convergence bounds for the method are presented as well as numerical results to show its effectiveness.
    0 references
    0 references
    Krylov subspace method
    0 references
    breakdown recovery
    0 references
    convergence
    0 references
    Lanczos' biorthogonalization method
    0 references
    nonsymmetric linear systems
    0 references
    MLAN/QM algorithm
    0 references
    residual quasi-minimization
    0 references
    algorithm
    0 references
    numerical results
    0 references

    Identifiers