Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication

DOI10.1016/S0024-3795(97)10024-6zbMath0935.65040WikidataQ127740501 ScholiaQ127740501MaRDI QIDQ1307205

Karla Rost, Georg Heinig

Publication date: 9 May 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

Toeplitz matrixHankel matrixfast algorithmdiscrete cosine transformdiscrete sine transformfast matrix-vector multiplicationdiscrete Hankel transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (14)

Fast scattered data approximation with Neumann and other boundary conditions ⋮ How to prove that a preconditioner cannot be superlinear ⋮ AQTTTS-based iteration methods for weakly nonlinear systems with diagonal-plus-Toeplitz structure ⋮ DFT representations of Toeplitz-plus-Hankel Bézoutians with application to fast matrix-vector multiplication ⋮ Wiener-Hopf and spectral factorization of real polynomials by Newton's method ⋮ Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications ⋮ Quasi-Toeplitz trigonometric transform splitting methods for spatial fractional diffusion equations ⋮ Trigonometric transform splitting methods for real symmetric Toeplitz systems ⋮ A generalization of trigonometric transform splitting methods for spatial fractional diffusion equations ⋮ Matrix Algebras and Displacement Decompositions ⋮ Fast wavelet transform for Toeplitz matrices and property analysis ⋮ Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems ⋮ The eigen-structures of real (skew) circulant matrices with some applications ⋮ More on Electrostatic Models for Zeros of Orthagonal Polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple FFT and DCT algorithms with reduced number of operations.
• Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
• A decomposition of Toeplitz matrices and optimal circulant preconditioning
• Displacement structure approach to discrete-trigonometric-transform based preconditioners of G. Strang type and of T. Chan type
• Fast radix-\(p\) discrete cosine transform
• Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications
• Complexity of multiplication with vectors for structured matrices
• Fast algorithms with preprocessing for matrix-vector multiplication problems
• Matrix decompositions using displacement rank and classes of commutative matrix algebras
• Algebras of higher dimension for displacement decompositions and computations with Toeplitz plus Hankel matrices
• On the Use of Certain Matrix Algebras Associated with Discrete Trigonometric Transforms in Matrix Displacement Decomposition
• Conjugate Gradient Methods for Toeplitz Systems
• Fast Transform Based Preconditioners for Toeplitz Equations
• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
• On a Matrix Algebra Related to the Discrete Hartley Transform

This page was built for publication: Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication