An implicit wavelet sparse approximate inverse preconditioner

Stuart C. Hawkins; K. Chen

doi:10.1137/S1064827503423500

An implicit wavelet sparse approximate inverse preconditioner

Stuart C. Hawkins^*, K. Chen

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

64 Downloads (Pure)

Abstract

Wavelet-based sparse approximate inverse preconditioners are considered for the linear system Ax = b. The preconditioners are good sparse approximations to the inverse of A computed by taking advantage of the compression obtained by working in a wavelet basis. When the representation of A in a single scale basis (for example, a finite element basis) is available, the formulation presented obviates computation of the representation of A in the wavelet basis and removes the associated costs. Efficient application for both sparse and dense A is considered.

Original language	English
Pages (from-to)	667-686
Number of pages	20
Journal	SIAM Journal on Scientific Computing
Volume	27
Issue number	2
DOIs	https://doi.org/10.1137/S1064827503423500
Publication status	Published - 2005
Externally published	Yes

Bibliographical note

Copyright SIAM Publications. Article archived for private and non-commercial use with the permission of the author and according to publisher conditions. For further information see http://www.siam.org/.

Keywords

Linear system
Preconditioning
Sparse approximate inverse
Wavelet

Access to Document

10.1137/S1064827503423500

Publisher version (open access).pdfFinal published version, 604 KB

Cite this

@article{7b45cbeb99bf4f1e9a1229d6e374adf5,

title = "An implicit wavelet sparse approximate inverse preconditioner",

abstract = "Wavelet-based sparse approximate inverse preconditioners are considered for the linear system Ax = b. The preconditioners are good sparse approximations to the inverse of A computed by taking advantage of the compression obtained by working in a wavelet basis. When the representation of A in a single scale basis (for example, a finite element basis) is available, the formulation presented obviates computation of the representation of A in the wavelet basis and removes the associated costs. Efficient application for both sparse and dense A is considered.",

keywords = "Linear system, Preconditioning, Sparse approximate inverse, Wavelet",

author = "Hawkins, {Stuart C.} and K. Chen",

note = "Copyright SIAM Publications. Article archived for private and non-commercial use with the permission of the author and according to publisher conditions. For further information see http://www.siam.org/.",

year = "2005",

doi = "10.1137/S1064827503423500",

language = "English",

volume = "27",

pages = "667--686",

journal = "SIAM Journal on Scientific Computing",

issn = "1064-8275",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

T1 - An implicit wavelet sparse approximate inverse preconditioner

AU - Hawkins, Stuart C.

AU - Chen, K.

N1 - Copyright SIAM Publications. Article archived for private and non-commercial use with the permission of the author and according to publisher conditions. For further information see http://www.siam.org/.

PY - 2005

Y1 - 2005

N2 - Wavelet-based sparse approximate inverse preconditioners are considered for the linear system Ax = b. The preconditioners are good sparse approximations to the inverse of A computed by taking advantage of the compression obtained by working in a wavelet basis. When the representation of A in a single scale basis (for example, a finite element basis) is available, the formulation presented obviates computation of the representation of A in the wavelet basis and removes the associated costs. Efficient application for both sparse and dense A is considered.

AB - Wavelet-based sparse approximate inverse preconditioners are considered for the linear system Ax = b. The preconditioners are good sparse approximations to the inverse of A computed by taking advantage of the compression obtained by working in a wavelet basis. When the representation of A in a single scale basis (for example, a finite element basis) is available, the formulation presented obviates computation of the representation of A in the wavelet basis and removes the associated costs. Efficient application for both sparse and dense A is considered.

KW - Linear system

KW - Preconditioning

KW - Sparse approximate inverse

KW - Wavelet

UR - http://www.scopus.com/inward/record.url?scp=33644946626&partnerID=8YFLogxK

U2 - 10.1137/S1064827503423500

DO - 10.1137/S1064827503423500

M3 - Article

AN - SCOPUS:33644946626

SN - 1064-8275

VL - 27

SP - 667

EP - 686

JO - SIAM Journal on Scientific Computing

JF - SIAM Journal on Scientific Computing

IS - 2

ER -

An implicit wavelet sparse approximate inverse preconditioner

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this