We introduce multilevel augmentation methods for solving operator equations based on direct sum decompositions of the range space of the operator and the solution space of the operator equation and a matrix splitting ...We introduce multilevel augmentation methods for solving operator equations based on direct sum decompositions of the range space of the operator and the solution space of the operator equation and a matrix splitting scheme. We establish a general setting for the analysis of these methods, showing that the methods yield approximate solutions of the same convergence order as the best approximation from the subspace. These augmentation methods allow us to develop fast, accurate and stable nonconventional numerical algorithms for solving operator equations. In particular, for second kind equations, special splitting techniques are proposed to develop such algorithms. These algorithms are then applied to solve the linear systems resulting from matrix compression schemes using wavelet-like functions for solving Fredholm integral equations of the second kind. For this special case, a complete analysis for computational complexity and convergence order is presented. Numerical examples are included to demonstrate the efficiency and accuracy of the methods. In these examples we use the proposed augmentation method to solve large scale linear systems resulting from the recently developed wavelet Galerkin methods and fast collocation methods applied to integral equations of the secondkind. Our numerical results confirm that this augmentation method is particularly efficient for solving large scale linear systems induced from wavelet compression schemes.展开更多
基金Supported in part by the Natural Science Foundation of China under grants 10371137and 10201034Foundation of Doctoral Program of National Higher Education of China under under grant 20030558008Guangdong Provincial Natural Science Foundation of China u
文摘We introduce multilevel augmentation methods for solving operator equations based on direct sum decompositions of the range space of the operator and the solution space of the operator equation and a matrix splitting scheme. We establish a general setting for the analysis of these methods, showing that the methods yield approximate solutions of the same convergence order as the best approximation from the subspace. These augmentation methods allow us to develop fast, accurate and stable nonconventional numerical algorithms for solving operator equations. In particular, for second kind equations, special splitting techniques are proposed to develop such algorithms. These algorithms are then applied to solve the linear systems resulting from matrix compression schemes using wavelet-like functions for solving Fredholm integral equations of the second kind. For this special case, a complete analysis for computational complexity and convergence order is presented. Numerical examples are included to demonstrate the efficiency and accuracy of the methods. In these examples we use the proposed augmentation method to solve large scale linear systems resulting from the recently developed wavelet Galerkin methods and fast collocation methods applied to integral equations of the secondkind. Our numerical results confirm that this augmentation method is particularly efficient for solving large scale linear systems induced from wavelet compression schemes.
