About: Interpolation is a(n) research topic. Over the lifetime, 54021 publication(s) have been published within this topic receiving 904265 citation(s). The topic is also known as: interpolation & numerical interpolation.
15 Nov 1995-Journal of Chemical Physics
TL;DR: It is demonstrated that arbitrary accuracy can be achieved, independent of system size N, at a cost that scales as N log(N), which is comparable to that of a simple truncation method of 10 A or less.
Abstract: The previously developed particle mesh Ewald method is reformulated in terms of efficient B‐spline interpolation of the structure factors This reformulation allows a natural extension of the method to potentials of the form 1/rp with p≥1 Furthermore, efficient calculation of the virial tensor follows Use of B‐splines in place of Lagrange interpolation leads to analytic gradients as well as a significant improvement in the accuracy We demonstrate that arbitrary accuracy can be achieved, independent of system size N, at a cost that scales as N log(N) For biomolecular systems with many thousands of atoms this method permits the use of Ewald summation at a computational cost comparable to that of a simple truncation method of 10 A or less
01 Nov 1992-Journal of Computational Physics
Abstract: The present finite-difference schemes for the evaluation of first-order, second-order, and higher-order derivatives yield improved representation of a range of scales and may be used on nonuniform meshes. Various boundary conditions may be invoked, and both accurate interpolation and spectral-like filtering can be accomplished by means of schemes for derivatives at mid-cell locations. This family of schemes reduces to the Pade schemes when the maximal formal accuracy constraint is imposed with a specific computational stencil. Attention is given to illustrative applications of these schemes in fluid dynamics.
26 Feb 1978-
Abstract: A convective modelling procedure is presented which avoids the stability problems of central differencing while remaining free of the inaccuracies of numerical diffusion associated with upstream differencing. For combined convection and diffusion the number of operations at each grid point is comparable to that of standard upstream-pluscentral differencing - however, highly accurate solutions can be obtained with a grid spacing much larger than that required by conventional methods for comparable accuracy, with obvious practical advantaged in terms of both speed and storage. The algorithm is based on a conservative control-volume formulation with cell wall values of each field variable written in terms of a quadratic interpolation using in any one coordinate direction the two adjacent nodal values together with the value at the next upstream node. This results in a convective differencing scheme with greater formal accuracy than central differencing while retaining the basic stable convective sensitivity property of upstream-weighted schemes. The consistent treatment of diffusion terms is equivalent to central differencing. With careful modelling, numerical boundary conditions are not troublesome. Some idealized problems are studied, showing the practical advantages of the method over other schemes in comparison with exact solutions. An application to a complex unsteady two-dimensional flow is briefly discussed.
18 Nov 2011-
Abstract: 1. Some Classical Theorems.- 1.1. The Riesz-Thorin Theorem.- 1.2. Applications of the Riesz-Thorin Theorem.- 1.3. The Marcinkiewicz Theorem.- 1.4. An Application of the Marcinkiewicz Theorem.- 1.5. Two Classical Approximation Results.- 1.6. Exercises.- 1.7. Notes and Comment.- 2. General Properties of Interpolation Spaces.- 2.1. Categories and Functors.- 2.2. Normed Vector Spaces.- 2.3. Couples of Spaces.- 2.4. Definition of Interpolation Spaces.- 2.5. The Aronszajn-Gagliardo Theorem.- 2.6. A Necessary Condition for Interpolation.- 2.7. A Duality Theorem.- 2.8. Exercises.- 2.9. Notes and Comment.- 3. The Real Interpolation Method.- 3.1. The K-Method.- 3.2. The J-Method.- 3.3. The Equivalence Theorem.- 3.4. Simple Properties of ??, q.- 3.5. The Reiteration Theorem.- 3.6. A Formula for the K-Functional.- 3.7. The Duality Theorem.- 3.8. A Compactness Theorem.- 3.9. An Extremal Property of the Real Method.- 3.10. Quasi-Normed Abelian Groups.- 3.11. The Real Interpolation Method for Quasi-Normed Abelian Groups.- 3.12. Some Other Equivalent Real Interpolation Methods.- 3.13. Exercises.- 3.14. Notes and Comment.- 4. The Complex Interpolation Method.- 4.1. Definition of the Complex Method.- 4.2. Simple Properties of ?[?].- 4.3. The Equivalence Theorem.- 4.4. Multilinear Interpolation.- 4.5. The Duality Theorem.- 4.6. The Reiteration Theorem.- 4.7. On the Connection with the Real Method.- 4.8. Exercises.- 4.9. Notes and Comment.- 5. Interpolation of Lp-Spaces.- 5.1. Interpolation of Lp-Spaces: the Complex Method.- 5.2. Interpolation of Lp-Spaces: the Real Method.- 5.3. Interpolation of Lorentz Spaces.- 5.4. Interpolation of Lp-Spaces with Change of Measure: p0 = p1.- 5.5. Interpolation of Lp-Spaces with Change of Measure: p0 ? p1.- 5.6. Interpolation of Lp-Spaces of Vector-Valued Sequences.- 5.7. Exercises.- 5.8. Notes and Comment.- 6. Interpolation of Sobolev and Besov Spaces.- 6.1. Fourier Multipliers.- 6.2. Definition of the Sobolev and Besov Spaces.- 6.3. The Homogeneous Sobolev and Besov Spaces.- 6.4. Interpolation of Sobolev and Besov Spaces.- 6.5. An Embedding Theorem.- 6.6. A Trace Theorem.- 6.7. Interpolation of Semi-Groups of Operators.- 6.8. Exercises.- 6.9. Notes and Comment.- 7. Applications to Approximation Theory.- 7.1. Approximation Spaces.- 7.2. Approximation of Functions.- 7.3. Approximation of Operators.- 7.4. Approximation by Difference Operators.- 7.5. Exercises.- 7.6. Notes and Comment.- References.- List of Symbols.