ترغب بنشر مسار تعليمي؟ اضغط هنا

On the convergence of the quadratic method

300   0   0.0 ( 0 )
 نشر من قبل Aatef Hobiny
 تاريخ النشر 2013
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

The convergence of the so-called quadratic method for computing eigenvalue enclosures of general self-adjoint operators is examined. Explicit asymptotic bounds for convergence to isolated eigenvalues are found. These bounds turn out to improve significantly upon those determined in previous investigations. The theory is illustrated by means of several numerical experiments performed on particularly simple benchmark models of one-dimensional Schru007fodinger operators.

قيم البحث

اقرأ أيضاً

68 - Trung Nguyen 2021
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.
132 - Fatma Mohamed , Casian Pantea , 2017
We show that solutions of the chemical reaction-diffusion system associated to $A+Brightleftharpoons C$ in one spatial dimension can be approximated in $L^2$ on any finite time interval by solutions of a space discretized ODE system which models the corresponding chemical reaction system replicated in the discretization subdomains where the concentrations are assumed spatially constant. Same-species reactions through the virtual boundaries of adjacent subdomains lead to diffusion in the vanishing limit. We show convergence of our numerical scheme by way of a consistency estimate, with features generalizable to reaction networks other than the one considered here, and to multiple space dimensions. In particular, the connection with the class of complex-balanced systems is briefly discussed here, and will be considered in future work.
Boundary integral numerical methods are among the most accurate methods for interfacial Stokes flow, and are widely applied. They have the advantage that only the boundary of the domain must be discretized, which reduces the number of discretization points and allows the treatment of complicated interfaces. Despite their popularity, there is no analysis of the convergence of these methods for interfacial Stokes flow. In practice, the stability of discretizations of the boundary integral formulation can depend sensitively on details of the discretization and on the application of numerical filters. We present a convergence analysis of the boundary integral method for Stokes flow, focusing on a rather general method for computing the evolution of an elastic capsule, viscous drop, or inviscid bubble in 2D strain and shear flows. The analysis clarifies the role of numerical filters in practical computations.
128 - Yanjun Zhang , Hanyu Li 2021
The randomized Gauss--Seidel method and its extension have attracted much attention recently and their convergence rates have been considered extensively. However, the convergence rates are usually determined by upper bounds, which cannot fully refle ct the actual convergence. In this paper, we make a detailed analysis of their convergence behaviors. The analysis shows that the larger the singular value of $A$ is, the faster the error decays in the corresponding singular vector space, and the convergence directions are mainly driven by the large singular values at the beginning, then gradually driven by the small singular values, and finally by the smallest nonzero singular value. These results explain the phenomenon found in the extensive numerical experiments appearing in the literature that these two methods seem to converge faster at the beginning. Numerical examples are provided to confirm the above findings.
We present a convergence proof for higher order implementations of the projective integration method (PI) for a class of deterministic multi-scale systems in which fast variables quickly settle on a slow manifold. The error is shown to contain contri butions associated with the length of the microsolver, the numerical accuracy of the macrosolver and the distance from the slow manifold caused by the combined effect of micro- and macrosolvers, respectively. We also provide stability conditions for the PI methods under which the fast variables will not diverge from the slow manifold. We corroborate our results by numerical simulations.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا