Rate of convergence

About: Rate of convergence is a research topic. Over the lifetime, 31257 publications have been published within this topic receiving 795334 citations. The topic is also known as: convergence rate.

Comparison of finite difference and boundary integral solutions to three-dimensional spontaneous rupture

Abstract: The spontaneously propagating shear crack on a frictional interface has proven to be a useful idealization of a natural earthquake. The corresponding boundary value problems are nonlinear and usually require computationally intensive numerical methods for their solution. Assessing the convergence and accuracy of the numerical methods is challenging, as we lack appropriate analytical solutions for comparison. As a complement to other methods of assessment, we compare solutions obtained by two independent numerical methods, a finite difference method and a boundary integral (BI) method. The finite difference implementation, called DFM, uses a traction-at-split-node formulation of the fault discontinuity. The BI implementation employs spectral representation of the stress transfer functional. The three-dimensional (3-D) test problem involves spontaneous rupture spreading on a planar interface governed by linear slip-weakening friction that essentially defines a cohesive law. To get a priori understanding of the spatial resolution that would be required in this and similar problems, we review and combine some simple estimates of the cohesive zone sizes which correspond quite well to the sizes observed in simulations. We have assessed agreement between the methods in terms of the RMS differences in rupture time, final slip, and peak slip rate and related these to median and minimum measures of the cohesive zone resolution observed in the numerical solutions. The BI and DFM methods give virtually indistinguishable solutions to the 3-D spontaneous rupture test problem when their grid spacing Δx is small enough so that the solutions adequately resolve the cohesive zone, with at least three points for BI and at least five node points for DFM. Furthermore, grid-dependent differences in the results, for each of the two methods taken separately, decay as a power law in Δx, with the same convergence rate for each method, the calculations apparently converging to a common, grid interval invariant solution. This result provides strong evidence for the accuracy of both methods. In addition, the specific solution presented here, by virtue of being demonstrably grid-independent and consistent between two very different numerical methods, may prove useful for testing new numerical methods for spontaneous rupture problems.

Rates of convergence and error estimation formulas for the Rayleigh–Ritz variational method

Abstract: A general theory of rates of convergence for the Rayleigh–Ritz variational method is given for the ground states of atoms and molecules. The theory shows what functions should be added to the basis set to improve the rate of convergence, and gives explicit formulas for estimating corrections to variational energies and wave functions. An application of this general theory to a CI calculation on the ground state of the helium atom yields an explicit large L asymptotic formula for the ‘‘L’’‐limit energies E L . The increments are found to obey the formula E L −E L−1 =−3C 1(L+ 1/2 )− 4−4C 2(L+ 1/2 )− 5+O(L − 6), where the constants C 1 and C 2 are given by explicit integrals over the exact wave function evaluated at r 1 2=0. Numerical evaluation of these integrals yields 3C 1≅0.0741 and 4C 2≅0.0309, in excellent agreement with the empirical results 3C 1≅0.0740 and 4C 2≅0.031 found by Carroll, Silverstone, and Metzger.

Hypocoercivity for linear kinetic equations conserving mass

Abstract: We develop a new method for proving hypocoercivity for a large class of linear kinetic equations with only one conservation law. Local mass conservation is assumed at the level of the collision kernel, while transport involves a confining potential, so that the solution relaxes towards a unique equilibrium state. Our goal is to evaluate in an appropriately weighted $L^2$ norm the exponential rate of convergence to the equilibrium. The method covers various models, ranging from diffusive kinetic equations like Vlasov-Fokker-Planck equations, to scattering models like the linear Boltzmann equation or models with time relaxation collision kernels corresponding to polytropic Gibbs equilibria, including the case of the linear Boltzmann model. In this last case and in the case of Vlasov-Fokker-Planck equations, any linear or superlinear growth of the potential is allowed.

Convergence Rates of Best N -term Galerkin Approximations for a Class of Elliptic sPDEs

Abstract: Deterministic Galerkin approximations of a class of second order elliptic PDEs with random coefficients on a bounded domain D⊂ℝd are introduced and their convergence rates are estimated. The approximations are based on expansions of the random diffusion coefficients in L 2(D)-orthogonal bases, and on viewing the coefficients of these expansions as random parameters y=y(ω)=(y i (ω)). This yields an equivalent parametric deterministic PDE whose solution u(x,y) is a function of both the space variable x∈D and the in general countably many parameters y. We establish new regularity theorems describing the smoothness properties of the solution u as a map from y∈U=(−1,1)∞ to $V=H^{1}_{0}(D)$. These results lead to analytic estimates on the V norms of the coefficients (which are functions of x) in a so-called “generalized polynomial chaos” (gpc) expansion of u. Convergence estimates of approximations of u by best N-term truncated V valued polynomials in the variable y∈U are established. These estimates are of the form N −r , where the rate of convergence r depends only on the decay of the random input expansion. It is shown that r exceeds the benchmark rate 1/2 afforded by Monte Carlo simulations with N “samples” (i.e., deterministic solves) under mild smoothness conditions on the random diffusion coefficients. A class of fully discrete approximations is obtained by Galerkin approximation from a hierarchic family $\{V_{l}\}_{l=0}^{\infty}\subset V$of finite element spaces in D of the coefficients in the N-term truncated gpc expansions of u(x,y). In contrast to previous works, the level l of spatial resolution is adapted to the gpc coefficient. New regularity theorems describing the smoothness properties of the solution u as a map from y∈U=(−1,1)∞ to a smoothness space W⊂V are established leading to analytic estimates on the W norms of the gpc coefficients and on their space discretization error. The space W coincides with $H^{2}(D)\cap H^{1}_{0}(D)$in the case where D is a smooth or convex domain. Our analysis shows that in realistic settings a convergence rate $N_{\mathrm{dof}}^{-s}$in terms of the total number of degrees of freedom N dof can be obtained. Here the rate s is determined by both the best N-term approximation rate r and the approximation order of the space discretization in D.

Finite volume solution of the two-dimensional Euler equations on a regular triangular mesh

Abstract: The two-dimensional Euler equations have been solved on a triangular grid by a multigrid scheme using the finite volume approach. By careful construction of the dissipative terms, the scheme is designed to be secondorder accurate in space, provided the grid is smooth, except in the vicinity of shocks, where it behaves as firstorder accurate. In its present form, the accuracy and convergence rate of the triangle code are comparable to that of the quadrilateral mesh code of Jameson.