A unified framework for constructing globally convergent algorithms for multidimensional coefficient inverse problems

2004 ◽  
Vol 83 (9) ◽  
pp. 933-955 ◽  
Author(s):  
Michael V. Klibanov ◽  
Alexandre Timonov †
2011 ◽  
Vol 90 (10) ◽  
pp. 1573-1594 ◽  
Author(s):  
Natee Pantong ◽  
Aubrey Rhoden ◽  
Shao-Hua Yang ◽  
Sandra Boetcher ◽  
Hanli Liu ◽  
...  

2021 ◽  
Author(s):  
Quan-Fang Wang

In this paper, a triply cubic polynomials approach is proposed firstly for solving the globally convergent algorithm of coefficient inverse problems in three dimension. Using Taylor type expansion for three arguments to construct tripled cubic polynomials for the approximate solution as identifying coefficient function of parabolic initial-boundary problems, in which unknown coefficients appeared at nonlinear term. The presented computational approach is effective to execute in spatial 3D issues arising in real world. Further, the complete algorithm can be straightforwardly performed to lower or higher dimensions case


2021 ◽  
Author(s):  
Quan-Fang Wang

In this paper, a triply cubic polynomials approach is proposed firstly for solving the globally convergent algorithm of coefficient inverse problems in three dimension. Using Taylor type expansion for three arguments to construct tripled cubic polynomials for the approximate solution as identifying coefficient function of parabolic initial-boundary problems, in which unknown coefficients appeared at nonlinear term. The presented computational approach is effective to execute in spatial 3D issues arising in real world. Further, the complete algorithm can be straightforwardly performed to lower or higher dimensions case


Sign in / Sign up

Export Citation Format

Share Document