HSL_MA87

swMATH13037MaRDI QIDQ24957FDOQ24957

Author name not available (Why is that?)

Described by source

• Design of a Multicore Sparse Cholesky Factorization Using DAGs

Cited In (17)

• On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
• A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
• Sparse Cholesky factorization on FPGA using parameterized model
• SemiAutomatic Task Graph Construction for $\mathcal{H}$-Matrix Arithmetic
• New parallel sparse direct solvers for multicore architectures
• A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
• \(\mathcal H\)-LU factorization on many-core systems
• Reordering Strategy for Blocking Optimization in Sparse Linear Solvers
• Pivoting strategies for tough sparse indefinite systems
• A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints
• Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
• Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes
• An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
• Solving large linear least squares problems with linear equality constraints
• Multilevel Balancing Domain Decomposition at Extreme Scales
• Experiments with sparse Cholesky using a sequential task-flow implementation
• A dual gradient-projection method for large-scale strictly convex quadratic problems

This page was built for software: HSL_MA87