Preconditioned Iterative Methods for Weighted Toeplitz Least Squares Problems

Authors:
Michele Benzi;Michael K. Ng
Affiliations:
-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
2005

Citing 0
Cited 8

Fast robust regression algorithms for problems with Toeplitz structure

Computational Statistics & Data Analysis
Letter to the Editor: A condition for the nonsymmetric saddle point matrix being diagonalizable and having real and positive eigenvalues

Journal of Computational and Applied Mathematics
The spectral properties of the Hermitian and skew-Hermitian splitting preconditioner for generalized saddle point problems

Journal of Computational and Applied Mathematics
Non-negatively constrained image deblurring with an inexact interior point method

Journal of Computational and Applied Mathematics
The spectral properties of the preconditioned matrix for nonsymmetric saddle point problems

Journal of Computational and Applied Mathematics
Approximate Inverse Circulant-plus-Diagonal Preconditioners for Toeplitz-plus-Diagonal Matrices

SIAM Journal on Scientific Computing
Eigenvalue Estimates for Preconditioned Nonsymmetric Saddle Point Matrices

SIAM Journal on Matrix Analysis and Applications
A practical formula for computing optimal parameters in the HSS iteration methods

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the iterative solution of weighted Toeplitz least squares problems. Our approach is based on an augmented system formulation. We focus our attention on two types of preconditioners: a variant of constraint preconditioning, and the Hermitian/skew-Hermitian splitting (HSS) preconditioner. Bounds on the eigenvalues of the preconditioned matrices are given in terms of problem and algorithmic parameters, and numerical experiments are used to illustrate the performance of the preconditioners.