排序方式: 共有42条查询结果,搜索用时 15 毫秒
1.
Kousuke Kuto Tatsuki Mori Tohru Tsujikawa Shoji Yotsutani 《Journal of Differential Equations》2018,264(9):5928-5949
We consider the Neumann problem of a 1D stationary Allen–Cahn equation with nonlocal term. Our previous paper [4] obtained a local branch of asymmetric solutions which bifurcates from a point on the branch of odd-symmetric solutions. This paper derives the global behavior of the branch of asymmetric solutions, and moreover, determines the set of all solutions to the nonlocal Allen–Cahn equation. Our proof is based on a level set analysis for an integral map associated with the nonlocal term. 相似文献
2.
This paper introduces a semi‐discrete implicit Euler (SDIE) scheme for the Allen‐Cahn equation (ACE) with fidelity forcing on graphs. The continuous‐in‐time version of this differential equation was pioneered by Bertozzi and Flenner in 2012 as a method for graph classification problems, such as semi‐supervised learning and image segmentation. In 2013, Merkurjev et. al. used a Merriman‐Bence‐Osher (MBO) scheme with fidelity forcing instead, as heuristically it was expected to give similar results to the ACE. The current paper rigorously establishes the graph MBO scheme with fidelity forcing as a special case of an SDIE scheme for the graph ACE with fidelity forcing. This connection requires the use of the double‐obstacle potential in the ACE, as was already demonstrated by Budd and Van Gennip in 2020 in the context of ACE without a fidelity forcing term. We also prove that solutions of the SDIE scheme converge to solutions of the graph ACE with fidelity forcing as the discrete time step converges to zero. In the second part of the paper we develop the SDIE scheme as a classification algorithm. We also introduce some innovations into the algorithms for the SDIE and MBO schemes. For large graphs, we use a QR decomposition method to compute an eigendecomposition from a Nyström extension, which outperforms the method used by, for example, Bertozzi and Flenner in 2012, in accuracy, stability, and speed. Moreover, we replace the Euler discretization for the scheme's diffusion step by a computation based on the Strang formula for matrix exponentials. We apply this algorithm to a number of image segmentation problems, and compare the performance with that of the graph MBO scheme with fidelity forcing. We find that while the general SDIE scheme does not perform better than the MBO special case at this task, our other innovations lead to a significantly better segmentation than that from previous literature. We also empirically quantify the uncertainty that this segmentation inherits from the randomness in the Nyström extension. 相似文献
3.
Manuel del Pino Konstantinos T. Gkikas 《Annales de l'Institut Henri Poincaré (C) Analyse Non Linéaire》2018,35(1):187-215
We consider the parabolic Allen–Cahn equation in , , We construct an ancient radially symmetric solution with any given number k of transition layers between ?1 and +1. At main order they consist of k time-traveling copies of w with spherical interfaces distant one to each other as . These interfaces are resemble at main order copies of the shrinking sphere ancient solution to mean the flow by mean curvature of surfaces: . More precisely, if denotes the heteroclinic 1-dimensional solution of given by we have where 相似文献
4.
Blaž Mramor 《Annales de l'Institut Henri Poincaré (C) Analyse Non Linéaire》2018,35(3):687-711
We investigate the existence of non-constant uniformly-bounded minimal solutions of the Allen–Cahn equation on a Gromov-hyperbolic group. We show that whenever the Laplace term in the Allen–Cahn equation is small enough, there exist minimal solutions satisfying a large class of prescribed asymptotic behaviours. For a phase field model on a hyperbolic group, such solutions describe phase transitions that asymptotically converge towards prescribed phases, given by asymptotic directions. In the spirit of de Giorgi's conjecture, we then fix an asymptotic behaviour and let the Laplace term go to zero. In the limit we obtain a solution to a corresponding asymptotic Plateau problem by Γ-convergence. 相似文献
5.
We consider the nonlinear problem of inhomogeneous Allen–Cahn equation where Ω is a bounded domain in with smooth boundary, ? is a small positive parameter, ν denotes the unit outward normal of ?Ω, V is a positive smooth function on . Let Γ be a curve intersecting orthogonally with ?Ω at exactly two points and dividing Ω into two parts. Moreover, Γ satisfies stationary and non-degenerate conditions with respect to the functional . We can prove that there exists a solution such that: as , approaches +1 in one part of Ω, while tends to ?1 in the other part, except a small neighborhood of Γ. 相似文献
6.
Shijin Ding Yinghua Li Ying Tang 《Mathematical Methods in the Applied Sciences》2019,42(14):4780-4794
This paper is concerned with a diffuse interface model for two‐phase flow of compressible fluids with a type of free boundary. We establish the existence and uniqueness of global strong solutions of a coupled Navier‐Stokes/Allen‐Cahn system in 1D. 相似文献
7.
8.
Zhen Guan John Lowengrub Cheng Wang 《Mathematical Methods in the Applied Sciences》2017,40(18):6836-6863
In this paper, we provide a detailed convergence analysis for fully discrete second‐order (in both time and space) numerical schemes for nonlocal Allen‐Cahn and nonlocal Cahn‐Hilliard equations. The unconditional unique solvability and energy stability ensures ? 4 stability. The convergence analysis for the nonlocal Allen‐Cahn equation follows the standard procedure of consistency and stability estimate for the numerical error function. For the nonlocal Cahn‐Hilliard equation, because of the complicated form of the nonlinear term, a careful expansion of its discrete gradient is undertaken, and an H ?1 inner‐product estimate of this nonlinear numerical error is derived to establish convergence. In addition, an a priori bound of the numerical solution at the discrete level is needed in the error estimate. Such a bound can be obtained by performing a higher order consistency analysis by using asymptotic expansions for the numerical solution. Following the technique originally proposed by Strang (eg, 1964), instead of the standard comparison between the exact and numerical solutions, an error estimate between the numerical solution and the constructed approximate solution yields an O (s 3+h 4) convergence in norm, in which s and h denote the time step and spatial mesh sizes, respectively. This in turn leads to the necessary bound under a standard constraint s ≤C h . Here, we also prove convergence of the scheme in the maximum norm under the same constraint. 相似文献
9.
10.
Konstantinos Chrysafinos 《Mathematical Modelling and Numerical Analysis》2019,53(2):551-583
Fully-discrete approximations of the Allen–Cahn equation are considered. In particular,we consider schemes of arbitrary order based on a discontinuous Galerkin (in time) approach combined with standard conforming finite elements (in space). We prove that these schemes are unconditionally stable under minimal regularity assumptions on the given data. We also prove best approximation a-priori error estimates,with constants depending polynomially upon (1/ε) by circumventing Gronwall Lemma arguments. The key feature of our approach is a carefully constructed duality argument,combined with a boot-strap technique.https://doi.org/10.1051/m2an/2018071 相似文献