The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
From MaRDI portal
Publication:4702235
DOI10.1137/S0895479897317661zbMath0947.65048OpenAlexW2017431061MaRDI QIDQ4702235
Publication date: 24 November 1999
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479897317661
algorithmspreconditioningiterative methodssparse matricesdirect methodsreorderingsmaximum transversal
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems, A two-level ILU preconditioner for electromagnetic applications, On projected Newton-Krylov solvers for instationary laminar reacting gas flows, Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, First-order continuation method for steady-state variably saturated groundwater flow modeling, A GPU-based preconditioned Newton-Krylov solver for flexible multibody dynamics, On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems, Large-scale Sparse Inverse Covariance Matrix Estimation, Fast computational methods for locating fold points for the power flow equations., A SBS-BD based solver for domain decomposition in BE methods, A high performance level-block approximate LU factorization preconditioner algorithm, State-of-the-Art Sparse Direct Solvers, Parallel Hybrid Sparse Linear System Solvers, Comparison of nonlinear solvers within continuation method for steady-state variably saturated groundwater flow modelling, Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations, A scaling algorithm for polynomial constraint satisfaction problems, Preconditioning techniques based on the Birkhoff-von Neumann decomposition, VBARMS: a variable block algebraic recursive multilevel solver for sparse linear systems, An algebraic multifrontal preconditioner that exploits the low‐rank property, A survey of direct methods for sparse linear systems, Unnamed Item, A block version of left-looking AINV preconditioner with one by one or two by two block pivots, A mathematical model for the simulation of the contraction of burns, JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices, A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices, Nonlinearity continuation method for steady-state groundwater flow modeling in variably saturated conditions, Combinatorial Aspects in Sparse Elimination Methods, A refinement of an iterative orthogonal projection method, On Techniques to Improve Robustness and Scalability of a Parallel Hybrid Linear Solver, Factoring matrices into the product of circulant and diagonal matrices, Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems, An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling, Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations, Parallel algorithms for solving linear systems with sparse triangular matrices, Max-Balanced Hungarian Scalings, The impact of high-performance computing in the solution of linear systems: Trends and problems, Diagonal Scaling of Ill-Conditioned Matrixes by Genetic Algorithm, Analysis of a Splitting Approach for the Parallel Solution of Linear Systems on GPU Cards, Preconditioning techniques for large linear systems: A survey
Uses Software
