The influence of relaxed supernode partitions on the multifrontal method
From MaRDI portal
Publication:4371629
DOI10.1145/76909.76910zbMath0900.65061OpenAlexW1998276913MaRDI QIDQ4371629
Roger. G. Grimes, Cleve Ashcraft
Publication date: 18 March 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1989-15/
Computational methods for sparse matrices (65F50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (18)
Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry ⋮ A sparse nonlinear optimization algorithm ⋮ Logarithmic barriers for sparse matrix cones ⋮ Performance models and workload distribution algorithms for optimizing a hybrid CPU-GPU multifrontal solver ⋮ Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking ⋮ An efficient analyse phase for element problems ⋮ Gigaflops in linear programming ⋮ IPM based sparse LP solver on a heterogeneous processor ⋮ New parallel sparse direct solvers for multicore architectures ⋮ A supernodal block factorized sparse approximate inverse for non-symmetric linear systems ⋮ Data-Parallel Sparse Factorization ⋮ A survey of direct methods for sparse linear systems ⋮ Hypermatrix oriented supernode amalgamation ⋮ Multifrontal Computations on GPUs and Their Multi-core Hosts ⋮ Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes ⋮ Numerical methods for Kohn–Sham density functional theory ⋮ High-performance sampling of generic determinantal point processes ⋮ A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling
Uses Software
This page was built for publication: The influence of relaxed supernode partitions on the multifrontal method
