Storage algorithm for wavelet Galerkin method
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 not only saves the storage, but also saves 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 reduces nearly half of the number of multiplications.