Abstract
In this chapter we discuss the opportunities unveiled by the iterative regularization technique in the traditional applications of computer science. This technique allows to construct theoretically approved iterative algorithms in circumstances when the classical approaches are either inapplicable, or associated with considerable difficulties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Bakushinsky, A., Goncharsky, A. (1994). Applications of the principle of iterative regularization. In: Ill-Posed Problems: Theory and Applications. Mathematics and Its Applications, vol 301. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-1026-6_6
Download citation
DOI: https://doi.org/10.1007/978-94-011-1026-6_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4447-9
Online ISBN: 978-94-011-1026-6
eBook Packages: Springer Book Archive