Composite Step Product Methods for Solving Nonsymmetric Linear Systems
From MaRDI portal
Publication:4717319
DOI10.1137/S1064827594269202zbMath0862.65018WikidataQ57397397 ScholiaQ57397397MaRDI QIDQ4717319
Publication date: 25 May 1997
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
convergencenumerical examplesproduct methodspivot breakdownBi-CGSTABbi-conjugate gradient algorithmcomposite step methodconjugate gradient squared methodsCS-CGSTAB
Related Items (8)
VPAStab\((J,L)\): an iterative method with look-ahead for the solution of large sparse linear systems ⋮ A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems ⋮ A theoretical overview of Krylov subspace methods ⋮ IDR: a new generation of Krylov subspace methods? ⋮ Rapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks. ⋮ A new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrences ⋮ A new iterative method for solving complex symmetric linear systems ⋮ A Neumann-Neumann preconditioned iterative substructuring approach for computing solutions to Poisson's equation with prescribed jumps on an embedded boundary
Uses Software
This page was built for publication: Composite Step Product Methods for Solving Nonsymmetric Linear Systems
