A superfast solver for real symmetric Toeplitz systems using real trigonometric transformations

DOI10.1002/nla.445zbMath1164.65334OpenAlexW2156854462MaRDI QIDQ3599995

Gianni Codevico, Georg Heinig, Marc Van Barel

Publication date: 9 February 2009

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.445

zbMATH Keywords

computational complexitycomparison of methodsnumerical experimentsfast Fourier transformsdirect methodsymmetric Toeplitz matrixChebyshev polynomialtangential interpolationsuperfast algorithmChebyshev-Hankel matrixcosine and sine transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (6)

A fast solver for linear systems with displacement structure ⋮ Wiener-Hopf and spectral factorization of real polynomials by Newton's method ⋮ Numerical algorithms for corner-modified symmetric Toeplitz linear system with applications to image encryption and decryption ⋮ Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications ⋮ Multigrid methods for Toeplitz linear systems with different size reduction ⋮ Recovery of harmonic functions from partial boundary data respecting internal pointwise values

Cites Work

• Unnamed Item

This page was built for publication: A superfast solver for real symmetric Toeplitz systems using real trigonometric transformations