Complexity of multiplication with vectors for structured matrices

DOI10.1016/0024-3795(94)90189-9MaRDI QIDQ1329930zbMATH OpenOpenAlexFDO

Authors I. Gohberg, V. Olshevsky

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

zbMATH Keywords

complexityfactor circulantsproducts of matrices by vectorsstructured matrices

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Cites work

• A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors
• Algebraic Computations of Scaled Padé Fractions
• Circulants, displacements and decompositions of matrices
• Convolution equations on finite intervals and factorization of matrix functions
• Displacement ranks of matrices and linear equations
• Divide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement Structure
• Fast algorithms with preprocessing for matrix-vector multiplication problems
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• Generalized inverses of certain Toeplitz matrices
• scientific article; zbMATH DE number 3889718 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• scientific article; zbMATH DE number 3451988 (Why is no real title available?)
• scientific article; zbMATH DE number 2201223 (Why is no real title available?)
• scientific article; zbMATH DE number 4186996 (Why is no real title available?)
• The Inverses of Block Hankel and Block Toeplitz Matrices

Cited in

(35)

• New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration
• Complexities of special matrix multiplication problems
• 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
• 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
• Pivoting and backward stability of fast algorithms for solving Cauchy linear equations
• Structured matrices and Newton's iteration: unified approach
• Newton's iteration for inversion of Cauchy-like and other structured matrices
• Displacement-structure approach to polynomial Vandermonde and related matrices
• The fast generalized Parker-Traub algorithm for inversion of Vandermonde and related matrices
• An efficient solution for Cauchy-like systems of linear equations
• Displacement structure approach to Chebyshev-Vandermonde and related matrices
• Inversion of mosaic Hankel matrices via matrix polynomial systems
• A fast, preconditioned conjugate gradient Toeplitz and Toeplitz-like solvers
• Algebras of higher dimension for displacement decompositions and computations with Toeplitz plus Hankel matrices
• Superfast algorithms for Cauchy-like matrix computations and extensions
• On perfect hashing of numbers with sparse digit representation via multiplication by a constant
• Multi-dimensional Capon spectral estimation using discrete Zhang neural networks
• Relative bilinear complexity and matrix multiplication.
• Solving linear systems of equations with randomization, augmentation and aggregation
• Exploiting Efficient Representations in Large-Scale Tensor Decompositions
• Transformations of matrix structures work again
• On matrices with displacement structure: generalized operators and faster algorithms
• Iterative inversion of structured matrices
• scientific article; zbMATH DE number 7711611 (Why is no real title available?)
• On the computation of modular forms on noncongruence subgroups
• Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
• Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
• A low-complexity algorithm to digitally uncouple the mutual coupling effect in antenna arrays via symmetric Toeplitz matrices
• A low-complexity algorithm to search for Legendre pairs
• On the complexities of multipoint evaluation and interpolation
• On the fast solution of Toeplitz-block linear systems arising in multivariate approximation theory
• Fast recovery and approximation of hidden Cauchy structure
• Solving structured linear systems with large displacement rank

This page was built for publication: Complexity of multiplication with vectors for structured matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329930)