Minimal residual algorithm and matrix-vector information

DOI10.1016/0898-1221(96)00125-3MaRDI QIDQ1816693zbMATH OpenOpenAlexFDO

Authors Giovanni Manzini, Luciano Margara

Publication date 19 December 1996

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(96)00125-3

zbMATH Keywords

condition numberinformation based complexityKrylov informationKrylov subspaceslarge linear systemsmatrix-vector informationminimal residual algorithm

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• On the Optimal Solution of Large Linear Systems
• On the optimality of Krylov information
• On the optimal solution of large eigenpair problems
• A minimal residual class of algorithms for linear systems
• A minimal residual method for a special class of linear systems with normal matrices of coefficients

Cites work

• scientific article; zbMATH DE number 44104 (Why is no real title available?)
• Information-based complexity of linear operator equations
• On optimality of Krylov's information when solving linear operator equations
• On the Optimal Solution of Large Linear Systems
• On the optimality of Krylov information

Cited in

(5)

• On optimality of Krylov's information when solving linear operator equations
• On the Optimal Solution of Large Linear Systems
• scientific article; zbMATH DE number 4182797 (Why is no real title available?)
• On the optimality of Krylov information
• Low synchronization Gram–Schmidt and generalized minimal residual algorithms

This page was built for publication: Minimal residual algorithm and matrix-vector information

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