Inverse central ordering for the Newton interpolation formula

Numerical Algorithms - An inverse central ordering of the nodes is proposed for the Newton interpolation formula. This ordering may improve the stability for certain distributions of nodes. For...     

Classification of sets satisfying the geometric characterization

The geometric characterization identifies the sets of nodes such that the Lagrange polynomials are products of factors of first degree. We offer a detailed classification of all known sets satisfying the geometric characterization in the plane. The defect, which takes into account the number of lines containing more nodes than the degree, plays a fundamental role in this classification. Partially supported by the Spanish Research Grant MTM2006-03388, by Gobierno de Aragón and Fondo Social Europeo.     

Multivariate convexity preserving interpolation by smooth functions

A set of multivariate data is called strictly convex if there exists a strictly convex interpolant to these data. In this paper we characterize strict convexity of Lagrange and Hermite multivariate data by a simple property and show that for strict convex data and given smoothness requirements there exists a smooth strictly convex interpolant. We also show how to construct a multivariate convex smooth interpolant to scattered data. Partially supported by DGICYT PS93-0310 and by the EC project CHRX-CT94-0522.     

Shape preservation regions for six-dimensional spaces

We analyze the critical length for design purposes of six-dimensional spaces invariant under translations and reflections containing the functions 1, cos t and sin t. These spaces also contain the first degree polynomials as well as trigonometric and/or hyperbolic functions. We identify the spaces whose critical length for design purposes is greater than 2π and find its maximum 4π. By a change of variables, two biparametric families of spaces arise. We call shape preservation region to the set of admissible parameters in order that the space has shape preserving representations for curves. We describe the shape preserving regions for both families. To our friend Mariano Gasca on occasion of his 60th birthday Research partially supported by the Spanish Research Grant MTM2006-03388, by Gobierno de Aragón and Fondo Social Europeo.     

On best interpolation in Orlicz spaces

For given data, an interpolant is sought, so that a certain convex functional defined by a Young's function in the corresponding Orlicz space is minimized. The freedom gained in considering more general kind of spaces can be used for selecting the interpolants in an adequate class of functions. Both authors were partically supported by DGICYT:PS90/0120     

Implementation of an algorithm for detecting patterns in defocused scenes using binary joint transform correlation

An original method to detect images in defocused scenes by means of a binary joint transform correlation is presented. Defocused images are described in frequency domain as the product between the Fourier transform of the in-focus scene by the optical transfer function of the imaging lens. This function, which presents positive and negative values, introduces sign errors in the joint power spectrum. The goal of this study is to detect the sign of the optical transfer function starting from the defocused image by means of a digital algorithm. Information provided by the algorithm allows to compensate the sign errors in the binary joint power spectrum and to obtain invariant correlations with respect to defocusing. Theoretical analysis and digital experiments to test the procedure are provided.     

Contrast-improved joint transform correlator using spatial light modulators

When real time optical pattern recognition is carried out by means of spatial light modulators, a practical situation may arise in which the size of the Fourier transform and the intensity of the light source are fixed. Then, provided the input scene and the size of the spatial light modulator allow it, an interesting possibility for improving the overall intensity in the Fourier plane is the replication of the scene, either along a regular lattice structure or a random replication. In this work we analyse the usefulness of these methods, both to obtain diffraction images or cross-correlation between images in a joint transform correlator.     

Richardson’s iterative method for surface interpolation

Richardson’s iterative method has been used for approximating interpolating surfaces. We propose efficient modifications for tensor product surfaces that require less computational cost and storage, as well as faster convergence. Also, we consider some aspects of the triangular case together with some counter examples.     

Radon’s construction and matrix relations generating syzygies

Monatshefte für Mathematik - Let $$\varPi _n$$ be the set of bivariate polynomials of degree not greater than n. A $$\varPi _n$$-correct set of nodes is a set such that the Lagrange...