Storage algorithm for wavelet Galerkin method
Feng X.C.2; Zhang X.S.2; Tang X.M.2; Tang Y.Y.1
Source PublicationInternational Conference on Machine Learning and Cybernetics
AbstractThe representation of an integral operator in wavelet bases is a large numerical sparse matrix. Thus, a suitable approach is needed that converts the matrix from full storage mode into sparse storage mode, which will not only save the storage, but also save the execution time. In this paper, the storage of this kind of matrix is discussed in the symmetric case. First, we present a standard storage approach. Then, a modified one is proposed, which is based on a special decomposition of the symmetric matrix. When iterative solvers are used to solve the corresponding linear system, the main cost is the multiplication of the symmetric sparse matrix and a given vector. The modified sparse storage mode is optimized for this purpose and will reduce nearly half of the number of multiplications.
KeywordStorage Symmetric sparse matrix Wavelet bases
URLView the original
Fulltext Access
Document TypeConference paper
CollectionUniversity of Macau
Affiliation1.Hong Kong Baptist University
2.Xidian University
Recommended Citation
GB/T 7714
Feng X.C.,Zhang X.S.,Tang X.M.,et al. Storage algorithm for wavelet Galerkin method[C],2003:2365-2369.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Feng X.C.]'s Articles
[Zhang X.S.]'s Articles
[Tang X.M.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Feng X.C.]'s Articles
[Zhang X.S.]'s Articles
[Tang X.M.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Feng X.C.]'s Articles
[Zhang X.S.]'s Articles
[Tang X.M.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.