A Survey of Parallel Algorithms in Numerical Linear Algebra
From MaRDI portal
Automated AlgorithmsEigenvaluesEvaluation of Arithmetic ExpressionsFast Fourier TransformLinear Systems of EquationsNumerical Linear AlgebraParallel AlgorithmParallel ComputersPipeline ComputersSurvey
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical linear algebra (65Fxx) Numerical methods for trigonometric approximation and interpolation (65T40) Computer aspects of numerical algorithms (65Y99) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms in computer science (68W99)
Cited in
(62)- Upper bounds on the complexity of solving systems of linear equations
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- Advantages for solving linear systems in an asynchronous environment
- 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 QR decomposition of a rectangular matrix
- Communication complexity of the Gaussian elimination algorithm on multiprocessors
- 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
- 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
- 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
- The SOR method on parallel computers
- Minimal parallelism for associative computations under time constraints
- Parallel algorithms for solving systems of nonlinear equations
- The solution of linear complementarity problems on an array processor
- Efficient parallel algorithms for linear recurrence computation
- The algorithm for computing nonmonic second order multivariable systems
- Numerical calculation and computer design
- Bibliography on the evaluation of numerical software
- Parallel algorithms for certain matrix computations
- A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors
- Domain decomposition methods for nonlinear problems in fluid dynamics
- PCR algorithm for parallel computing minimum-norm (T) least-squares (S) solution of inconsistent linear equations
- A new Gaussian elimination-based algorithm for parallel solution of linear equations
- Time-dependent solution of the Liouville-von Neumann equation: Non-dissipative evolution
- A parallel algorithm for evaluating general linear recurrence equations
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- Fast linear algebra is stable
- Processor efficient parallel matching
- Parallel running of a modular simulation scheme
- A comparison of two parallel algorithms for the symmetric eigenproblem
- Parallel computations in linear algebra. II
- A globally convergent parallel algorithm for zeros of polynomial systems
- Systolic algorithm for the solution of dense linear equations
- A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges
- Résolution systolique de systèmes linéaires denses
- Parallel algorithms for solving linear equations using givens transformations
- 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
- Transputers for solving any system of linear equations
- Quantum machine learning: a classical perspective
- The granularity of parallel homotopy algorithms for polynomial systems of equations
- 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
- Cyclic odd-even reduction for symmetric circulant matrices
- GPU accelerated Newton for Taylor series solutions of polynomial homotopies in multiple double precision
- Hybrid Ikebe-Newton's iteration for inverting general nonsingular Hessenberg matrices
- A low-complexity algorithm to search for Legendre pairs
- Implementing stochastic control software on supercomputing machines
- A parallel-design distributed-implementation (PDDI) general-purpose computer
- A parallel preconditioned block conjugate gradient method for solving large systems of linear equations on a MIMD supercomputer
- Parallel algorithms for matrix polynomial division
- Parallel computations for Yau filters
- Parallelism and fast solution of linear systems
This page was built for publication: A Survey of Parallel Algorithms in Numerical Linear Algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4195935)
