Displacement structure approach to discrete-trigonometric-transform based preconditioners of G. Strang type and of T. Chan type

DOI10.1007/BF02576000zbMath0907.65034MaRDI QIDQ1127947

Vadim Olshevsky, Thomas Kailath

Publication date: 4 March 1999

Published in: Calcolo (Search for Journal in Brave)

zbMATH Keywords

complexityconvergenceconjugate gradient methoditerative methodspreconditionersdisplacement structuredirect methodsclustering propertydiscrete cosine or sine transformslarge Toeplitz linear equations

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20)

Related Items

On a set of matrix algebras related to discrete Hartley-type transforms, Hartley-type algebras in displacement and optimization strategies., Sine transform based preconditioners for solving constant-coefficient first-order PDEs, Preconditioning regularized least squares problems arising from high-resolution image reconstruction from low-resolution frames, Fast direct solution methods for symmetric banded Toeplitz systems, based on the sine transform, Structured matrices and Newton's iteration: unified approach, Matrix algebra preconditioners for multilevel Toeplitz matrices are not superlinear, How to prove that a preconditioner cannot be superlinear, Multivariate Frobenius-Padé approximants: properties and algorithms, Korovkin theorems and linear positive Gram matrix algebra approximations of Toeplitz matrices, Displacement structure approach to discrete-trigonometric-transform based preconditioners of G. Strang type and of T. Chan type, An approximate inverse preconditioner for Toeplitz systems with multiple right-hand sides, Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms, A fast parallel Björck-Pereyra-type algorithm for solving Cauchy linear equations, Computing preconditioners via subspace projection, Superoptimal approximation for unbounded symbols, Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms, Signal flow graph approach to efficient and forward stable DST algorithms, Matrix algebras in optimal preconditioning, Approximate real polynomial division via approximate inversion of real triangular Toeplitz matrices, Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems, A framework for polynomial preconditioners based on fast transforms. I: Theory, Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication, Korovkin tests, approximation, and ergodic theory

Cites Work

• Unnamed Item
• Unnamed Item
• The circulant operator in the Banach algebra of matrices
• Spectral and computational properties of band symmetric Toeplitz matrices
• Displacement structure approach to discrete-trigonometric-transform based preconditioners of G. Strang type and of T. Chan type
• Displacement ranks of matrices and linear equations
• Complexity of multiplication with vectors for structured matrices
• Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems
• Displacement structure approach to Chebyshev-Vandermonde and related matrices
• On Computations with Dense Structured Matrices
• A Proposal for Toeplitz Matrix Calculations
• An Optimal Circulant Preconditioner for Toeplitz Systems
• Toeplitz Equations by Conjugate Gradients with Circulant Preconditioner
• Circulant Preconditioners for Toeplitz Matrices with Positive continuous Generating Functions
• Optimal and Superoptimal Circulant Preconditioners
• Circulant Preconditioners for Hermitian Toeplitz Systems
• Fast Transform Based Preconditioners for Toeplitz Equations
• Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure