اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConvergence and Optimal Complexity of the Adaptive Planewave Method for Eigenvalue Computations
100
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we study an adaptive planewave method for multiple eigenvalues of second-order elliptic partial equations. Inspired by the technique for the adaptive finite element analysis, we prove that the adaptive planewave method has the linear convergence rate and optimal complexity.
قيم البحث
اقرأ أيضاً
We consider the convergence of adaptive BEM for weakly-singular and hypersingular integral equations associated with the Laplacian and the Helmholtz operator in 2D and 3D. The local mesh-refinement is driven by some two-level error estimator. We show
that the adaptive algorithm drives the underlying error estimates to zero. Moreover, we prove that the saturation assumption already implies linear convergence of the error with optimal algebraic rates.
In this paper, we study an adaptive finite element method for a class of a nonlinear eigenvalue problems that may be of nonconvex energy functional and consider its applications to quantum chemistry. We prove the convergence of adaptive finite elemen
t approximations and present several numerical examples of micro-structure of matter calculations that support our theory.
Fully adaptive computations of the resistive magnetohydrodynamic (MHD) equations are presented in two and three space dimensions using a finite volume discretization on locally refined dyadic grids. Divergence cleaning is used to control the incompre
ssibility constraint of the magnetic field. For automatic grid adaptation a cell-averaged multiresolution analysis is applied which guarantees the precision of the adaptive computations, while reducing CPU time and memory requirements. Implementation issues of the open source code CARMEN-MHD are discussed. To illustrate its precision and efficiency different benchmark computations including shock-cloud interaction and magnetic reconnection are presented.
Proofs of convergence of adaptive finite element methods for the approximation of eigenvalues and eigenfunctions of linear elliptic problems have been given in a several recent papers. A key step in establishing such results for multiple and clustere
d eigenvalues was provided by Dai et. al. (2014), who proved convergence and optimality of AFEM for eigenvalues of multiplicity greater than one. There it was shown that a theoretical (non-computable) error estimator for which standard convergence proofs apply is equivalent to a standard computable estimator on sufficiently fine grids. Gallistl (2015) used a similar tool in order to prove that a standard adaptive FEM for controlling eigenvalue clusters for the Laplacian using continuous piecewise linear finite element spaces converges with optimal rate. When considering either higher-order finite element spaces or non-constant diffusion coefficients, however, the arguments of Dai et. al. and Gallistl do not yield equivalence of the practical and theoretical estimators for clustered eigenvalues. In this note we provide this missing key step, thus showing that standard adaptive FEM for clustered eigenvalues employing elements of arbitrary polynomial degree converge with optimal rate. We additionally establish that a key user-defined input parameter in the AFEM, the bulk marking parameter, may be chosen entirely independently of the properties of the target eigenvalue cluster. All of these results assume a fineness condition on the initial mesh in order to ensure that the nonlinearity is sufficiently resolved.
Regula Falsi, or the method of false position, is a numerical method for finding an approximate solution to f(x) = 0 on a finite interval [a, b], where f is a real-valued continuous function on [a, b] and satisfies f(a)f(b) < 0. Previous studies prov
ed the convergence of this method under certain assumptions about the function f, such as both the first and second derivatives of f do not change the sign on the interval [a, b]. In this paper, we remove those assumptions and prove the convergence of the method for all continuous functions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
