Computer-assisted analysis of the sign-change structure for elliptic problems

01/12/2020
by   Kazuaki Tanaka, et al.
0

In this paper, a method is proposed for rigorously analyzing the sign-change structure of solutions to elliptic problems with computer-assistance. Suppose that errors u-û_H^1_0 and u-û_L^∞ are evaluated between an exact solution u and a numerically computed approximate solution û. We estimate the number of sign-changes of the solution u (the number of nodal domains) and the location of zero level-sets of u (the location of the nodal line). We present numerical examples where our method is applied to a specific semilinear elliptic problem.

READ FULL TEXT
research
11/03/2020

Numerical verification method for positive solutions of elliptic problems

The purpose of this paper is to propose methods for verifying the positi...
research
07/06/2021

Elliptic polytopes and invariant norms of linear operators

We address the problem of constructing elliptic polytopes in R^d, which ...
research
07/12/2021

Deep unfitted Nitsche method for elliptic interface problems

In this paper, we propose a deep unfitted Nitsche method for computing e...
research
11/05/2019

A hybridized discontinuous Galerkin method for Poisson-type problems with sign-changing coefficients

In this paper, we present a hybridized discontinuous Galerkin (HDG) meth...
research
04/14/2022

A deep first-order system least squares method for solving elliptic PDEs

We propose a First-Order System Least Squares (FOSLS) method based on de...
research
06/26/2020

A method of fundamental solutions for doubly-periodic potential flow problems using the Weierstrass elliptic function

In this paper, we propose a method of fundamental solutions for the prob...
research
05/12/2022

Analytic solutions and numerical method for a coupled thermo-neutronic problem

We consider in this contribution a simplified idealized one-dimensional ...

Please sign up or login with your details

Forgot password? Click here to reset