An algorithm for accelerated computation of DWTPer-based band preconditioners (Q5934374): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:38, 30 January 2024
scientific article; zbMATH DE number 1606687
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for accelerated computation of DWTPer-based band preconditioners |
scientific article; zbMATH DE number 1606687 |
Statements
An algorithm for accelerated computation of DWTPer-based band preconditioners (English)
0 references
19 June 2001
0 references
The discrete wavelet transform with permutations (DWTPer) is a centering version of the discrete wavelet transform that maps a band matrix into another band matrix. If a given matrix \(A\) is transformed to \(B= WAW^T\), then a preconditioner \(M\) is formed by setting to zero all elements of \(B\) lying outside a certain diagonal band. The authors present a new algorithm for computing DWTPer-based band preconditioner at a reduced cost.
0 references
algorithm
0 references
Newton-Krylov
0 references
dense matrices
0 references
GMRES
0 references
wavelet-based preconditioner
0 references
discrete wavelet transform with permutations
0 references
band preconditioner
0 references
