| Status | 已發表Published |
| Storage algorithm for wavelet Galerkin method | |
| Feng X.C.2; Zhang X.S.2; Tang X.M.2; Tang Y.Y.1 | |
| 2003-12-01 | |
| Source Publication | International Conference on Machine Learning and Cybernetics
 |
| Volume | 4 |
| Pages | 2365-2369 |
| Abstract | The 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. |
| Keyword | Storage Symmetric sparse matrix Wavelet bases |
| URL | View the original |
| Language | 英語English |
| Fulltext Access | |
| Document Type | Conference paper |
| Collection | University of Macau |
| Affiliation | 1.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. |
| APA | Feng X.C.., Zhang X.S.., Tang X.M.., & Tang Y.Y. (2003). Storage algorithm for wavelet Galerkin method. International Conference on Machine Learning and Cybernetics, 4, 2365-2369. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment