486
Views
6
CrossRef citations to date
0
Altmetric
Original Articles

A finite element model for the data completion problem: analysis and assessment

, , &
Pages 1063-1086 | Received 24 Jul 2010, Accepted 06 Apr 2011, Published online: 27 Jun 2011

Figures & data

Figure 1. An example of the geometry. ΓI is unreachable.

Figure 1. An example of the geometry. ΓI is unreachable.

Figure 2. The domain Ω. The convergence history of (PCGM) and (CGM) for both experiences.

Figure 2. The domain Ω. The convergence history of (PCGM) and (CGM) for both experiences.

Figure 3. The Lavrentiev finite element solutions with a noise of 10%, uD are to the left and uN to right. The Lavrentiev parameters are selected so as to obtain optimal computations. Upper curves are when ΓC is the T boundary and lower ones are for the circular boundary playing the role ΓC. Note that the noise on the Neumann boundary the data has an insignificant effect on uN, it looks more regular than uD which suffers from the contamination with the Dirichlet data.

Figure 3. The Lavrentiev finite element solutions with a noise of 10%, uD are to the left and uN to right. The Lavrentiev parameters are selected so as to obtain optimal computations. Upper curves are when ΓC is the T boundary and lower ones are for the circular boundary playing the role ΓC. Note that the noise on the Neumann boundary the data has an insignificant effect on uN, it looks more regular than uD which suffers from the contamination with the Dirichlet data.

Table 1. The relative error between the computed solution uN and the exact solution u on the whole domain. The regularization method is either the Lavrentiev or the PCG(NR) method. The parameters ϱ* and k* in parenthesis are chosen by means of the discrepancy principle.

Figure 4. The mesh used (upper panel). The gap between the computed uD and u (to the left) and between uN and u (to the right).

Figure 4. The mesh used (upper panel). The gap between the computed uD and u (to the left) and between uN and u (to the right).

Table 2. The relative error between the computed and the exact solutions. The regularization method is either the Lavrentiev or the PCG(NR) method.

Figure 5. The distance to the exact solution of the Lavrentiev finite element solutions. (a) uD and (b) uN. The error is maximum at the vicinity of ΓN. Even though uN appears les perturbed than uD, the maximum of the error is similar for both solutions.

Figure 5. The distance to the exact solution of the Lavrentiev finite element solutions. (a) uD and (b) uN. The error is maximum at the vicinity of ΓN. Even though uN appears les perturbed than uD, the maximum of the error is similar for both solutions.

Figure 6. Profiles of the exact and computed Lavrentiev solutions along the lower edge, near the singularity (a). The exact solution u (b) and the computed solutions uD and uN on the whole domain (c, d).

Figure 6. Profiles of the exact and computed Lavrentiev solutions along the lower edge, near the singularity (a). The exact solution u (b) and the computed solutions uD and uN on the whole domain (c, d).

Figure 7. Profiles of the exact and computed Lavrentiev solutions along the lower edge. As expected, the maximum of the error is localized near x = 0.5.

Figure 7. Profiles of the exact and computed Lavrentiev solutions along the lower edge. As expected, the maximum of the error is localized near x = 0.5.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.