立方体上半线性椭圆PDE的Newton方法与对称性
Newton's Method and Symmetry for Semilinear Elliptic PDE on the Cube
摘要:
我们寻求离散近似解$u:Ω\to R$的半线性椭圆型偏微分方程的形式$Δu + f_s(u) = 0$,其中$f_s$是一个单参数家庭的非线性函数和$Ω$是一个域在$R^d$。本文的主要成果是在立方体$Ω=(0,π)^3 \subseteq R^3$上对偏微分方程的解进行了逼近。立方体上的函数有323个可能的各向同性子群,它们分属于99个共轭类。在这个问题中,具有对称性的分支是非常有趣的,包括许多具有三维临界特征空间的分支。我们的自动对称分析是必要的,其中有这么多的各向同性子群和分叉,它允许我们的代码遵循在分叉点创建的每个等价类中的一个分支。我们最复杂的结果是一个6维临界特征空间的退化分叉的完整分析。本文推广了作者在{图上非线性椭圆型偏差分方程的\it自动分歧分析}中的工作(国际分叉与混沌杂志,2009年),其中他们将对称性分析与梯度牛顿-伽辽金算法的修改实现相结合(GNGA,Neuberger和Swift)自动生成分叉图和解决方案图形的小,离散的问题与大对称群。在当前的文件中描述的代码是有效地实现并行,使我们能够调查一个相对精细的网格离散化的立方体。我们使用我们的论文{ \it An MPI Implementation of a Self-Submitting Parallel Job Queue}(Int. J. of Parallel Prog.,2012年)。
英文摘要:
We seek discrete approximations to solutions $u:Ω\to R$ of semilinear elliptic partial differential equations of the form $Δu + f_s(u) = 0$, where $f_s$ is a one-parameter family of nonlinear functions and $Ω$ is a domain in $R^d$. The main achievement of this paper is the approximation of solutions to the PDE on the cube $Ω=(0,π)^3 \subseteq R^3$. There are 323 possible isotropy subgroups of functions on the cube, which fall into 99 conjugacy classes. The bifurcations with symmetry in this problem are quite interesting, including many with 3-dimensional critical eigenspaces. Our automated symmetry analysis is necessary with so many isotropy subgroups and bifurcations among them, and it allows our code to follow one branch in each equivalence class that is created at a bifurcation point. Our most complicated result is the complete analysis of a degenerate bifurcation with a 6-dimensional critical eigenspace. This article extends the authors' work in {\it Automated Bifurcation Analysis for Nonlinear Elliptic Partial Difference Equations on Graphs} (Int. J. of Bifurcation and Chaos, 2009), wherein they combined symmetry analysis with modified implementations of the gradient Newton-Galerkin algorithm (GNGA, Neuberger and Swift) to automatically generate bifurcation diagrams and solution graphics for small, discrete problems with large symmetry groups. The code described in the current paper is efficiently implemented in parallel, allowing us to investigate a relatively fine-mesh discretization of the cube. We use the methodology and corresponding library presented in our paper {\it An MPI Implementation of a Self-Submitting Parallel Job Queue} (Int. J. of Parallel Prog., 2012).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。