اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSolving Yamabe Problem by An Iterative Method
100
0
0.0
(
0
)
تأليف
Jie Xu
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce an iterative scheme to prove the Yamabe problem $ - aDelta_{g} u + S u = lambda u^{p-1} $, firstly on open domain $ (Omega, g) $ with Dirichlet boundary conditions, and then on closed manifolds $ (M, g) $ by local argument. It is a new proof, which solves the Yamabe problem for $ n geqslant 3 $ in a uniform argument, beyonds the traditional analysis with respect to the minimization of functionals.
قيم البحث
اقرأ أيضاً
The current paper is the second part of a series of two papers dedicated to 2D problem of diffraction of acoustic waves by a segment bearing impedance boundary conditions. In the first part some preliminary steps were made, namely, the problem was re
duced to two matrix Riemann-Hilbert problem. Here the Riemann-Hilbert problems are solved with the help of a novel method of OE-equations. Each Riemann-Hilbert problem is embedded into a family of similar problems with the same coefficient and growth condition, but with some other cuts. The family is indexed by an artificial parameter. It is proven that the dependence of the solution on this parameter can be described by a simple ordinary differential equation (ODE1). The boundary conditions for this equation are known and the inverse problem of reconstruction of the coefficient of ODE1 from the boundary conditions is formulated. This problem is called the OE-equation. The OE-equation is solved by a simple numerical algorithm.
In this paper, an efficient iterative method is proposed for solving multiple scattering problem in locally inhomogeneous media. The key idea is to enclose the inhomogeneity of the media by well separated artificial boundaries and then apply purely o
utgoing wave decomposition for the scattering field outside the enclosed region. As a result, the original multiple scattering problem can be decomposed into a finite number of single scattering problems, where each of them communicates with the other scattering problems only through its surrounding artificial boundary. Accordingly, they can be solved in a parallel manner at each iteration. This framework enjoys a great flexibility in using different combinations of iterative algorithms and single scattering problem solvers. The spectral element method seamlessly integrated with the non-reflecting boundary condition and the GMRES iteration is advocated and implemented in this work. The convergence of the proposed method is proved by using the compactness of involved integral operators. Ample numerical examples are presented to show its high accuracy and efficiency.
This paper develops and analyzes a general iterative framework for solving parameter-dependent and random diffusion problems. It is inspired by the multi-modes method of [7,8] and the ensemble method of [19] and extends those methods into a more gene
ral and unified framework. The main idea of the framework is to reformulate the underlying problem into another problem with a parameter-independent diffusion coefficient and a parameter-dependent (and solution-dependent) right-hand side, a fixed-point iteration is then employed to compute the solution of the reformulated problem. The main benefit of the proposed approach is that an efficient direct solver and a block Krylov subspace iterative solver can be used at each iteration, allowing to reuse the $LU$ matrix factorization or to do an efficient matrix-matrix multiplication for all parameters, which in turn results in significant computation saving. Convergence and rates of convergence are established for the iterative method both at the variational continuous level and at the finite element discrete level under some structure conditions. Several strategies for establishing reformulations of parameter-dependent and random diffusion problems are proposed and their computational complexity is analyzed. Several 1-D and 2-D numerical experiments are also provided to demonstrate the efficiency of the proposed iterative method and to validate the theoretical convergence results.
An equation-by-equation (EBE) method is proposed to solve a system of nonlinear equations arising from the moment constrained maximum entropy problem of multidimensional variables. The design of the EBE method combines ideas from homotopy continuatio
n and Newtons iterative methods. Theoretically, we establish the local convergence under appropriate conditions and show that the proposed method, geometrically, finds the solution by searching along the surface corresponding to one component of the nonlinear problem. We will demonstrate the robustness of the method on various numerical examples, including: (1) A six-moment one-dimensional entropy problem with an explicit solution that contains components of order $10^0-10^3$ in magnitude; (2) Four-moment multidimensional entropy problems with explicit solutions where the resulting systems to be solved ranging from $70-310$ equations; (3) Four- to eight-moment of a two-dimensional entropy problem, which solutions correspond to the densities of the two leading EOFs of the wind stress-driven large-scale oceanic model. In this case, we find that the EBE method is more accurate compared to the classical Newtons method, the MATLAB generic solver, and the previously developed BFGS-based method, which was also tested on this problem. (4) Four-moment constrained of up to five-dimensional entropy problems which solutions correspond to multidimensional densities of the components of the solutions of the Kuramoto-Sivashinsky equation. For the higher dimensional cases of this example, the EBE method is superior because it automatically selects a subset of the prescribed moment constraints from which the maximum entropy solution can be estimated within the desired tolerance. This selection feature is particularly important since the moment constrained maximum entropy problems do not necessarily have solutions in general.
An iterative orbital interaction (iOI) approach is proposed to solve, in a bottom-up fashion, the self-consistent field problem in quantum chemistry. While it belongs grossly to the family of fragment-based quantum chemical methods, iOI is distinctiv
e in that (1) it divides and conquers not only the energy but also the wave function, and that (2) the subsystems sizes are automatically determined by successively merging neighboring small subsystems until they are just enough for converging the wave function to a given accuracy. Orthonormal occupied and virtual localized molecular orbitals are obtained in a natural manner, which can be used for all post-SCF purposes.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
