Sparse matrix methods for circuit simulation problems
From MaRDI portal
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Numerical methods for differential-algebraic equations (65L80) Packaged methods for numerical algorithms (65Y15) Implicit ordinary differential equations, differential-algebraic equations (34A09)
Recommendations
Cites work
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Supernodal Approach to Sparse Partial Pivoting
- A column approximate minimum degree ordering algorithm
- A combined unifrontal/multifrontal method for unsymmetric sparse matrices
- A set of level 3 basic linear algebra subprograms
- Algorithm 832
- Algorithm 836
- Algorithm 837
- Algorithm 907
- An Approximate Minimum Degree Ordering Algorithm
- An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
- Depth-First Search and Linear Graph Algorithms
- Direct Methods for Sparse Linear Systems
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- The University of Florida sparse matrix collection
Cited in
(6)- scientific article; zbMATH DE number 4131527 (Why is no real title available?)
- Algorithm 907
- Electronic circuit simulation and the development of new Krylov-subspace methods
- KLU
- BiLQ: an iterative method for nonsymmetric linear systems with a quasi-minimum error property
- A holistic fast and parallel approach for accurate transient simulations of analog circuits
Describes a project that uses
Uses Software
This page was built for publication: Sparse matrix methods for circuit simulation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902757)