Pages that link to "Item:Q3981404"
From MaRDI portal
The following pages link to Parallel Algorithms for Sparse Linear Systems (Q3981404):
Displaying 26 items.
- Alya: computational solid mechanics for supercomputers (Q338750) (← links)
- A fast algorithm for sparse matrix computations related to inversion (Q401614) (← links)
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions (Q422929) (← links)
- Minimizing elimination tree height can increase fill more than linearly (Q671941) (← links)
- Sparse QR factorization on a massively parallel computer (Q973426) (← links)
- An implementation of a parallel primal-dual interior point method for block- structured linear programs (Q1203072) (← links)
- A parallel interior point algorithm for linear programming on a network of transputers (Q1309858) (← links)
- An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations (Q1322460) (← links)
- A parallel multifrontal algorithm and its implementation (Q1387979) (← links)
- A quality and distance guided hybrid algorithm for the vertex separator problem (Q1652081) (← links)
- Parallel implementation of finite-element/Newton method for solution of steady-state and transient nonlinear partial differential equations (Q1908496) (← links)
- Sparse Cholesky factorization on FPGA using parameterized model (Q1992573) (← links)
- Tests with FALKSOL. A massively parallel multi-level domain decomposing direct solver (Q2047574) (← links)
- The vertex separator problem: a polyhedral investigation (Q2487852) (← links)
- Improving parallel ordering of sparse matrices using genetic algorithms (Q2576753) (← links)
- Parallelized integrated nested Laplace approximations for fast Bayesian inference (Q2677902) (← links)
- A parallel computational method in steady power-law creep (Q2712688) (← links)
- Multifrontal Computations on GPUs and Their Multi-core Hosts (Q3081345) (← links)
- A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION (Q4238523) (← links)
- Data-Parallel Sparse Factorization (Q4389260) (← links)
- Reordering for parallelism (Q4392334) (← links)
- FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture (Q4665365) (← links)
- On evaluating elimination tree based parallel sparse cholesky factorizations (Q4955154) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
- A New Lower Bound on the Size of the Smallest Vertex Separator of a Graph (Q5862814) (← links)
