scientific article; zbMATH DE number 2098239
DOI<649::AID-NLA217>3.0.CO;2-W 10.1002/1099-1506(200010/12)7:7/8<649::AID-NLA217>3.0.CO;2-WzbMath1051.65028MaRDI QIDQ4814503
Christiaan Willem Bomhof, Henk A. van der Vorst
Publication date: 7 September 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schur complementGMRESpreconditionercircuit simulationiterative solution methodsparallel iterative methodsparse LU factorizationmixed direct/iterative method
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Analytic circuit theory (94C05) Complexity and performance of numerical algorithms (65Y20)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
- The Role of Elimination Trees in Sparse Factorization
- Modification of the minimum-degree algorithm by multiple elimination
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization
- Sparse Matrices in MATLAB: Design and Implementation
- A Note on Nested Dissection for Rectangular Grids
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Supernodal Approach to Sparse Partial Pivoting
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
This page was built for publication: