Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn quasi-reversibility solutions to the Cauchy problem for the Laplace equation: regularity and error estimates
187
0
0.0
(
0
)
Added by
Lucas Chesnel
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We are interested in the classical ill-posed Cauchy problem for the Laplace equation. One method to approximate the solution associated with compatible data consists in considering a family of regularized well-posed problems depending on a small parameter $varepsilon>0$. In this context, in order to prove convergence of finite elements methods, it is necessary to get regularity results of the solutions to these regularized problems which hold uniformly in $varepsilon$. In the present work, we obtain these results in smooth domains and in 2D polygonal geometries. In presence of corners, due the particular structure of the regularized problems, classical techniques `a la Grisvard do not work and instead, we apply the Kondratiev approach. We describe the procedure in detail to keep track of the dependence in $varepsilon$ in all the estimates. The main originality of this study lies in the fact that the limit problem is ill-posed in any framework.
rate research
Read More
The main aim of this paper is to solve an inverse source problem for a general nonlinear hyperbolic equation. Combining the quasi-reversibility method and a suitable Carleman weight function, we define a map of which fixed point is the solution to the inverse problem. To find this fixed point, we define a recursive sequence with an arbitrary initial term by the same manner as in the classical proof of the contraction principle. Applying a Carleman estimate, we show that the sequence above converges to the desired solution with the exponential rate. Therefore, our new method can be considered as an analog of the contraction principle. We rigorously study the stability of our method with respect to noise. Numerical examples are presented.
We study a commonly-used second-kind boundary-integral equation for solving the Helmholtz exterior Neumann problem at high frequency, where, writing $Gamma$ for the boundary of the obstacle, the relevant integral operators map $L^2(Gamma)$ to itself. We prove new frequency-explicit bounds on the norms of both the integral operator and its inverse. The bounds on the norm are valid for piecewise-smooth $Gamma$ and are sharp, and the bounds on the norm of the inverse are valid for smooth $Gamma$ and are observed to be sharp at least when $Gamma$ is curved. Together, these results give bounds on the condition number of the operator on $L^2(Gamma)$; this is the first time $L^2(Gamma)$ condition-number bounds have been proved for this operator for obstacles other than balls.
Let $H$ be a norm of ${bf R}^N$ and $H_0$ the dual norm of $H$. Denote by $Delta_H$ the Finsler-Laplace operator defined by $Delta_Hu:=mbox{div},(H( abla u) abla_xi H( abla u))$. In this paper we prove that the Finsler-Laplace operator $Delta_H$ acts as a linear operator to $H_0$-radially symmetric smooth functions. Furthermore, we obtain an optimal sufficient condition for the existence of the solution to the Cauchy problem for the Finsler heat equation $$ partial_t u=Delta_H u,qquad xin{bf R}^N,quad t>0, $$ where $Nge 1$ and $partial_t:=partial/partial t$.
In the article a convergent numerical method for conservative solutions of the Hunter--Saxton equation is derived. The method is based on piecewise linear projections, followed by evolution along characteristics where the time step is chosen in order to prevent wave breaking. Convergence is obtained when the time step is proportional to the square root of the spatial step size, which is a milder restriction than the common CFL condition for conservation laws.
This work discusses the finite element discretization of an optimal control problem for the linear wave equation with time-dependent controls of bounded variation. The main focus lies on the convergence analysis of the discretization method. The state equation is discretized by a space-time finite element method. The controls are not discretized. Under suitable assumptions optimal convergence rates for the error in the state and control variable are proven. Based on a conditional gradient method the solution of the semi-discretized optimal control problem is computed. The theoretical convergence rates are confirmed in a numerical example.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
