Matrix algebra preconditioners for multilevel Toeplitz systems do not insure optimal convergence rate (Q598222): Difference between revisions
From MaRDI portal
Latest revision as of 18:11, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Matrix algebra preconditioners for multilevel Toeplitz systems do not insure optimal convergence rate |
scientific article |
Statements
Matrix algebra preconditioners for multilevel Toeplitz systems do not insure optimal convergence rate (English)
0 references
6 August 2004
0 references
In the past two decades many papers from the literature deal with the solution of multilevel Toeplitz systems because of several applications: signal prosessing, image restoration, partial differential equations, time series. Futhermore, multilevel Toeplitz matrices are interesting from the viewpoint of complexity theory. A good idea for solving such linear systems is by using iterative solvers in which the involved matrices preserve a Toeplitz structure (for example gradient methods, Chebyshev iterations, Jacobi or Richardson methods). In this paper the authors show that the multilevel Toeplitz case is dramatically different from the scalar Toeplitz case in terms of preconditioning using fast transform algebras, that is, in multilevel case it is impossible to find superlinear and/or spectrally equivalent matrix algebra preconditioners. The optimality is proved in the case of multilevel band Toeplitz preconditioning.
0 references
preconditioning
0 references
multigrid
0 references
Toeplitz matrices
0 references
matrix algebra
0 references
spectral equivalence
0 references
Toeplitz systems
0 references
signal prosessing
0 references
image restoration
0 references
time series
0 references
gradient methods
0 references
Chebyshev iterations
0 references
finite difference
0 references
0 references
0 references
0 references
0 references