Matrix structures in parallel matrix computations
From MaRDI portal
Publication:1122309
DOI10.1007/BF02575746zbMath0675.65030OpenAlexW1983822666MaRDI QIDQ1122309
Publication date: 1988
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02575746
algorithmic complexityparallel algorithmsmatrix multiplicationSurveytriangular and banded Toeplitz matrices
Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
New PCG based algorithms for the solution of Hermitian Toeplitz systems, Fast parallel solvers for elliptic problems, Optimal, quasi-optimal and superlinear band-Toeplitz preconditioners for asymptotically ill-conditioned positive definite Toeplitz systems
Cites Work
- Unnamed Item
- Unnamed Item
- Fast parallel and sequential computations and spectral properties concerning band Toeplitz matrices
- How to multiply matrices faster
- On commutativity and approximation
- Spectral and computational properties of band symmetric Toeplitz matrices
- Matrix multiplication via arithmetic progressions
- On the eigenvalue problem for Toeplitz band matrices
- Tensor and border rank of certain classes of matrices and the fast evaluation of determinant, inverse matrix, and eigenvalues
- Polynomial division and its computational complexity
- Complexity of parallel matrix computations
- A logarithmic Boolean time algorithm for parallel polynomial division
- Relations between exact and approximate bilinear algorithms. Applications
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Gaussian elimination is not optimal
- Parallel Solution of Certain Toeplitz Linear Systems
- Very Fast Parallel Polynomial Arithmetic
- Relative bilinear complexity and matrix multiplication.
- Efficient Algorithms for the Evaluation of the Eigenvalues of (Block) Banded Toeplitz Matrices
- Approximate Solutions for the Bilinear Form Computational Problem
- On Certain Parallel Toeplitz Linear System Solvers
- Tensor Rank and Border Rank of Band Toeplitz Matrices
- Fast parallel matrix and GCD computations
- An Adaptation of the Fast Fourier Transform for Parallel Processing
