Complexity of multiplication with vectors for structured matrices
From MaRDI portal
Publication:1329930
DOI10.1016/0024-3795(94)90189-9zbMath0803.65053OpenAlexW2084070281MaRDI QIDQ1329930
Vadim Olshevsky, Israel Gohberg
Publication date: 15 August 1994
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(94)90189-9
Related Items
Displacement structure approach to Chebyshev-Vandermonde and related matrices, Inversion of mosaic Hankel matrices via matrix polynomial systems, Pivoting and backward stability of fast algorithms for solving Cauchy linear equations, Structured matrices and Newton's iteration: unified approach, A fast, preconditioned conjugate gradient Toeplitz and Toeplitz-like solvers, Algebras of higher dimension for displacement decompositions and computations with Toeplitz plus Hankel matrices, On the fast solution of Toeplitz-block linear systems arising in multivariate approximation theory, Newton's iteration for inversion of Cauchy-like and other structured matrices, Displacement-structure approach to polynomial Vandermonde and related matrices, Multi-dimensional Capon spectral estimation using discrete Zhang neural networks, The fast generalized Parker-Traub algorithm for inversion of Vandermonde and related matrices, Iterative inversion of structured matrices, Classical foundations of algorithms for solving positive definite Toeplitz equations, Displacement structure approach to discrete-trigonometric-transform based preconditioners of G. Strang type and of T. Chan type, On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms, On the computation of modular forms on noncongruence subgroups, Fast recovery and approximation of hidden Cauchy structure, Solving linear systems of equations with randomization, augmentation and aggregation, Transformations of matrix structures work again, Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization, Exploiting Efficient Representations in Large-Scale Tensor Decompositions, Superfast algorithms for Cauchy-like matrix computations and extensions, Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems, Solving structured linear systems with large displacement rank, An efficient solution for Cauchy-like systems of linear equations, On the complexities of multipoint evaluation and interpolation, On perfect hashing of numbers with sparse digit representation via multiplication by a constant, New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration, Improved parallel computations with Toeplitz-like and Hankel-like matrices, Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Displacement ranks of matrices and linear equations
- Fast algorithms with preprocessing for matrix-vector multiplication problems
- Circulants, displacements and decompositions of matrices
- Convolution equations on finite intervals and factorization of matrix functions
- Generalized inverses of certain Toeplitz matrices
- The Inverses of Block Hankel and Block Toeplitz Matrices
- Algebraic Computations of Scaled Padé Fractions
- A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Divide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement Structure
