Applied Mathematics

Volume 1, Issue 5 (November 2010)

ISSN Print: 2152-7385   ISSN Online: 2152-7393

Google-based Impact Factor: 0.58  Citations  

An Improved Wavelet Based Preconditioner for Sparse Linear Problems

HTML  Download Download as PDF (Size: 388KB)  PP. 370-376  
DOI: 10.4236/am.2010.15049    3,942 Downloads   7,945 Views  Citations

Affiliation(s)

.

ABSTRACT

In this paper, we present the construction of purely algebraic Daubechies wavelet based preconditioners for Krylov subspace iterative methods to solve linear sparse system of equations. Effective preconditioners are designed with DWTPerMod algorithm by knowing size of the matrix and the order of Daubechies wavelet. A notable feature of this algorithm is that it enables wavelet level to be chosen automatically making it more robust than other wavelet based preconditioners and avoids user choosing a level of transform. We demonstrate the efficiency of these preconditioners by applying them to several matrices from Tim Davis collection of sparse matrices for restarted GMRES.

Share and Cite:

A. Reddy and N. Bujurke, "An Improved Wavelet Based Preconditioner for Sparse Linear Problems," Applied Mathematics, Vol. 1 No. 5, 2010, pp. 370-376. doi: 10.4236/am.2010.15049.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.