A variable metric method for approximating generalized inverses of matrices

DOI10.1002/1521-4001(200107)81:7%3C435::AID-ZAMM435%3E3.0.CO;2-5MaRDI QIDQ2747483zbMATH OpenOpenAlexFDO

Authors Josef Stoer, A. Mohsen

Publication date 6 June 2002

Published in ZAMM. Zeitschrift für Angewandte Mathematik und Mechanik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/1521-4001(200107)81:7%3C435::aid-zamm435%3E3.0.co;2-5

zbMATH Keywords

sparse matricesMoore-Penrose inversegeneralized inversesKrylov methodnumerical comparisonconjugate gradient methodsBroyden-Fletcher-Goldfarb-Shannon methodvariable metric methodsDennis-Fletcher-Powell method

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Recommendations

• scientific article; zbMATH DE number 27282
• scientific article; zbMATH DE number 465358
• scientific article; zbMATH DE number 671780
• scientific article; zbMATH DE number 5575640
• Fast secant methods for the iterative solution of large nonsymmetric linear systems

Cites work

• scientific article; zbMATH DE number 1143729 (Why is no real title available?)
• A Generalization of the Conjugate-Gradient Method to Solve Complex Systems
• A Generalized Broyden’s Method for Solving Simultaneous Linear Equations
• A comparison of some GMRES-like methods
• A simple algorithm for computing the generalized inverse of a matrix
• Accelerating with rank-one updates
• An Application of the Cayley-Hamilton Theorem to Generalized Matrix Inversion
• An Elimination Method for Computing the Generalized Inverse of an Arbitrary Complex Matrix
• An iterative method for computing generalized inverses
• Computation of Pseudoinverse Matrices Using Residue Arithmetic
• Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
• Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix
• Fast secant methods for the iterative solution of large nonsymmetric linear systems
• How Fast are Nonsymmetric Matrix Iterations?
• Methods of conjugate gradients for solving linear systems
• On Iterative Computation of Generalized Inverses and Associated Projections
• On the limited memory BFGS method for large scale optimization
• Pseudoinversus and conjugate gradients
• Representations of quasi-Newton matrices and their use in limited memory methods
• Singular value decomposition and least squares solutions
• The N‐Step Iteration Procedures

Cited in

(4)

• scientific article; zbMATH DE number 671780 (Why is no real title available?)
• Scalar correction method for finding least-squares solutions on Hilbert spaces and its applications
• scientific article; zbMATH DE number 5802263 (Why is no real title available?)
• scientific article; zbMATH DE number 4041642 (Why is no real title available?)

This page was built for publication: A variable metric method for approximating generalized inverses of matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2747483)