Parallel computations in linear algebra. II
From MaRDI portal
Publication:3339170
DOI10.1007/BF01069754zbMath0547.65020OpenAlexW4242362062MaRDI QIDQ3339170
Publication date: 1982
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01069754
eigenvaluessparse matricesresearch surveytridiagonal matricesparallel computationstriangular matricesJacobiGauss-Seidelband triangular matrices
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Theory of operating systems (68N25) Numerical linear algebra (65Fxx)
Related Items (4)
Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field ⋮ Design of parallel optimization methods ⋮ Deterministic organization of index-based numerical parallel processing ⋮ Upper bounds on the complexity of solving systems of linear equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The parallel calculation of the eigenvalues of a real matrix A
- Approximating the inverse of a matrix for use in iterative algorithms on vector processors
- Parallel solution of linear systems by quadrant interlocking factorisation methods
- Matrix multiplication by diagonals on a vector/parallel processor
- Parallel Poisson and biharmonic solvers
- Parallel direct linear system solvers - a survey
- An improved parallel processor bound in fast matrix inversion
- A fast algorithm for solving the first biharmonic boundary value problem
- On Block-Parallel Methods for Solving Linear Equations
- A Computation Model of Parallel Solution of Linear Equations
- A modification of the quadrant interlocking factorisation parallel method
- A parallel linear system solver
- Computing the Singular-Value Decomposition on the ILLIAC IV
- The parallel solution of banded linear equations by the new quadrant interlocking factorisation (q.i.f.) method
- The Solution of Certain Banded Systems of Linear Equations Using the Folding Algorithm
- A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
- The Complexity of Parallel Evaluation of Linear Recurrences
- Iterative Solution of Linear Equations on a Parallel Processor System
- On Stable Parallel Linear System Solvers
- An efficient heuristic cluster algorithm for tearing large-scale networks
- Asynchronous Iterative Methods for Multiprocessors
- Solving Triangular Systems on a Parallel Computer
- Practical Parallel Band Triangular System Solvers
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- On the time required for a sequence of matrix products
This page was built for publication: Parallel computations in linear algebra. II