2011
DOI: 10.1088/1742-6596/290/1/012015
|View full text |Cite
|
Sign up to set email alerts
|

Bi-quadratic polynomial approach for global convergent algorithm in high dimensions coefficient inverse problems

Abstract: Bi-quadratic polynomial approach for global convergent algorithm in high dimensions coefficient inverse problems Quan-Fang WangMechanical and Automation Engineering, Chinese University of Hong Kong, Shatin, N.T., Hong Kong E-mail: quanfangwang@hotmail.com Abstract. Sequential minimization algorithm in convexification approach established a stable approximate solution via minimizing a finite sequence of strictly convex objective function. Its application to 1D/2D dimension cases is reported in a great deal lite… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(6 citation statements)
references
References 8 publications
0
6
0
Order By: Relevance
“…Next, we intend to deduce equivalent equation without the unknown coefficient k(x) from the nonlinear parabolic equation (2.1). Cite [3] for two dimension case, and refer Lemma 2 of [11] for 1D case. Actually, whether the source function S 0 (x, t) exist or not, it is convenient to neglect this term in following deduces.…”
Section: Preliminariesmentioning
confidence: 99%
See 4 more Smart Citations
“…Next, we intend to deduce equivalent equation without the unknown coefficient k(x) from the nonlinear parabolic equation (2.1). Cite [3] for two dimension case, and refer Lemma 2 of [11] for 1D case. Actually, whether the source function S 0 (x, t) exist or not, it is convenient to neglect this term in following deduces.…”
Section: Preliminariesmentioning
confidence: 99%
“…With the results in [3] on two dimension parabolic coefficient inverse problems for space variables (x 2 , x 3 ) and time variable s, suppose…”
Section: Triply Cubic Polynomials Approachmentioning
confidence: 99%
See 3 more Smart Citations