We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Chapter 3 starts out with a physics motivation, as well as a mathematical statement of the problem that will be tackled in later sections. After a brief discussion of analytical differentiation, the bulk of the chapter is devoted to increasingly better finite-difference approximations, like the forward difference and the central difference. These are explicitly derived using Taylor expansions, and also applied to second derivatives and to points on a grid. A section introduces the useful tool of Richardson extrapolation, which reappears in later chapters. The chapter also includes an original discussion of automatic differentiation, which is built up from the concept of dual numbers. The chapter is rounded out by a physics project, which studies the kinetic energy in single-particle quantum mechanics, and a problem set. The physics project involves different wave functions and provides the groundwork for the project in the integrals chapter.
This paper proposes an extrapolation cascadic multigrid (EXCMG) method to solve elliptic problems in domains with reentrant corners. On a class of λ-graded meshes, we derive some new extrapolation formulas to construct a high-order approximation to the finite element solution on the next finer mesh using the numerical solutions on two-level of grids (current and previous grids). Then, this high-order approximation is used as the initial guess to reduce computational cost of the conjugate gradient method. Recursive application of this idea results in the EXCMG method proposed in this paper. Finally, numerical results for a crack problem and an L-shaped problem are presented to verify the efficiency and effectiveness of the proposed EXCMG method.
A finite difference method which is second-order accurate in time and in space is proposed for two-dimensional fractional percolation equations. Using the Fourier transform, a general approximation for the mixed fractional derivatives is analyzed. An approach based on the classical Crank-Nicolson scheme combined with the Richardson extrapolation is used to obtain temporally and spatially second-order accurate numerical estimates. Consistency, stability and convergence of the method are established. Numerical experiments illustrating the effectiveness of the theoretical analysis are provided.
In this paper, a general method to derive asymptotic error expansion formulas for the mixed finite element approximations of the Maxwell eigenvalue problem is established. Abstract lemmas for the error of the eigenvalue approximations are obtained. Based on the asymptotic error expansion formulas, the Richardson extrapolation method is employed to improve the accuracy of the approximations for the eigenvalues of the Maxwell system from to when applying the lowest order Nédélec mixed finite element and a nonconforming mixed finite element. To our best knowledge, this is the first superconvergence result of the Maxwell eigenvalue problem by the extrapolation of the mixed finite element approximation. Numerical experiments are provided to demonstrate the theoretical results.
Goovaerts and de Vylder (1983) provided a stable recursive algorithm for calculating the probability of ultimate ruin. Their algorithm yielded bounds for this probability. It is shown that in practice their method may be inherently unstable because it is based on the subtraction of nearly equal numbers. An alternative to this type of subtraction is provided. It is proved that their algorithm converges only at a linear rate to the true value. It is suggested that this slow rate of convergence be improved via an application of the Richardson extrapolation technique.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.