An adaptive CGNR algorithm for solving large linear systems

DOI10.1023/A:1012979827681MaRDI QIDQ5959304zbMATH OpenFDO

Authors Chunguang Li

Publication date 26 March 2002

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1012979827681

zbMATH Keywords

adaptive algorithmCGNR algorithmlinear systemsrobustness

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Review text

The author analyses the Conjugate Gradient Normal Residual algorithm (CGNR) and proves that it is both residual minimizing and error reducing. Then, by using a polynomial preconditioning he constructs an adaptive version of the CGNR algorithm. Numerical tests and comparisons with GMRES and classical CGNR algorithms are also reported.

Recommendations

• scientific article; zbMATH DE number 1735439
• scientific article; zbMATH DE number 1762043
• CGNR is an error reducing algorithm
• scientific article; zbMATH DE number 1281607
• Yet another polynomial preconditioner for the conjugate gradient algorithm

Cited in

(7)

• Non-adaptive and adaptive SAOR-CG algorithms
• CGNR is an error reducing algorithm
• scientific article; zbMATH DE number 1735439 (Why is no real title available?)
• scientific article; zbMATH DE number 1762043 (Why is no real title available?)
• An adaptive preconditioned BiCRSTAB algorithm for linear systems
• An adaptive multipreconditioned conjugate gradient algorithm
• Solving a large dense linear system by adaptive cross approximation

This page was built for publication: An adaptive CGNR algorithm for solving large linear systems

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