The influence of relaxed supernode partitions on the multifrontal method
From MaRDI portal
Publication:4371629
Cited in
(19)- Hypermatrix oriented supernode amalgamation
- A sparse nonlinear optimization algorithm
- New parallel sparse direct solvers for multicore architectures
- A supernodal block factorized sparse approximate inverse for non-symmetric linear systems
- Gigaflops in linear programming
- Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry
- Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
- An efficient analyse phase for element problems.
- Multifrontal computations on GPUs and their multi-core hosts
- Performance models and workload distribution algorithms for optimizing a hybrid CPU-GPU multifrontal solver
- Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes
- IPM based sparse LP solver on a heterogeneous processor
- Data-Parallel Sparse Factorization
- High-performance sampling of generic determinantal point processes
- Numerical methods for Kohn–Sham density functional theory
- A parallel sparse direct solver via hierarchical DAG scheduling
- Logarithmic barriers for sparse matrix cones
- A survey of direct methods for sparse linear systems
- Sparse linear least-squares problems
This page was built for publication: The influence of relaxed supernode partitions on the multifrontal method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371629)