Parallel computations in linear algebra. II
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3951882 (Why is no real title available?)
- scientific article; zbMATH DE number 3511872 (Why is no real title available?)
- scientific article; zbMATH DE number 3597853 (Why is no real title available?)
- scientific article; zbMATH DE number 3619237 (Why is no real title available?)
- scientific article; zbMATH DE number 3640787 (Why is no real title available?)
- A Computation Model of Parallel Solution of Linear Equations
- A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- A fast algorithm for solving the first biharmonic boundary value problem
- A modification of the quadrant interlocking factorisation parallel method
- A parallel linear system solver
- An efficient heuristic cluster algorithm for tearing large-scale networks
- An improved parallel processor bound in fast matrix inversion
- Approximating the inverse of a matrix for use in iterative algorithms on vector processors
- Asynchronous Iterative Methods for Multiprocessors
- Computing the Singular-Value Decomposition on the ILLIAC IV
- Iterative Solution of Linear Equations on a Parallel Processor System
- Matrix multiplication by diagonals on a vector/parallel processor
- On Block-Parallel Methods for Solving Linear Equations
- On Stable Parallel Linear System Solvers
- On the time required for a sequence of matrix products
- Parallel Poisson and biharmonic solvers
- Parallel direct linear system solvers - a survey
- Parallel solution of linear systems by quadrant interlocking factorisation methods
- Practical Parallel Band Triangular System Solvers
- Solving Triangular Systems on a Parallel Computer
- The Complexity of Parallel Evaluation of Linear Recurrences
- The Solution of Certain Banded Systems of Linear Equations Using the Folding Algorithm
- The parallel calculation of the eigenvalues of a real matrix A
- The parallel solution of banded linear equations by the new quadrant interlocking factorisation (q.i.f.) method
Cited in
(11)- Upper bounds on the complexity of solving systems of linear equations
- Design of parallel optimization methods
- On the parallel Risch Algorithm (II)
- Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field
- scientific article; zbMATH DE number 3934304 (Why is no real title available?)
- Algorithms of parallel computations for linear algebra problems with irregularly structured matrices
- scientific article; zbMATH DE number 3898097 (Why is no real title available?)
- scientific article; zbMATH DE number 4076454 (Why is no real title available?)
- Deterministic organization of index-based numerical parallel processing
- scientific article; zbMATH DE number 554525 (Why is no real title available?)
- Advantages for solving linear systems in an asynchronous environment
This page was built for publication: Parallel computations in linear algebra. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3339170)
