Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems

DOI10.1155/2013/408167zbMath1268.65045OpenAlexW2085876104WikidataQ59005803 ScholiaQ59005803MaRDI QIDQ2375537

Yan-Fei Jing, Bruno Carpentieri, Yong Duan, Ting-Zhu Huang

Publication date: 14 June 2013

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/408167

zbMATH Keywords

algorithmconvergencenumerical experimentspivot breakdownbiconjugate \(A\)-orthogonal residual methodbiconjugate gradient methodbiconjugate \(A\)-orthonormalization

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)

Related Items (1)

A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems

Uses Software

• SparseMatrix
• BiCOR
• CORS
• na1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the generation of Krylov subspace bases
• A comparative study of iterative solutions to linear systems arising in quantum mechanics
• Breakdowns in the implementation of the Lánczos method for solving linear systems
• A breakdown-free Lanczos type algorithm for solving linear systems
• Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
• An extension of the conjugate residual method to nonsymmetric linear systems
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Avoiding breakdown and near-breakdown in Lanczos type algorithms
• Approximate sparsity patterns for the inverse of a matrix and preconditioning
• An analysis of the composite step biconjugate gradient method
• A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
• Explicit approximate inverse preconditioning techniques
• New look-ahead Lanczos-type algorithms for linear systems
• Preconditioning techniques for large linear systems: A survey
• The university of Florida sparse matrix collection
• The BiCOR and CORS Iterative Algorithms for Solving Nonsymmetric Linear Systems
• Recent computational developments in Krylov subspace methods for linear systems
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• Reduction to Tridiagonal Form and Minimal Realizations
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
• Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• Combining Fast Multipole Techniques and an Approximate Inverse Preconditioner for Large Electromagnetism Calculations
• Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
• Hyperbolic Pairs in the Method of Conjugate Gradients

This page was built for publication: Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems