In this paper, two iterative methods are constructed to solve the operator equation $ Lu=f $ where $ L:H\rightarrow H $ is a bounded, invertible and self-adjoint linear operator on a separable Hilbert space $ H $. By using the concept of frames of subspaces, which is a generalization of frame theory, we design some algorithms based on Galerkin and Richardson methods, and then we investigate the convergence and optimality of them.
Jamali, H., & Kolahdouz, M. (2017). Using Frames of Subspaces in Galerkin and Richardson Methods for Solving Operator Equations. Journal of Mahani Mathematical Research, 4(1), 25-37. doi: 10.22103/jmmrc.2017.1655
MLA
Hassan Jamali; Mohsen Kolahdouz. "Using Frames of Subspaces in Galerkin and Richardson Methods for Solving Operator Equations", Journal of Mahani Mathematical Research, 4, 1, 2017, 25-37. doi: 10.22103/jmmrc.2017.1655
HARVARD
Jamali, H., Kolahdouz, M. (2017). 'Using Frames of Subspaces in Galerkin and Richardson Methods for Solving Operator Equations', Journal of Mahani Mathematical Research, 4(1), pp. 25-37. doi: 10.22103/jmmrc.2017.1655
VANCOUVER
Jamali, H., Kolahdouz, M. Using Frames of Subspaces in Galerkin and Richardson Methods for Solving Operator Equations. Journal of Mahani Mathematical Research, 2017; 4(1): 25-37. doi: 10.22103/jmmrc.2017.1655
)