Abstract
We study two termination criteria which are used in computational practice. They are analyzed for linear problems in the average case setting. It is assumed that arbitrary continuous linear functionals can be computed and consecutive approximations are chosen in the best possible way. The first termination criterion is satisfied if the difference between two consecutive approximations becomes less than a certain bound τ. We prove that the first termination criterion gives satisfactory results only for some cases. The second termination criterion is satisfied if two consecutive differences between consecutive approximations become less than τ. We prove that the second termination criterion gives satisfactory results for all cases.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.