Parallel Algorithms for Sparse Linear Systems
From MaRDI portal
Recommendations
Cited in
(42)- Parallel, iterative solution of sparse linear systems: Models and architectures
- Computational models and task scheduling for parallel sparse Cholesky factorization
- Solution of sparse positive definite systems on a shared-memory multiprocessor
- Optimal parallel randomized algorithms for sparse addition and identification
- Solution of sparse positive definite systems on a hypercube
- An implementation of a parallel primal-dual interior point method for block- structured linear programs
- A parallel interior point algorithm for linear programming on a network of transputers
- An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations
- A parallel multifrontal algorithm and its implementation
- A quality and distance guided hybrid algorithm for the vertex separator problem
- Parallel implementation of finite-element/Newton method for solution of steady-state and transient nonlinear partial differential equations
- Sparse Cholesky factorization on FPGA using parameterized model
- Tests with FALKSOL. A massively parallel multi-level domain decomposing direct solver
- The vertex separator problem: a polyhedral investigation
- Improving parallel ordering of sparse matrices using genetic algorithms
- Parallelized integrated nested Laplace approximations for fast Bayesian inference
- A parallel computational method in steady power-law creep
- Multifrontal computations on GPUs and their multi-core hosts
- scientific article; zbMATH DE number 991427 (Why is no real title available?)
- Parallel Sparse LU Decomposition on a Mesh Network of Transputers
- Alya: computational solid mechanics for supercomputers
- scientific article; zbMATH DE number 4076453 (Why is no real title available?)
- A fast algorithm for sparse matrix computations related to inversion
- Highly Parallel Sparse Cholesky Factorization
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
- A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION
- scientific article; zbMATH DE number 1121981 (Why is no real title available?)
- Data-Parallel Sparse Factorization
- Reordering for parallelism
- scientific article; zbMATH DE number 1163095 (Why is no real title available?)
- FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture
- scientific article; zbMATH DE number 4113848 (Why is no real title available?)
- Distributed Sparse Gaussian Elimination and Orthogonal Factorization
- On evaluating elimination tree based parallel sparse cholesky factorizations
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
- Parallel frontal solvers for large sparse linear systems
- A survey of direct methods for sparse linear systems
- scientific article; zbMATH DE number 4184919 (Why is no real title available?)
- A new lower bound on the size of the smallest vertex separator of a graph
- Minimizing elimination tree height can increase fill more than linearly
- Parallel symbolic factorization of sparse linear systems
- Sparse QR factorization on a massively parallel computer
This page was built for publication: Parallel Algorithms for Sparse Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3981404)
