.png){kind=icon}
Return
Wavelet based preconditioners for sparse linear systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2005.01.060.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A class of efficient preconditioners based oil Daubechies family of wavelets for sparse, unsymmetric linear systems that arise in numerical solution of Partial Differential Equations (PDEs) in a wide variety of scientific and engineering disciplines are introduced. Complete and Incomplete Discrete Wavelet Transforms in conjunction with row and column permutations are used in the construction of these preconditioners. With these Wavelet Transform, the transformed matrix is permuted to band forms. The efficiency Of Our preconditioners with several Krylov subspace methods is illustrated by solving matrices from Harwell Boeing collection and Tim Davis collection. Also matrices resulting in the solution of Regularized Burgers Equation, free convection in porous enclosure are tested. Our results indicate that the preconditioner based oil Incomplete Discrete Haar Wavelet Transform is both cheaper to construct and gives good convergence. (c) 2005 Elsevier Inc. All rights reserved.
Keywords:
preconditioning
sparse matrices
wavelet transform
Krylov subspace solvers
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave