skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: The Carleman Contraction Mapping Method for Quasilinear Elliptic Equations with Over-determined Boundary Data
We propose a globally convergent numerical method to compute solutions to a general class of quasi-linear PDEs with both Neumann and Dirichlet boundary conditions. Combining the quasi-reversibility method and a suitable Carleman weight function, we define a map of which fixed point is the solution to the PDE under consideration. To find this fixed point, we define a recursive sequence with an arbitrary initial term using the same manner as in the proof of the contraction principle. Applying a Carleman estimate, we show that the sequence above converges to the desired solution. On the other hand, we also show that our method delivers reliable solutions even when the given data are noisy. Numerical examples are presented.  more » « less
Award ID(s):
2208159
PAR ID:
10407649
Author(s) / Creator(s):
Date Published:
Journal Name:
Acta Mathematica Vietnamica
ISSN:
0251-4184
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, Computers mathematics with applications)
    We propose a new iterative scheme to compute the numerical solution to an over-determined boundary value problem for a general quasilinear elliptic PDE. The main idea is to repeatedly solve its linearization by using the quasi-reversibility method with a suitable Carleman weight function. The presence of the Carleman weight function allows us to employ a Carleman estimate to prove the convergence of the sequence generated by the iterative scheme above to the desired solution. The convergence of the iteration is fast at an exponential rate without the need of an initial good guess. We apply this method to compute solutions to some general quasilinear elliptic equations and a large class of first-order Hamilton-Jacobi equations. Numerical results are presented. 
    more » « less
  2. ; ; ; (, Applied Mathematics and Computation)
    We propose a globally convergent computational technique for the nonlinear inverse problem of reconstructing the zero-order coefficient in a parabolic equation using partial boundary data. This technique is called the ``reduced dimensional method.'' Initially, we use the polynomial-exponential basis to approximate the inverse problem as a system of 1D nonlinear equations. We then employ a Picard iteration based on the quasi-reversibility method and a Carleman weight function. We will rigorously prove that the sequence derived from this iteration converges to the accurate solution for that 1D system without requesting a good initial guess of the true solution. The key tool for the proof is a Carleman estimate. We will also show some numerical examples. 
    more » « less
  3. ; ; (, Inverse Problems)
    Abstract This paper aims to determine the initial conditions for quasi-linear hyperbolic equations that include nonlocal elements. We suggest a method where we approximate the solution of the hyperbolic equation by truncating its Fourier series in the time domain with a polynomial–exponential basis. This truncation effectively removes the time variable, transforming the problem into a system of quasi-linear elliptic equations. We refer to this technique as the ‘time dimensional reduction method.’ To numerically solve this system comprehensively without the need for an accurate initial estimate, we used the newly developed Carleman contraction principle. We show the efficiency of our method through various numerical examples. The time dimensional reduction method stands out not only for its precise solutions but also for its remarkable speed in computation. 
    more » « less
  4. ; ; ; (, Computers & Mathematics with Applications)
    This paper aims to reconstruct the initial condition of a hyperbolic equation with an unknown damping coefficient. Our approach involves approximating the hyperbolic equation’s solution by its truncated Fourier expansion in the time domain and using the recently developed polynomial-exponential basis. This truncation process facilitates the elimination of the time variable, consequently, yielding a system of quasi-linear elliptic equations. To globally solve the system without needing an accurate initial guess, we employ the Carleman contraction principle. We provide several numerical examples to illustrate the efficacy of our method. The method not only delivers precise solutions but also showcases remarkable computational efficiency. 
    more » « less
  5. ; ; ; (, Communications on Applied Mathematics and Computation)
    Abstract Fixed-point fast sweeping WENO methods are a class of efficient high-order numerical methods to solve steady-state solutions of hyperbolic partial differential equations (PDEs). The Gauss-Seidel iterations and alternating sweeping strategy are used to cover characteristics of hyperbolic PDEs in each sweeping order to achieve fast convergence rate to steady-state solutions. A nice property of fixed-point fast sweeping WENO methods which distinguishes them from other fast sweeping methods is that they are explicit and do not require inverse operation of nonlinear local systems. Hence, they are easy to be applied to a general hyperbolic system. To deal with the difficulties associated with numerical boundary treatment when high-order finite difference methods on a Cartesian mesh are used to solve hyperbolic PDEs on complex domains, inverse Lax-Wendroff (ILW) procedures were developed as a very effective approach in the literature. In this paper, we combine a fifth-order fixed-point fast sweeping WENO method with an ILW procedure to solve steady-state solution of hyperbolic conservation laws on complex computing regions. Numerical experiments are performed to test the method in solving various problems including the cases with the physical boundary not aligned with the grids. Numerical results show high-order accuracy and good performance of the method. Furthermore, the method is compared with the popular third-order total variation diminishing Runge-Kutta (TVD-RK3) time-marching method for steady-state computations. Numerical examples show that for most of examples, the fixed-point fast sweeping method saves more than half CPU time costs than TVD-RK3 to converge to steady-state solutions. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email