On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
From MaRDI portal
Publication:2706301
DOI10.1137/S0895479899358443zbMath0979.05087MaRDI QIDQ2706301
Publication date: 19 March 2001
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement, An efficient high-order meshless method for advection-diffusion equations on time-varying irregular domains, Towards auction algorithms for large dense assignment problems, A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners, Partitioning and Reordering for Spike-Based Distributed-Memory Parallel Gauss--Seidel, Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices, On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices, On the row merge tree for sparse LU factorization with partial pivoting, Parallel solution of large-scale free surface viscoelastic flows via sparse approximate inverse preconditioning, A fully implicit, compact finite difference method for the numerical solution of unsteady laminar flames, $k$-Variance: A Clustered Notion of Variance, Adaptive AMG with coarsening based on compatible weighted matching, A GPU-based preconditioned Newton-Krylov solver for flexible multibody dynamics, Matching samples of multiple views, How to Generate Effective Block Jacobi Preconditioners for Solving Large Sparse Linear Systems, Unlabelled landmark matching via Bayesian data selection, and application to cell matching across imaging modalities, Automatic coarsening in algebraic multigrid utilizing quality measures for matching-based aggregations, Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition, HSL_MI28, A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs, A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs, Parallel Aggregation Based on Compatible Weighted Matching for AMG, Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge--Kutta Schemes for Parabolic PDEs, Preconditioning techniques based on the Birkhoff-von Neumann decomposition, A parallel sparse linear system solver based on Hermitian/skew-Hermitian splitting, A survey of direct methods for sparse linear systems, Preconditioning Helmholtz linear systems, Fast algorithms for placing large entries along the diagonal of a sparse matrix, A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices, \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers, A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers, Extending linear relaxation for non-square matrices and soft constraints, On accurate and time efficient solution of primal-mixed finite element equations in multiscale solid mechanics, A New Sparse $LDL^T$ Solver Using A Posteriori Threshold Pivoting, A \(2/3\)-approximation algorithm for vertex-weighted matching, Approximation algorithms in combinatorial scientific computing, Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems, A Robust Iterative Scheme for Symmetric Indefinite Systems, Surrogate parametric metamodel based on optimal transport, An implicit compact scheme solver for two-dimensional multicomponent flows, Parallel algorithms for solving linear systems with sparse triangular matrices, Partitioned symmetric formulation and solution algorithm of thermoelastic interaction problems, Max-Balanced Hungarian Scalings, A class of incomplete orthogonal factorization methods. II: Implemetation and results, Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning, Optimal detection of the feature matching map in presence of noise and outliers, Hybrid twins based on optimal transport, Analysis of a Splitting Approach for the Parallel Solution of Linear Systems on GPU Cards, Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices, Preconditioning techniques for large linear systems: A survey, Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
Uses Software
