A Survey of Parallel Algorithms in Numerical Linear Algebra

DOI10.1137/1020096zbMath0408.68033OpenAlexW2156281098MaRDI QIDQ4195935

Publication date: 1978

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/64bb9408d6448a0e727285af8cec6908bd684cbb

zbMATH Keywords

Eigenvalues Fast Fourier Transform Survey Parallel Computers Evaluation of Arithmetic Expressions Numerical Linear Algebra Parallel Algorithm Automated Algorithms Linear Systems of Equations Pipeline Computers

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Numerical methods for trigonometric approximation and interpolation (65T40) Numerical linear algebra (65Fxx) Algorithms in computer science (68W99) Computer aspects of numerical algorithms (65Y99)

Related Items (60)

Communication complexity of the Gaussian elimination algorithm on multiprocessors ⋮ Résolution systolique de systèmes linéaires denses ⋮ Analysis of incomplete matrix factorizations as multigrid smoothers for vector and parallel computers ⋮ On the direct parallel solution of systems of linear equations: New algorithms and systolic structures ⋮ A new algorithm for parallel solution of linear equations ⋮ A new Gaussian elimination-based algorithm for parallel solution of linear equations ⋮ Transputers for solving any system of linear equations ⋮ Parallel running of a modular simulation scheme ⋮ Quantum machine learning: a classical perspective ⋮ TWO-SIDED ELIMINATION ALGORITHM FOR PARALLEL SOLUTION OF LINEAR EQUATIONS USING HOUSEHOLDER REDUCTIONS ⋮ A NEW MODIFIED GRAM-SCHMIDT ORTHOGONAL MATRIX FACTORIZATION BASED ALGORITHM FOR PARALLEL SOLUTION OF LINEAR EQUATIONS ⋮ The semantics and complexity of parallel programs for vector computations. I: A case study using Ada ⋮ Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field ⋮ Time-dependent solution of the Liouville-von Neumann equation: Non-dissipative evolution ⋮ Matrix-vector multiplication: Parallel algorithms and architectures ⋮ Matching patterns in strings subject to multi-linear transformations ⋮ Implementation of an ADI method on parallel computers ⋮ The iterated mod problem ⋮ A hierarchical decomposition for large-scale optimal control problems with parallel processing structure ⋮ A globally convergent parallel algorithm for zeros of polynomial systems ⋮ The SOR method on parallel computers ⋮ A parallel algorithm for evaluating general linear recurrence equations ⋮ Parallel algorithms for certain matrix computations ⋮ Systolic algorithm for the solution of dense linear equations ⋮ Minimal parallelism for associative computations under time constraints ⋮ Parallel algorithms for solving linear equations using givens transformations ⋮ Parallel algorithms for solving systems of nonlinear equations ⋮ Parallelism and fast solution of linear systems ⋮ The solution of linear complementarity problems on an array processor ⋮ Efficient parallel algorithms for linear recurrence computation ⋮ A class of gradient unconstrained minimization algorithms with adaptive stepsize ⋮ Parallel solution of dense linear systems using diagonalization methods ⋮ Systolic givens factorization of dense rectangular matrices ⋮ A truncated cyclic reduction algorithm for interval arithmetic tridiagonal systems of equations ⋮ Hybrid Ikebe-Newton's iteration for inverting general nonsingular Hessenberg matrices ⋮ Fast linear algebra is stable ⋮ Processor efficient parallel matching ⋮ The algorithm for computing nonmonic second order multivariable systems ⋮ A comparison of two parallel algorithms for the symmetric eigenproblem ⋮ Parallel computations in linear algebra. II ⋮ Cyclic odd-even reduction for symmetric circulant matrices ⋮ Numerical calculation and computer design ⋮ Bibliography on the evaluation of numerical software ⋮ A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges ⋮ Implementing stochastic control software on supercomputing machines ⋮ A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors ⋮ The granularity of parallel homotopy algorithms for polynomial systems of equations ⋮ Domain decomposition methods for nonlinear problems in fluid dynamics ⋮ Upper bounds on the complexity of solving systems of linear equations ⋮ A parallel-design distributed-implementation (PDDI) general-purpose computer ⋮ A survey of preconditioned iterative methods for linear systems of algebraic equations ⋮ PCR algorithm for parallel computing minimum-norm \((T)\) least-squares \((S)\) solution of inconsistent linear equations ⋮ Advantages for solving linear systems in an asynchronous environment ⋮ A parallel preconditioned block conjugate gradient method for solving large systems of linear equations on a MIMD supercomputer ⋮ Parallel algorithms for matrix polynomial division ⋮ Special purpose computer for nonlinear differential equations ⋮ Parallel implementation of bisection for the calculation of eigenvalues of tridiagonal symmetric matrices ⋮ Complexity of dense-linear-system solution on a multiprocessor ring ⋮ Parallel computations for Yau filters ⋮ Parallel QR decomposition of a rectangular matrix

This page was built for publication: A Survey of Parallel Algorithms in Numerical Linear Algebra