BTTB preconditioners for BTTB least squares problems (Q2431148)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5877055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | BTTB preconditioners for BTTB least squares problems |
scientific article; zbMATH DE number 5877055 |
Statements
BTTB preconditioners for BTTB least squares problems (English)
0 references
11 April 2011
0 references
The authors analyze the least squares problem \(\min_{x}\|\mathbf{b}-T\mathbf{x}\|_{2}\) using preconditioned conjugate gradient (PCG) methods, where \(T\) is a large rectangular matrix which consists of several square block-Toeplitz-Toeplitz-block (BTTB) matrices and \(\mathbf{b}\) is a column vector. They propose a BTTB preconditioner to speed up the PCG method and prove that the BTTB preconditioner is a good preconditioner. Numerical results are also discussed.
0 references
least squares problem
0 references
preconditioning
0 references
preconditioned conjugate gradient methods
0 references
block-Toeplitz-Toeplitz-block matrices
0 references
numerical results
0 references
0 references
0 references
0 references
0 references
0.8885155320167542
0 references
0.8709311485290527
0 references
0.8470844030380249
0 references
0.8263934850692749
0 references
0.8263934850692749
0 references