Fast iterative methods for solving Toeplitz-plus-Hankel least squares problems
zbMATH Open0852.65040MaRDI QIDQ1920164FDOQ1920164
Authors: Michael Ng
Publication date: 4 December 1996
Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/118946
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Fast algorithm for solving the Hankel/Toeplitz structured total least squares problem
- Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems
- scientific article; zbMATH DE number 2151323
- A superfast method for solving Toeplitz linear least squares problems.
- Publication:3477881
- Fast Iterative Solvers for Toeplitz-Plus-Band Systems
- Preconditioned Iterative Methods for Solving Toeplitz-Plus-Hankel Systems
- New Fast Algorithms for Toeplitz-Plus-Hankel Matrices
- scientific article
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
numerical resultscirculant matrixfast Fourier transformpreconditioned conjugate gradient methodToeplitz-plus-Hankel matrixleast squares estimationslinear-phase filter,
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Cited In (4)
This page was built for publication: Fast iterative methods for solving Toeplitz-plus-Hankel least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920164)