Showing papers on "Bicubic interpolation published in 1975"
13 citations
01 Nov 1975
TL;DR: In this paper, the effects of using different methods for approximating bottom topography in a wave-refraction computer model was conducted, and the results indicated that overall computed wave patterns and parameter distributions were quite similar.
Abstract: A study of the effects of using different methods for approximating bottom topography in a wave-refraction computer model was conducted. Approximation techniques involving quadratic least squares, cubic least squares, and constrained bicubic polynomial interpolation were compared for computed wave patterns and parameters in the region of Saco Bay, Maine. Although substantial local differences can be attributed to use of the different approximation techniques, results indicated that overall computed wave patterns and parameter distributions were quite similar.
4 citations
3 citations
TL;DR: In this paper, it was shown that quasi-Hermite-fejér interpolation polynomials on the Chebyshev nodes converge uniformly to the continuous function being interpolated.
Abstract: D.L. Berman has proved several divergence theorems about “extended” Hermite-Fejér interpolation on the Chebyshev nodes of the first kind. These are surprising in light of the classical convergence theorem of L. Fejér concerning ordinary Hermite-Fejér interpolation on these nodes. However there is one case which has been neglected so far: the case of quasi-Hermite-Fejér interpolation on these nodes. In this paper it is proved that quasi-Hermite-Fejér interpolation polynomials on the Chebyshev nodes converge uniformly to the continuous function being interpolated. In addition, an estimate for the rate of convergence is established.
2 citations
TL;DR: In this paper, the Hermite interpolation method is described in a simplified form and the formulae are derived, where the derivatives of the interpolating polynomials are not known.
2 citations
CERN1
TL;DR: In this article, a numerical method of approximation of the fast neutron stationary transport equation by means of bicubic cardinal splines is investigated in order to calculate the neutron flux in the one-dimensional plane geometry.
2 citations
TL;DR: In this article, an upper bound for the absolute magnitude error of the interpolated values is given for digital f.i.r. interpolation filters with linear phase, and the design procedure for the impulse response is straight forward, using appropriate window functions, e.g. the Kaiser function.
Abstract: For digital f.i.r. interpolation filters with linear phase an upper bound is given for the absolute magnitude error of the interpolated values. Starting with this prescribed interpolation error, the design procedure for the impulse response is straight forward, using appropriate window functions, e.g. the Kaiser function.
TL;DR: In this article, an unaliased truncated Fourier series is found to require less degrees of freedom than both cubic spline and two-point interpolation, except for the roughest field.
Abstract: Analytic fields, with several spectral variance power laws, are prescribed and evaluated at a finite number of equally-spaced points. For a given accuracy of interpolation, an unaliased truncated Fourier series is found to require less degrees of freedom than both cubic spline and two-point interpolation. With the input truncation chosen here, cubic spline is superior to linear interpolation, except for the roughest field. Very similar results hold for the accuracy of the first derivatives implied by these interpolation schemes. When the errors in the first derivatives are examined only at the data points, however, the derivative of the aliased series is more accurate than that of the cubic spline. An even more accurate series of the same length can be obtained by analyzing the cubic spline passed through the points. The two finite-difference schemes tested have the largest errors.