1985
DOI: 10.1137/0323017
|View full text |Cite
|
Sign up to set email alerts
|

Identification of Parameters in Distributed Parameter Systems by Regularization

Abstract: I d e n t i f i c a t i o n of spatially varying parameters in distributed parameter systems from noisy d a t a i s a n ill-posed problem.The concept of r e g u l a r i z a t i o n , widely used in solving linear Fredholm integral equat i o n s , i s developed f o r t h e i d e n t i f i c a t i o n of parameters in distributed parameter systems.A general regularizat i o n i d e n t i f i c a t i o n t h e o r y i s f i r s t p r e s e n t e d and then applied to a parabolic identification problem. Methods f o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
101
0
1

Year Published

1986
1986
2014
2014

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 239 publications
(102 citation statements)
references
References 17 publications
0
101
0
1
Order By: Relevance
“…Thus minimizing sequences for J0 are bounded in QR and hence compact in Q; this is, in some sense, roughly equivalent to minimizing J over a restriction of Q which is compact even though the minimization of J, only produces (hopefully) an approximation to the minimizer for the original 131 criterion J. In the cases considered below, we use QR = H while Q= C (which corresponds to A=C and R =H 2 in the notation of [5]). …”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Thus minimizing sequences for J0 are bounded in QR and hence compact in Q; this is, in some sense, roughly equivalent to minimizing J over a restriction of Q which is compact even though the minimization of J, only produces (hopefully) an approximation to the minimizer for the original 131 criterion J. In the cases considered below, we use QR = H while Q= C (which corresponds to A=C and R =H 2 in the notation of [5]). …”
mentioning
confidence: 99%
“…An alternative but essentially theoretically equivalent approach involves the use of Tikhonov regularization as formulated by Kravaris and Seinfeld in [5]. One restricts the parameter set to QR a Q with QR compactly imbedded in Q and then modifies the original least squares criterion J 2 to minimize J =J + 3 q R where R is the norm in QR and 0 is a regularization parameter.…”
mentioning
confidence: 99%
“…Therefore, we conclude that the gradient can be obtained as (16). Recall the estimates (4) and (15) of the primal and the adjoint states, respectively.…”
Section: Proof We Introduce the Notationmentioning
confidence: 63%
“…The adjoint-based method for PDE-constrained optimization problems requires more careful analysis than ODE-constrained optimization problems because the solution of the PDEs does not always have enough differentiability and regularity to guarantee the existence of a well-defined gradient. Furthermore, the differentiability and regularity of the solution highly depend on the type of the PDE: therefore, the method has been customized to several types of PDEs and used in relevant applications [1,16,14,3,13,30].…”
Section: Introductionmentioning
confidence: 99%
“…The stability and convergence results obtained here are based on [7], [14], [25] and [9]. We choose D(G …”
Section: Resultsmentioning
confidence: 99%