Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications
From MaRDI portal
Publication:6179934
DOI10.1007/s13160-023-00616-4zbMath1530.65032MaRDI QIDQ6179934
Heejung Byun, Yan-peng Zheng, Xing Zhang, Zhao-lin Jiang
Publication date: 18 January 2024
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Direct numerical methods for linear systems and matrix inversion (65F05) Toeplitz, Cauchy, and related matrices (15B05)
Cites Work
- Unnamed Item
- Unnamed Item
- A fast solver for linear systems with displacement structure
- A new algebra of Toeplitz-plus-Hankel matrices and applications
- The use of the Sherman-Morrison-Woodbury formula to solve cyclic block tri-diagonal and cyclic block penta-diagonal linear systems of equations
- Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication
- Centrosymmetric and centro-skewsymmetric Toeplitz-plus-Hankel matrices and Bézoutians
- Some results on symmetric circulant matrices and on symmetric centrosymmetric matrices
- A note on the structured perturbation analysis for the inversion formula of Toeplitz matrices
- Fast algorithms for finding the solution of CUPL-Toeplitz linear system from Markov chain
- The eigen-structures of real (skew) circulant matrices with some applications
- Deblurring Images
- Fast Algorithms for Signal Processing
- A superfast solver for real symmetric Toeplitz systems using real trigonometric transformations
- Efficient solution of a Toeplitz-plus-Hankel coefficient matrix system of equations
- Inverse Scattering for Discrete Transmission-Line Models
- New analogs of split algorithms for arbitrary Toeplitz-plus-Hankel matrices
- A Schur algorithm and linearly connected processor array for Toeplitz-plus-Hankel matrices
- Two methods for Toeplitz-plus-Hankel approximation to a data covariance matrix
- Preconditioned Iterative Methods for Solving Toeplitz-Plus-Hankel Systems
- The Discrete Cosine Transform
- Fast algorithms for close-to-Toeplitz-plus-Hankel systems and two-sided linear prediction
- Supercharacters and the discrete Fourier, cosine, and sine transforms
- New Fast Algorithms for Toeplitz-Plus-Hankel Matrices
- A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
This page was built for publication: Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications