We investigate the Cauchy problem for elliptic operators with $C^\infty$-coefficients at a regular set $Ω\subset R^2$, which is a classical example of an ill-posed problem. The Cauchy data are given at the subset $Γ\subset \partialΩ$ and our objective is to reconstruct the trace of the $H^1(Ω)$ solution of an elliptic equation at $\partial Ω/ Γ$. The method described here is a generalization of the algorithm developed by Maz'ya et al. [Ma] for the Laplace operator, who proposed a method based on solving successive well-posed mixed boundary value problems (BVP) using the given Cauchy data as part of the boundary data. We give an alternative convergence proof for the algorithm in the case we have a linear elliptic operator with $C^\infty$-coefficients. We also present some numerical experiments for a special non linear problem and the obtained results are very promisive.
Two methods of level set type are proposed for solving the Cauchy problem for an elliptic equation. Convergence and stability results for both methods are proven, characterizing the iterative methods as regularization methods for this ill-posed problem. Some numerical experiments are presented, showing the efficiency of our approaches and verifying the convergence results.
We investigate the Cauchy problem for linear elliptic operators with $C^\infty$-coefficients at a regular set $Ω\subset R^2$, which is a classical example of an ill-posed problem. The Cauchy data are given at the manifold $Γ\subset \partialΩ$ and our goal is to reconstruct the trace of the $H^1(Ω)$ solution of an elliptic equation at $\partial Ω/ Γ$. The method proposed here composes the segmenting Mann iteration with a fixed point equation associated with the elliptic Cauchy problem. Our algorithm generalizes the iterative method developed by Maz'ya et al., who proposed a method based on solv…
A new primal-dual weak Galerkin (PDWG) finite element method is introduced and analyzed for the ill-posed elliptic Cauchy problems with ultra-low regularity assumptions on the exact solution. The Euler-Lagrange formulation resulting from the PDWG scheme yields a system of equations involving both the primal equation and the adjoint (dual) equation. The optimal order error estimate for the primal variable in a low regularity assumption is established. A series of numerical experiments are illustrated to validate effectiveness of the developed theory.
We investigate the Cauchy problem for a class of nonlinear elliptic operators with $C^\infty$-coefficients at a regular set $Ω\subset R^n$. The Cauchy data are given at a manifold $Γ\subset \partialΩ$ and our goal is to reconstruct the trace of the $H^1(Ω)$ solution of a nonlinear elliptic equation at $\partial Ω/ Γ$. We propose two iterative methods based on the segmenting Mann iteration applied to fixed point equations, which are closely related to the original problem. The first approach consists in obtaining a corresponding linear Cauchy problem and analyzing a linear fixed point equation;…
We consider the Cauchy problem for the Helmholtz equation with a domain in R^d, d>2 with N cylindrical outlets to infinity with bounded inclusions in R^{d-1}. Cauchy data are prescribed on the boundary of the bounded domains and the aim is to find solution on the unbounded part of the boundary. In 1989, Kozlov and Maz'ya proposed an alternating iterative method for solving Cauchy problems associated with elliptic,self-adjoint and positive-definite operators in bounded domains. Different variants of this method for solving Cauchy problems associated with Helmholtz-type operators exists. We cons…
In the recent developments of regularization theory for inverse and ill-posed problems, a variational quasi-reversibility (QR) method has been designed to solve a class of time-reversed quasi-linear parabolic problems. Known as a PDE-based approach, this method relies on adding a suitable perturbing operator to the original problem and consequently, on gaining the corresponding fine stabilized operator, which leads us to a forward-like problem. In this work, we establish new conditional estimates for such operators to solve a prototypical Cauchy problem for elliptic equations. This problem is …
A parallelizable iterative procedure based on domain decomposition is presented and analyzed for weak Galerkin finite element methods for second order elliptic equations. The convergence analysis is established for the decomposition of the domain into individual elements associated to the weak Galerkin methods or into larger subdomains. A series of numerical tests are illustrated to verify the theory developed in this paper.
We study the iterative algorithm proposed by S. Armstrong, A. Hannukainen, T. Kuusi, J.-C. Mourrat to solve elliptic equations in divergence form with stochastic stationary coefficients. Such equations display rapidly oscillating coefficients and thus usually require very expensive numerical calculations, while this iterative method is comparatively easy to compute. In this article, we strengthen the estimate for the contraction factor achieved by one iteration of the algorithm. We obtain an estimate that holds uniformly over the initial function in the iteration, and which grows only logarith…
The Cauchy problem of coupled elliptic sine-Gordon equations with noise: Analysis of a general kernel-based regularization and reliable tools of computing
Gran Sasso Science Institute（格兰萨索科学研究所）；Hankyong National University（韩荣国立大学）；Ho Chi Minh City University of Science（胡志明市科技大学）；Ton Duc Thang University（敦德唐大学）
We consider an iterative procedure to solve quasilinear elliptic systems with $p$-growth. The scheme was first considered by Koshelev in the quadratic case $p=2$. We present numerical applications as well as applications to higher regularity properties.
In this paper, a new iterative two-level algorithm is presented for solving the finite element discretization for nonsymmetric or indefinite elliptic problems. The iterative two-level algorithm uses the same coarse space as the traditional two-grid algorithm, but its ``fine space'' uses the higher oder finite element space under the coarse grid. Therefore, the iterative two-level algorithm only needs one grid, and the computational cost is much lower than the traditional iterative two-grid algorithm. Finally, compared with the traditional two-grid algorithm, numerical experiments show that the…
This work focuses on the derivation and the analysis of a novel, strongly-coupled partitioned method for fluid-structure interaction problems. The flow is assumed to be viscous and incompressible, and the structure is modeled using linear elastodynamics equations. We assume that the structure is thick, i.e., modeled using the same number of spatial dimensions as fluid. Our newly developed numerical method is based on generalized Robin boundary conditions, as well as on the refactorization of the Cauchy's one-legged `theta-like' method, written as a sequence of Backward Euler-Forward Euler step…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address different length scales. However, we use here the homogenized equation on all scales larger than a fixed multiple of the scale of oscillation of the coefficients. While the performance of standard multigrid methods degrades rapidly under the regime of large scale separation that we consider here, we show an explicit estimate on the contraction factor of our met…
Diffuse Interface Methods for Inverse Problems: Case Study for an Elliptic Cauchy Problem
Institute for Computational and Applied Mathematics, University of Münster（明斯特大学计算与应用数学研究所）；Cells in Motion Cluster of Excellence, University of Münster（明斯特大学细胞运动卓越集群）；Dept. of Mathematical Sciences and Technology, Norwegian University of Life Sciences（挪威生命科学大学数学科学与技术系）
This article presents a new primal-dual weak Galerkin method for second order elliptic equations in non-divergence form. The new method is devised as a constrained $L^p$-optimization problem with constraints that mimic the second order elliptic equation by using the discrete weak Hessian locally on each element. An equivalent min-max characterization is derived to show the existence and uniqueness of the numerical solution. Optimal order error estimates are established for the numerical solution under the discrete $W^{2,p}$ norm, as well as the standard $W^{1,p}$ and $L^p$ norms. An equivalent…
An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves the square root of an elliptic operator of second order. Finite element approximation in space is employed. To construct approximation in time, regularized two-level schemes are used. The numerical implementation is based on solving the equation with the square root of the elliptic operator using an auxiliary Cauchy problem for a pseudo-parabolic equation. The scheme of the second-order accuracy in time is based on a regularization of the three-level explicit Adam…
This work is devoted to the nonlinear inverse problem of identifying the reaction coefficient in an elliptic boundary value problem from single Cauchy data on a part of the boundary. We then examine simultaneously two elliptic boundary value problems generated from the available Cauchy data. The output least squares method with the Tikhonov regularization is applied to find approximations of the sought coefficient. We discretize the PDEs with piecewise linear finite elements. The stability and convergence of this technique are then established. A numerical experiment is presented to illustrate…
We consider the finite element discretization and the iterative solution of singularly perturbed elliptic reaction-diffusion equations in three-dimensional computational domains. These equations arise from the optimality conditions for elliptic distributed optimal control problems with energy regularization that were recently studied by M.~Neumüller and O.~Steinbach (2020). We provide quasi-optimal a priori finite element error estimates which depend both on the mesh size $h$ and on the regularization parameter $\varrho$. The choice $\varrho = h^2$ ensures optimal convergence which only depend…
