A Computation Model of Parallel Solution of Linear Equations
From MaRDI portal
Cited in
(14)- Upper bounds on the complexity of solving systems of linear equations
- A survey of direct methods for sparse linear systems
- On the direct parallel solution of systems of linear equations: New algorithms and systolic structures
- PCR algorithm for parallel computing the solution of the general restricted linear equations
- LU factorization on parallel computers
- The semantics and complexity of parallel programs for vector computations. I: A case study using Ada
- Parallel computations in linear algebra. II
- PCR algorithm for parallel computing minimum-norm \((T)\) least-squares \((S)\) solution of inconsistent linear equations
- Design and implementation of a parallel Markowitz threshold algorithm
- Iterative methods for solving sparse linear systems with a parallel preconditioner
- Advantages for solving linear systems in an asynchronous environment
- Systolic algorithm for the solution of dense linear equations
- A systolic algorithm for solving dense linear systems
- A new algorithm for parallel solution of linear equations
This page was built for publication: A Computation Model of Parallel Solution of Linear Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3875338)