Saddle point methods, and alogorithms, for non-symmetric linear equations∗

DOI10.1080/01630569508816665zbMath0863.65014OpenAlexW2171895575MaRDI QIDQ4883628

J. F. G. Auchmuty

Publication date: 8 June 1997

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630569508816665

zbMATH Keywords

iterative methodsnon-symmetric matricessaddle point algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Cites Work

• Unnamed Item
• Duality for non-convex variational principles
• Generalized conjugate directions
• A posteriori error estimates for linear equations
• A Taxonomy for Conjugate Gradient Methods
• Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
• Iterative Solution Methods
• On the Convergence of the Conjugate Gradient Method for Singular Linear Operator Equations

This page was built for publication: Saddle point methods, and alogorithms, for non-symmetric linear equations^∗