A survey of direct methods for sparse linear systems
From MaRDI portal
Publication:5740079
DOI10.1017/S0962492916000076zbMath1346.65011OpenAlexW2397636522MaRDI QIDQ5740079
Sivasankaran Rajamanickam, Timothy A. Davis, Wissam M. Sid-Lakhdar
Publication date: 8 July 2016
Published in: Acta Numerica (Search for Journal in Brave)
Full work available at URL: http://faculty.cse.tamu.edu/davis/publications_files/survey_tech_report.pdf
algorithmorderingparallel computationCholesky factorizationLU factorizationdirect methodsymbolic analysisQR factorizationsparse linear systemsurvey articlefrontal method
Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization, Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry, Randomized numerical linear algebra: Foundations and algorithms, A New Relaxed Splitting Preconditioner for Multidimensional Multi-Group Radiation Diffusion Equations, A variable neighborhood search and simulated annealing hybrid for the profile minimization problem, Gaussian random fields: with and without covariances, Split Bregman iteration for multi-period mean variance portfolio optimization, Efficient approaches for the flooding problem on graphs, Error estimates for discrete generalized FEMs with locally optimal spectral approximations, Hierarchical subspace evolution method for super large parallel computing: A linear solver and an eigensolver as examples, Automating algorithm selection: checking for matrix properties that can simplify computations, Sparse Recovery of Elliptic Solvers from Matrix-Vector Products, Exact QR factorizations of rectangular matrices, Avoiding Communication in Primal and Dual Block Coordinate Descent Methods, A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling, Incremental proper orthogonal decomposition for PDE simulation data, Minimal residual based iterative methods and its parallel implementation for sparse linear systems, Sparsity preserving optimal control of discretized PDE systems, Aggregation of Markov flows I: theory, Efficient Preconditioned Iterative Linear Solvers for 3-D Magnetostatic Problems Using Edge Elements, Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations, A Hypergraph Partitioning Model for Profile Minimization, On a conjugate directions method for solving strictly convex QP problem, Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work, Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations, Efficient Direct Space-Time Finite Element Solvers for Parabolic Initial-Boundary Value Problems in Anisotropic Sobolev Spaces, On the tree-depth and tree-width in heterogeneous random graphs, Gaussian Belief Propagation Solvers for Nonsymmetric Systems of Linear Equations, RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems
Uses Software
Cites Work
- Efficient Methods for Out-of-Core Sparse Cholesky Factorization
- The Factorization of Sparse Symmetric Indefinite Matrices
- An Approximate Minimum Degree Ordering Algorithm
- The Minimum Degree Ordering with Constraints
- Solving Sparse Linear Systems with Sparse Backward Error
- A two‐step approach to finite element ordering
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices
- An Unsymmetrized Multifrontal LU Factorization
- Reversing the row order for the row-by-row frontal method
- Ordering Givens Rotations for Sparse $QR$ Factorization
- Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
- A spectral algorithm for envelope reduction of sparse matrices
- Compressed Graphs and the Minimum Degree Algorithm
- Distributed Sparse Gaussian Elimination and Orthogonal Factorization
- Some Results on Structure Prediction in Sparse $QR$ Factorization
- Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
- Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers
- Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
- On evaluating elimination tree based parallel sparse cholesky factorizations
- Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
- Design of a Multicore Sparse Cholesky Factorization Using DAGs
- The use of profile reduction algorithms with a frontal code
- Parallel Computation of Entries of ${A}^{-1}$
- Improving Multifrontal Methods by Means of Block Low-Rank Representations
- A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling
- Elimination Structures for Unsymmetric Sparse $LU$ Factors
- Exploiting Structural Symmetry in a Sparse Partial Pivoting Code
- Optimal Parallel Solution of Sparse Triangular Systems
- Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
- Randomized Sparse Direct Solvers
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- Row Modifications of a Sparse Cholesky Factorization
- The Theory of Elimination Trees for Sparse Unsymmetric Matrices
- On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
- Optimal Weighted Matchings for Rank-Deficient Sparse Matrices
- Diagonal Markowitz Scheme with Local Symmetrization
- Unsymmetric Ordering Using A Constrained Markowitz Scheme
- Analysis and comparison of two general sparse solvers for distributed memory computers
- FLAME
- Recent advances in direct methods for solving unsymmetric sparse systems of linear equations
- Implementing Hager's exchange methods for matrix profile reduction
- A software package for sparse orthogonal factorization and updating
- SuperLU_DIST
- Parallel frontal solvers for large sparse linear systems
- The design and implementation of a new out-of-core sparse cholesky factorization method
- A parallel direct solver for large sparse highly unsymmetric linear systems
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
- Algorithm 832
- A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations
- A column approximate minimum degree ordering algorithm
- Algorithm 836
- Algorithm 837
- Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
- A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous Equations
- Row-column permutation of sparse matrices
- The Product Form of Inverses of Sparse Matrices and Graph Theory
- Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
- The least squares problem and pseudo-inverses
- Computations with Sparse Matrices
- On the Product Form of Inverses of Sparse Matrices
- Solution of a system of simultaneous linear equations with a sparse coefficient matrix by elimination methods
- The Solution of Large Sparse Unsymmetric Systems of Linear Equations
- Reinversion with the preassigned pivot procedure
- Depth-First Search and Linear Graph Algorithms
- A frontal solution program for finite element analysis
- On Block Elimination for Sparse Linear Systems
- Partial Pivoting Strategies for Symmetric Matrices
- Nested Dissection of a Regular Finite Element Mesh
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- On updating the structure of sparse matrix factors
- An algorithm for frontwidth reduction
- An algorithm for frontwidth reduction
- Two-level dynamic scheduling in PARDISO: Improved scalability on shared memory multiprocessing systems
- PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems
- Computing row and column counts for sparse \(QR\) and \(LU\) factorization
- Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods
- Algorithms and software for in-core factorization of sparse symmetric positive definite matrices
- An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices
- A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs
- An Automatic One-Way Dissection Algorithm for Irregular Finite Element Problems
- Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination
- Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
- A Data Structure for Parallel L/U Decomposition
- Storage Requirements for Profile and Frontal Elimination
- Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
- A New Implementation of Sparse Gaussian Elimination
- Yale sparse matrix package I: The symmetric codes
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- A Note on the NP-Completeness of Vertex Elimination on Directed Graphs
- Computing the Minimum Fill-In is NP-Complete
- An equation numbering algorithm based on a minimum front criteria
- Parallel Algorithms for Sparse Linear Systems
- Structure-Preserving and Rank-Revealing QR-Factorizations
- Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization
- Sparse Matrices in MATLAB: Design and Implementation
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- A Fast Reordering Algorithm for Parallel Sparse Triangular Solution
- Highly Parallel Sparse Cholesky Factorization
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- On Finding Supernodes for Sparse Matrix Computations
- A Note on Nested Dissection for Rectangular Grids
- Efficiency of a Good But Not Linear Set Union Algorithm
- A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination
- A Note on Fill for Sparse Matrices
- Solution of linear equations with skyline-stored symmetric matrix
- Frontal solution program for unsymmetric matrices
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Comparison of Several Bandwidth and Profile Reduction Algorithms
- On George’s Nested Dissection Method
- On Permutations to Block Triangular Form
- Algorithmic Aspects of Vertex Elimination on Graphs
- Hierarchical partition—a new optimal pivoting algorithm
- Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems
- Algorithmic Aspects of Vertex Elimination on Directed Graphs
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
- On the Application of the Minimum Degree Algorithm to Finite Element Systems
- Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems
- An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
- Incomplete Nested Dissection for Solving n by n Grid Problems
- Algorithms for sparse Gaussian elimination with partial pivoting
- Some Design Features of a Sparse Matrix Code
- A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
- Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and Indefinite
- The Design of a User Interface for a Sparse Matrix Package
- An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
- Numerical Linear Algebra for High-Performance Computers
- Geometric Mesh Partitioning: Implementation and Experiments
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Improving the Run Time and Quality of Nested Dissection Ordering
- Accurate Symmetric Indefinite Linear Equation Solvers
- Modifying a Sparse Cholesky Factorization
- A Supernodal Approach to Sparse Partial Pivoting
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- A Mapping Algorithm for Parallel Sparse Cholesky Factorization
- A parallel row‐oriented sparse solution method for finite element structural analysis
- Predicting Structure in Sparse Matrix Computations
- An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
- Row Ordering for a Sparse QR Decomposition
- An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
- A Cartesian Parallel Nested Dissection Algorithm
- An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
- ScaLAPACK Users' Guide
- The design of a new frontal code for solving sparse, unsymmetric systems
- The design of MA48
- Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
- Sparse QR factorization in MATLAB
- A graph partitioning algorithm by node separators
- The influence of relaxed supernode partitions on the multifrontal method
- The multifrontal method and paging in sparse Cholesky factorization
- A set of level 3 basic linear algebra subprograms
- Computing the block triangular form of a sparse matrix
- A generalized envelope method for sparse factorization by rows
- Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
- Node Selection Strategies for Bottom-Up Sparse Matrix Ordering
- Robust Ordering of Sparse Matrices using Multisection
- Data-Parallel Sparse Factorization
- Reordering for parallelism
- Solution of sparse quasi-square rectangular systems by Gaussian elimination
- A Note on the Column Elimination Tree
- A combined unifrontal/multifrontal method for unsymmetric sparse matrices
- A frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications
- PARDISO: a high-performance serial and parallel sparse linear solver in semiconductor device simulation
- Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- 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 Object-Oriented Approach to the Design of a User Interface for a Sparse Matrix Package
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
- Parallel sparse matrix solution and performance
- Parallel sparse QR factorization on shared memory architectures
- A note on communication analysis of parallel sparse Cholesky factorization on a hypercube
- Parallel nested dissection
- Parallel sparse Gaussian elimination with partial pivoting
- Parallel pivoting algorithms for sparse symmetric matrices
- Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
- Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers
- On the row merge tree for sparse LU factorization with partial pivoting
- Task scheduling for parallel sparse Cholesky factorization
- The solution of large-scale least-squares problems on supercomputers
- Parallel symbolic factorization of sparse linear systems
- Sparse QR factorization on a massively parallel computer
- Analysis of the solution phase of a parallel multifrontal approach
- The design and use of a sparse direct solver for skew symmetric matrices
- Parallel algorithms for solving linear systems with sparse triangular matrices
- A pipelined Givens method for computing the QR factorization of a sparse matrix
- Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
- Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
- Computational models and task scheduling for parallel sparse Cholesky factorization
- Householder reflections versus Givens rotations in sparse orthogonal decomposition
- Parallel implementation of multifrontal schemes
- Sparse matrix calculations on the CRAY-2
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Solution of sparse positive definite systems on a shared-memory multiprocessor
- The analysis of a nested dissection algorithm
- A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
- A parallel graph partitioning algorithm for a message-passing multiprocessor
- A direct method for sparse least squares problems with lower and upper bounds
- Reordering sparse matrices for parallel elimination
- Solution of sparse positive definite systems on a hypercube
- Parallel pivoting combined with parallel reduction and fill-in control
- On the augmented system approach to sparse least-squares problems
- Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
- On symbolic factorization of partitioned sparse symmetric matrices
- Solution of sparse linear least squares problems using Givens rotations
- A direct method for the solution of sparse linear least squares problems
- Comparison of two pivotal strategies in sparse plane rotations
- A parallel algorithm for elimination tree computation and symbolic factorization
- Parallel sparse Cholesky factorization on a shared memory multiprocessor
- Supernodal symbolic Cholesky factorization on a local-memory multiprocessor
- Parallel algorithms for sparse triangular system solution
- Pivot selection and row ordering in Givens reduction on sparse matrices
- The NP-completeness of the bandwidth minimization problem
- Communication results for parallel sparse Cholesky factorization on a hypercube
- A coarse-grained parallel QR-factorization algorithm for sparse least squares problems
- A review of frontal methods for solving linear systems
- Finding exact solutions to the bandwidth minimization problem
- A fast LU update for linear programming
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
- Predicting the structure of sparse orthogonal factors
- A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
- Using domain decomposition to find graph bisectors
- Two improved algorithms for envelope and wavefront reduction
- A parallel multifrontal algorithm and its implementation
- Parallel ordering using edge contraction
- Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- A large scale, sparse, secondary storage, direct linear equation solver for structural analysis and its implementation on vector and parallel architectures
- Symbolic Cholesky factorization on a local-memory multiprocessor
- Independent set orderings for parallel matrix factorization by Gaussian elimination
- Multiprocessing a sparse matrix code on the Alliant FX/8
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
- A new approach to minimising the frontwidth in finite element calculations
- A new pivoting strategy for Gaussian elimination
- Minimum communication cost reordering for parallel sparse Cholesky factorization
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- On the orthonormalization of sparse vectors
- On the Gaussian elimination method for inverting sparse matrices
- On the fill-in when sparse vectors are orthonormalized
- On the optimal choice of pivots for the Gaussian elimination
- Note on minimizing the bandwidth of sparse, symmetric matrices
- Minimizing the bandwidth of sparse symmetric matrices
- Towards an accurate performance modeling of parallel sparse factorization
- A shared- and distributed-memory parallel general sparse direct solver
- S+: Efficient 2D Sparse LU Factorization on Parallel Machines
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
- Multiple-Rank Modifications of a Sparse Cholesky Factorization
- Exact Prediction of QR Fill-In by Row-Merge Trees
- The Elimination form of the Inverse and its Application to Linear Programming
- Minimizing the Profile of a Symmetric Matrix
- Minimal Orderings Revisited
- Nested-Dissection Orderings for Sparse LU with Partial Pivoting
- A Sparse Symmetric Indefinite Direct Solver for GPU Architectures
- Fine-Grained Multithreading for the Multifrontal $QR$ Factorization of Sparse Matrices
- On the Minimum FLOPs Problem in the Sparse Cholesky Factorization
- Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs
- An efficient analyse phase for element problems
- Scaling and pivoting in an out-of-core sparse direct solver
- Algorithm 907
- Design, implementation, and analysis of maximum transversal algorithms
- Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors
- Optimal Parallel Scheduling of Gaussian Elimination DAG's
- Reducing the I/O Volume in Sparse Out-of-core Multifrontal Methods
- Fast algorithms for hierarchically semiseparable matrices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
- Sparse Multifrontal Rank Revealing QR Factorization
- Sparsity Analysis of the $QR$ Factorization
- Parallel Sparse LU Decomposition on a Mesh Network of Transputers
- A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
- On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment
- Algorithm 930
- Pivoting strategies for tough sparse indefinite systems
- Algorithm 933
- A Fan-In Algorithm for Distributed Sparse Numerical Factorization
- Solution of Sparse Underdetermined Systems of Linear Equations
- Direct Methods for Solving Sparse Systems of Linear Equations
- The Multifrontal Solution of Unsymmetric Sets of Linear Equations
- TWO THEOREMS IN GRAPH THEORY
- The Use of Linear Graphs in Gauss Elimination
- A memory-economic frontwidth reduction algorithm
- A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
- Design Features of a Frontal Code for Solving Sparse Unsymmetric Linear Systems Out-of-Core
- Sparse matrix factor modification in structural reanalysis
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
- Incremental Condition Estimation for Sparse Matrices
- Limiting Communication in Parallel Sparse Cholesky Factorization
- A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems
- A frontal solver for the 21st century
- Direct Methods for Sparse Linear Systems
- A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
- The Role of Elimination Trees in Sparse Factorization
- A New Algorithm for Finding a Pseudoperipheral Node in a Graph
- On the Complexity of Sparse Gaussian Elimination via Bordering
- On the Performance of the Minimum Degree Ordering for Gaussian Elimination
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Use of the ${\text{P}}^4 $ and ${\text{P}}^5 $ Algorithms for In-Core Factorization of Sparse Matrices
- A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization
- Sparse Orthogonal Decomposition on a Hypercube Multiprocessor
- Parallel Symbolic Factorization for Sparse LU with Static Pivoting
- An overview of SuperLU
- Algorithm 849
- Towards Stable Mixed Pivoting Strategies for the Sequential and Parallel Solution of Sparse Symmetric Indefinite Systems
- Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices
- Constructing memory-minimizing schedules for multifrontal methods
- Experiences of sparse direct symmetric solvers
- An out-of-core sparse symmetric-indefinite factorization method
- Parallel unsymmetric-pattern multifrontal sparse LU with column preordering
- An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- On the Block Triangular Form of Symmetric Matrices
- Fast Computation of Minimal Fill Inside A Given Elimination Ordering
- Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting
- A Note on the Work Involved in No-fill Sparse Matrix Factorization
- On Row and Column Orderings for Sparse Least Squares Problems
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- A Sparse Matrix Package—Part II: Special Cases
- A General Updating Algorithm for Constrained Linear Least Squares Problems
- Modification of the minimum-degree algorithm by multiple elimination
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- Numerical Methods for Large Sparse Linear Least Squares Problems
- A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
- Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations
- A time—memory trade-off frontwidth reduction algorithm for finite element analysis
- Auxiliary Storage Methods for Solving Finite Element Systems
- An algorithm for profile and wavefront reduction of sparse matrices
- A compact row storage scheme for Cholesky factors using elimination trees
- On General Row Merging Schemes for Sparse Givens Transformations
- A Linear Time Implementation of Profile Reduction Algorithms for Sparse Matrices
- General Sparse Elimination Requires No Permanent Integer Storage
- On the storage requirement in the out-of-core multifrontal method for sparse factorization
- A partial pivoting strategy for sparse symmetric matrix decomposition
- A node-addition model for symbolic factorization
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
- An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme
- Evaluation of Orderings for Unsymmetric Sparse Matrices
- Predicting fill for sparse orthogonal factorization
- Sparse Cholesky Factorization on a Local-Memory Multiprocessor
- A Modified Frontal Technique Suitable for Parallel Systems
- A Data Structure for Sparse $QR$ and $LU$ Factorizations
- Remarks on implementation of O ( n 1/2 τ) assignment algorithms
- The Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination
- Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
- A Tree Model for Sparse Symmetric Indefinite Matrix Factorization
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- A Note on Sparse Factorization in a Paging Environment
- Pairwise reduction for the direct, parallel solution of sparse, unsymmetric sets of linear equations
- On threshold pivoting in the multifrontal method for sparse indefinite systems
- On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
- Sparse matrix test problems
- The Evolution of the Minimum Degree Ordering Algorithm
- A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs
- LAPACK Users' Guide
- A Minimal Storage Implementation of the Minimum Degree Algorithm
- On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique
- A frontal procedure using skyline storage
- A Separator Theorem for Planar Graphs
- An Implementation of a Pseudoperipheral Node Finder
- Generalized Nested Dissection
- A Computation Model of Parallel Solution of Linear Equations
- A linear time implementation of the reverse Cuthill-McKee algorithm
- Automatic reduction of frontwidth for finite element analysis
