Direct methods for sparse matrices
Direct methods for sparse matrices
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
A set of level 3 basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
Computing the block triangular form of a sparse matrix
ACM Transactions on Mathematical Software (TOMS)
LAPACK's user's guide
Exploiting structural symmetry in a sparse partial pivoting code
SIAM Journal on Scientific Computing
ACM Transactions on Mathematical Software (TOMS)
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
ACM Transactions on Mathematical Software (TOMS)
Algorithm 529: Permutations To Block Triangular Form [F1]
ACM Transactions on Mathematical Software (TOMS)
Some Design Features of a Sparse Matrix Code
ACM Transactions on Mathematical Software (TOMS)
Basic Linear Algebra Subprograms for Fortran Usage
ACM Transactions on Mathematical Software (TOMS)
On Algorithms for Obtaining a Maximum Transversal
ACM Transactions on Mathematical Software (TOMS)
Algorithm 575: Permutations for a Zero-Free Diagonal [F1]
ACM Transactions on Mathematical Software (TOMS)
A combined unifrontal/multifrontal method for unsymmetric sparse matrices
ACM Transactions on Mathematical Software (TOMS)
Parallel Pivots LU Algorithm on the Cray T3E
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
Analysis of large GSPN models: a distributed solution tool
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
Parallel frontal solvers for large sparse linear systems
ACM Transactions on Mathematical Software (TOMS)
A parallel direct solver for large sparse highly unsymmetric linear systems
ACM Transactions on Mathematical Software (TOMS)
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
ACM Transactions on Mathematical Software (TOMS)
| Hi-index | 0.00 |
We describe the design of a new code for the direct solution of sparse unsymmetric linear systems of equations. The new code utilizes a novel restructuring of the symbolic and numerical phases, which increases speed and saves storage without sacrifice of numerical stability. Other features include switching to full-matrix processing in all phases of the computation enabling the use of all three levels of BLAS, treatment of rectangular or rank-deficient matrices, partial factorization, and integrated facilities for iterative refinement and error estimation.