Abstract
In this chapter, we describe our computational implementation of the approximately globally convergent numerical method of Chap. 2. We use the algorithm of Sect. 2.6.1. Theorems 2.8.2 and 2.9.4 ensure the approximate global convergence of this algorithm within either of above two approximate mathematical models. Thus, we verify in this chapter the second condition of the informal Definition 1.1.2.2 of the approximate global convergence property.
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
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Beilina, L., Klibanov, M.V. (2012). Numerical Implementation of the Approximately Globally Convergent Method. In: Approximate Global Convergence and Adaptivity for Coefficient Inverse Problems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-7805-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7805-9_3
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-7804-2
Online ISBN: 978-1-4419-7805-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)