Derivation of BiCG from the conditions defining Lanczos' method for solving a system of linear equations (Q1979009): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Treatment of near-breakdown in the CGS algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4356575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The block conjugate gradient algorithm and related methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theoretical overview of Krylov subspace methods / rank
 
Normal rank

Latest revision as of 16:26, 29 May 2024

scientific article
Language Label Description Also known as
English
Derivation of BiCG from the conditions defining Lanczos' method for solving a system of linear equations
scientific article

    Statements

    Derivation of BiCG from the conditions defining Lanczos' method for solving a system of linear equations (English)
    0 references
    0 references
    0 references
    22 May 2000
    0 references
    The paper deals with the biconjugate gradient method for solving large systems of simultaneous algebraic equations with a nonsingular matrix which is nonsymmetric, in general. The authors present a new approach for deriving this method from the conditions characterizing three-term recurrence Lanczos' biorthogonalization algorithm. The main trick is based on an auxiliary lemma which establishes a special property of residual vectors. Then the standard BiCG algorithm is derived.
    0 references
    0 references
    biorthogonalization
    0 references
    linear equations
    0 references
    biconjugate gradient method
    0 references