Saddle point methods, and alogorithms, for non-symmetric linear equations<sup>∗</sup> (Q4883628): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Taxonomy for Conjugate Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality for non-convex variational principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A posteriori error estimates for linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Solution Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized conjugate directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of the Conjugate Gradient Method for Singular Linear Operator Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706043 / rank
 
Normal rank

Latest revision as of 11:58, 24 May 2024

scientific article; zbMATH DE number 895739
Language Label Description Also known as
English
Saddle point methods, and alogorithms, for non-symmetric linear equations<sup>∗</sup>
scientific article; zbMATH DE number 895739

    Statements

    Saddle point methods, and alogorithms, for non-symmetric linear equations<sup>∗</sup> (English)
    0 references
    8 June 1997
    0 references
    saddle point algorithms
    0 references
    iterative methods
    0 references
    non-symmetric matrices
    0 references
    0 references

    Identifiers