Abstract
In this paper, by using the concept of frames, two iterative methods are constructed to solve the operator equation $ Lu=f $ where $ L:Hrightarrow H $ is a bounded, invertible and self-adjoint linear operator on a separable Hilbert space $ H $. These schemes are analogous with steepest descent method which is applied on a preconditioned equation obtained by frames instead. We then investigate their convergence via corresponding convergence rates, which are formed by the frame bounds. We also investigate the optimal case, which leads to the exact solution of the equation. The first scheme refers to the case where $H$ is a real separable Hilbert space, but in the second scheme, we drop this assumption.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
