Sparse Matrix Methods for Circuit Simulation Problems
DOI10.1007/978-3-642-22453-9_1zbMath1247.65107OpenAlexW156354643MaRDI QIDQ2902757
E. Natarajan, Timothy A. Davis
Publication date: 22 August 2012
Published in: Scientific Computing in Electrical Engineering SCEE 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22453-9_1
Computational methods for sparse matrices (65F50) Implicit ordinary differential equations, differential-algebraic equations (34A09) Numerical methods for differential-algebraic equations (65L80) Direct numerical methods for linear systems and matrix inversion (65F05) Packaged methods for numerical algorithms (65Y15)
Related Items (3)
Uses Software
Cites Work
- Algorithm 907
- The university of Florida sparse matrix collection
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
- Direct Methods for Sparse Linear Systems
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Supernodal Approach to Sparse Partial Pivoting
- A set of level 3 basic linear algebra subprograms
- A combined unifrontal/multifrontal method for unsymmetric sparse matrices
- An Approximate Minimum Degree Ordering Algorithm
- Algorithm 832
- A column approximate minimum degree ordering algorithm
- Algorithm 836
- Algorithm 837
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Sparse Matrix Methods for Circuit Simulation Problems
