Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation
From MaRDI portal
Publication:1323606
DOI10.1016/0898-1221(94)90064-7zbMath0803.65039OpenAlexW2020767300MaRDI QIDQ1323606
Calvin J. Ribbens, Layne T. Watson, W. D. McQuain, Robert Melville
Publication date: 1 June 1994
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: http://eprints.cs.vt.edu/archive/00000287/
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Analytic circuit theory (94C05)
Related Items
Unnamed Item ⋮ Unnamed Item ⋮ Multiple bifurcations generated by mode interactions in a reaction-diffusion problem ⋮ Conjugate gradient type methods for semilinear elliptic problems with symmetry
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A globally convergent algorithm for computing fixed points of \(C^2\) maps
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Implementations of the GMRES method
- Algorithm 652
- Implementation of the GMRES Method Using Householder Transformations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Numerical Linear Algebra Aspects of Globally Convergent Homotopy Methods
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- An Algorithm That is Globally Convergent with Probability One for a Class of Nonlinear Two-Point Boundary Value Problems
- Algorithm 555: Chow-Yorke Algorithm for Fixed Points or Zeros of C 2 Maps [C5]
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Preconditioned Iterative Methods for Homotopy Curve Tracking
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Experiments with Conjugate Gradient Algorithms for Homotopy Curve Tracking
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation
