Matrix structures in parallel matrix computations
From MaRDI portal
Survey of algorithmic complexity for parallel algorithms for triangular and banded Toeplitz matrices (constant value along a diagonal) and matrix multiplication. Communication is neglected and thus the author writes: ``Although this model is unrealistic, it allows us to analyse algorithms independently of a specific architecture.
Recommendations
- Parallelism in matrix computations
- scientific article; zbMATH DE number 47823
- scientific article; zbMATH DE number 193901
- Parallel algorithms for certain matrix computations
- Part III Matrix decomposition methods for parallel computers
- Parallel algorithms and architectures for matrix multiplication
- Matrix-vector multiplication: Parallel algorithms and architectures
- scientific article; zbMATH DE number 4070168
- Complexity of parallel matrix computations
- scientific article; zbMATH DE number 4201470
Cites work
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- A logarithmic Boolean time algorithm for parallel polynomial division
- An Adaptation of the Fast Fourier Transform for Parallel Processing
- Approximate Solutions for the Bilinear Form Computational Problem
- Complexity of parallel matrix computations
- Efficient Algorithms for the Evaluation of the Eigenvalues of (Block) Banded Toeplitz Matrices
- Fast parallel and sequential computations and spectral properties concerning band Toeplitz matrices
- Fast parallel matrix and GCD computations
- Gaussian elimination is not optimal
- How to multiply matrices faster
- scientific article; zbMATH DE number 3999284 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- Matrix multiplication via arithmetic progressions
- On Certain Parallel Toeplitz Linear System Solvers
- On commutativity and approximation
- On the eigenvalue problem for Toeplitz band matrices
- Parallel Solution of Certain Toeplitz Linear Systems
- Polynomial division and its computational complexity
- Relations between exact and approximate bilinear algorithms. Applications
- Relative bilinear complexity and matrix multiplication.
- Spectral and computational properties of band symmetric Toeplitz matrices
- Tensor and border rank of certain classes of matrices and the fast evaluation of determinant, inverse matrix, and eigenvalues
- Tensor Rank and Border Rank of Band Toeplitz Matrices
- Very Fast Parallel Polynomial Arithmetic
Cited in
(7)- New PCG based algorithms for the solution of Hermitian Toeplitz systems
- Fast parallel solvers for elliptic problems
- The matrix as in-situ data structure
- Parallel computation of a Krylov matrix for a sparse and structured input
- Programming matrix algorithms-by-blocks for thread-level parallelism
- Optimal, quasi-optimal and superlinear band-Toeplitz preconditioners for asymptotically ill-conditioned positive definite Toeplitz systems
- scientific article; zbMATH DE number 3921826 (Why is no real title available?)
This page was built for publication: Matrix structures in parallel matrix computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122309)
