Algorithm 837

DOI10.1145/1024074.1024081zbMath1070.65534OpenAlexW2074093855WikidataQ113310740 ScholiaQ113310740MaRDI QIDQ5461208

Timothy A. Davis, Unnamed Author, Patrick R. Amestoy, Iain S. Duff

Publication date: 22 July 2005

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1024074.1024081

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graph algorithms (graph-theoretic aspects) (05C85) Direct numerical methods for linear systems and matrix inversion (65F05) Packaged methods for numerical algorithms (65Y15)

Related Items

Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization, Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure, State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control, Conic optimization via operator splitting and homogeneous self-dual embedding, Parallel preconditioners for monolithic solution of shear bands, Sparse Matrix Methods for Circuit Simulation Problems, A Hierarchical Low Rank Schur Complement Preconditioner for Indefinite Linear Systems, A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems, Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations, Explicit and implicit methods for shear band modeling at high strain rates, Fast Computation of Spectral Densities for Generalized Eigenvalue Problems, Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners, A multiscale computational framework using active learning to model complex suspension flows, Radial basis function interpolation on irregular domain through conformal transplantation, Computationally efficient techniques for spatial regression with differential regularization, Domain decomposition methods for 3D crack propagation problems using XFEM, Schur complement-based domain decomposition preconditioners with low-rank corrections, Phase field topology optimisation for 4D printing, On large-scale generalized inverses in solving two-by-two block linear systems, Cholesky decomposition of a positive semidefinite matrix with known kernel, Overhang penalization in additive manufacturing via phase field structural topology optimization with anisotropic energies, Hierarchical Gaussian graphical models: beyond reversible jump, Experiments with sparse Cholesky using a sequential task-flow implementation, HSL_MI28, A general scheme for log-determinant computation of matrices via stochastic polynomial approximation, An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems, New parallel sparse direct solvers for multicore architectures, Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension, A new relaxed PSS preconditioner for nonsymmetric saddle point problems, Efficient Preconditioned Iterative Linear Solvers for 3-D Magnetostatic Problems Using Edge Elements, Sparse approximate inverse preconditioners on high performance GPU platforms, A survey of direct methods for sparse linear systems, OSQP: An Operator Splitting Solver for Quadratic Programs, A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods, Sparse Hessian factorization in curved trajectories for unconstrained minimization, Efficient Algorithms for Bayesian Nearest Neighbor Gaussian Processes, A primal-dual interior-point algorithm for quadratic programming, On stable parametric finite element methods for the Stefan problem and the Mullins-Sekerka problem with applications to dendritic growth, An Algebraic Multilevel Preconditioner with Low-Rank Corrections for Sparse Symmetric Matrices, Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion, An efficient second-order cone programming approach for optimal selection in tree breeding, Block splitting for distributed optimization, AMD, A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows, Cahn-Hilliard-Brinkman systems for tumour growth, A Sparse Symmetric Indefinite Direct Solver for GPU Architectures, High performance sparse solver for unsymmetrical linear equations with out-of-core strategies and its application on meshless methods, An ADMM-based interior-point method for large-scale linear programming, Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices, QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs, Tree decompositions and social graphs, A Rational Function Preconditioner For Indefinite Sparse Linear Systems