The identification of discontinuous parameters in elliptic systems is formulated as a constrained minimization problem combining the output least squares and the equation error method. The minimization problem is then proved to be equivalent to the saddle-point problem of an augmented Lagrangian. The finite element method is used to discretize the saddle-point problem, and the convergence of the discretization is also proved. Finally, an Uzawa algorithm is suggested for solving the discrete saddle-point problem and is shown to be globally convergent.
No takes yet. Share an insight, caveat, or question.
Chen et al. (1999) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: