Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation
type: Item
instance of: scholarly article
title: Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation
zbMATH Open document ID: 0803.65039
DOI: 10.1016/0898-1221(94)90064-7
author: W. D. McQuain
author: Calvin J. Ribbens
author: Layne T. Watson
author: Robert Melville
publication date: 1994-06-01T00:00:00Z
full work available at URL: http://eprints.cs.vt.edu/archive/00000287/
review text: The popular methods for solving large sparse systems: CG, GMRES, Bi- CGSTAB, QMR and LSQR, combined with ILU preconditioners, are applied to some linear problems arising in circuit simulation. The work looks like a technical report.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 94C05
zbMATH DE Number: 579948
zbMATH Keywords: linear sparse system
zbMATH Keywords: iterative method
zbMATH Keywords: CG
zbMATH Keywords: GMRES
zbMATH Keywords: Bi-CGSTAB
zbMATH Keywords: QMR
zbMATH Keywords: LSQR
zbMATH Keywords: ILU preconditioners
zbMATH Keywords: circuit simulation
reviewed by: Chunyang He
describes a project that uses: SPARSKIT
describes a project that uses: CRAIG
describes a project that uses: ITSOL
describes a project that uses: CGS
describes a project that uses: LSQR
describes a project that uses: HOMPACK
MaRDI profile type: Publication
OpenAlex ID: W2020767300
cites work: Algorithm 555: Chow-Yorke Algorithm for Fixed Points or Zeros of C 2 Maps [C5]
cites work: A globally convergent algorithm for computing fixed points of \(C^2\) maps
cites work: An Algorithm That is Globally Convergent with Probability One for a Class of Nonlinear Two-Point Boundary Value Problems
cites work: Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
cites work: Algorithm 652
cites work: Numerical Linear Algebra Aspects of Globally Convergent Homotopy Methods
cites work: Methods of conjugate gradients for solving linear systems
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: Implementation of the GMRES Method Using Householder Transformations
cites work: Implementations of the GMRES method
cites work: Q4091368
cites work: CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
cites work: QMR: A quasi-minimal residual method for non-Hermitian linear systems
cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
cites work: Calculating the Singular Values and Pseudo-Inverse of a Matrix
cites work: Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
cites work: Q4001836
cites work: Experiments with Conjugate Gradient Algorithms for Homotopy Curve Tracking
cites work: Preconditioned Iterative Methods for Homotopy Curve Tracking
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 579948