On best constrained interpolation

For givenk-convex data, ak-convex interpolant is sought, so that a certain convex functional related with thek-th derivative is minimized.Partially supported by C.I.C.Y.T. PS87/0060.     

Interpolation lattices in several variables

Principal lattices are classical simplicial configurations of nodes suitable for multivariate polynomial interpolation in n dimensions. A principal lattice can be described as the set of intersection points of n + 1 pencils of parallel hyperplanes. Using a projective point of view, Lee and Phillips extended this situation to n + 1 linear pencils of hyperplanes. In two recent papers, two of us have introduced generalized principal lattices in the plane using cubic pencils. In this paper we analyze the problem in n dimensions, considering polynomial, exponential and trigonometric pencils, which can be combined in different ways to obtain generalized principal lattices.We also consider the case of coincident pencils. An error formula for generalized principal lattices is discussed. Partially supported by the Spanish Research Grant BFM2003-03510, by Gobierno de Aragón and Fondo Social Europeo.     

On best error bounds for approximation by piecewise polynomial functions

Summary An analog of the well-known Jackson-Bernstein-Zygmund theory on best approximation by trigonometric polynomials is developed for approximation methods which use piecewise polynomial functions. Interpolation and best approximation by polynomial splines, Hermite and finite element functions are examples of such methods. A direct theorem is proven for methods which are stable, quasi-linear and optimally accurate for sufficiently smooth functions. These assumptions are known to be satisfied in many cases of practical interest. Under a certain additional assumption, on the family of meshes, an inverse theorem is proven which shows that the direct theorem is sharp.The work presented in this paper was supported by the ERDA Mathematics and Computing Laboratory, Courant Institute of Mathematical Sciences, New York University, under Contract E(11-1)-3077 with the Energy Research and Development Administration.     

Transfinite interpolation on the medians of a triangle and best L 1-approximation

Let be a triangle in and let be the set of its three medians. We construct interpolants to smooth functions using transfinite (or blending) interpolation on The interpolants are of type f(₁)+g(₂)+h(₃), where (₁,₂,₃) are the barycentric coordinates with respect to the vertices of . Based on an error representation formula, we prove that the interpolant is the unique best L¹-approximant by functions of this type subject the function to be approximated is from a certain convexity cone in C³().Received: 17 December 2003     

Barycentric rational interpolation with no poles and high rates of approximation

It is well known that rational interpolation sometimes gives better approximations than polynomial interpolation, especially for large sequences of points, but it is difficult to control the occurrence of poles. In this paper we propose and study a family of barycentric rational interpolants that have no real poles and arbitrarily high approximation orders on any real interval, regardless of the distribution of the points. These interpolants depend linearly on the data and include a construction of Berrut as a special case.     

A parallel algorithm for discrete least squares rational approximation

Summary A new method for discrete least squares linearized rational approximation is presented. It generalizes the algorithm of Rutishauser-Gragg-Harrod-Reichel for discrete least squares polynomial approximation to the rational case. The algorithm is fast in the sense that it requires orderm computation time wherem is the number of data points and is the degree of the approximant. We describe how this algorithm can be implemented in parallel.     

Constrained approximation by splines with free knots

In this paper, a method that combines shape preservation and least squares approximation by splines with free knots is developed. Besides the coefficients of the spline a subset of the knot sequence, the so-calledfree knots, is included in the optimization process resulting in a nonlinear least squares problem in both the coefficients and the knots. The original problem, a special case of aconstrained semi-linear least squares problem, is reduced to a problem that has only the knots of the spline as variables. The reduced problem is solved by a generalized Gauss-Newton method. Special emphasise is given to the efficient computation of the residual function and its Jacobian. Dedicated to our colleague and teacher Prof. Dr. J. W. Schmidt on the occasion of his 65th birthday Research of the first author was supported by Deutsche Forschungsgemeinschaft under grant Schm 968/2-1,2-2.     

Geometric construction of quintic parametric B-splines

The aim of this paper is to present a new class of B-spline-like functions with tension properties. The main feature of these basis functions consists in possessing C³$C^3$ or even C⁴$C^4$ continuity and, at the same time, being endowed by shape parameters that can be easily handled. Therefore they constitute a useful tool for the construction of curves satisfying some prescribed shape constraints. The construction is based on a geometric approach which uses parametric curves with piecewise quintic components.     

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.     

Linear best approximation using a class of polyhedral norms

A class of polyhedral norms is introduced, which contains thel ₁ andl norms as special cases. Of primary interest is the solution of linear best approximation problems using these norms. Best approximations are characterized, and an algorithm is developed. This is a methods of descent type which may be interpreted as a generalization of existing well-known methods for solving thel ₁ andl problems. Numerical results are given to illustrate the performance of two variants of the algorithm on some problems.Communicated by C. Brezinski     

An error analysis for absolute and relative approximation

We consider the vectorial algorithm for finding best polynomial approximationsp P _n to a given functionf C[a, b], with respect to the norm · _s , defined byp – f _s =w ₁ (p – f)+w ₂ (p – f) A bound for the modulus of continuity of the best vectorial approximation operator is given, and using the floating point calculus of J. H. Wilkinson, a bound for the rounding error in the algorithm is derived. For givenf, these estimates provide an indication of the conditioning of the problem, an estimate of the obtainable accuracy, and a practical method for terminating the iteration.This paper was supported in part by the Canadian NCR A-8108, FCAC 74-09 and G.E.T.M.A.Part of this research was done during the first-named author's visit to theB! Chair of Applied Mathematics, University of Athens, Spring term, 1975.     

Recurrence relations for a Newton-like method in Banach spaces

The convergence of iterative methods for solving nonlinear operator equations in Banach spaces is established from the convergence of majorizing sequences. An alternative approach is developed to establish this convergence by using recurrence relations. For example, the recurrence relations are used in establishing the convergence of Newton's method [L.B. Rall, Computational Solution of Nonlinear Operator Equations, Robert E. Krieger, New York, 1979] and the third order methods such as Halley's, Chebyshev's and super Halley's [V. Candela, A. Marquina, Recurrence relations for rational cubic methods I: the Halley method, Computing 44 (1990) 169–184; V. Candela, A. Marquina, Recurrence relations for rational cubic methods II: the Halley method, Computing 45 (1990) 355–367; J.A. Ezquerro, M.A. Hernández, Recurrence relations for Chebyshev-type methods, Appl. Math. Optim. 41 (2000) 227–236; J.M. Gutiérrez, M.A. Hernández, Third-order iterative methods for operators with bounded second derivative, J. Comput. Appl. Math. 82 (1997) 171–183; J.M. Gutiérrez, M.A. Hernández, Recurrence relations for the Super–Halley method, Comput. Math. Appl. 7(36) (1998) 1–8; M.A. Hernández, Chebyshev's approximation algorithms and applications, Comput. Math. Appl. 41 (2001) 433–445 [10]].     

Monotonicity and best approximation in Banach lattices

Hudzik and Kurc discussed some best approximation problems in Banach lattices by means of monotonicities. This paper deals with more general best approximation problems in Banach lattices. Existence, uniqueness, stability and continuity for such best approximation problems are discussed.     

Convergence and existence results for best proximity points

We provide a positive answer to a question raised by Eldred and Veeramani [A.A. Eldred, P. Veeramani, Existence and convergence of best proximity points, J. Math. Anal. Appl. 323 (2006) 1001–1006] about the existence of a best proximity point for a cyclic contraction map in a reflexive Banach space. Moreover, we introduce a new class of maps, called cyclic φ$\phi$-contractions, which contains the cyclic contraction maps as a subclass. Convergence and existence results of best proximity points for cyclic φ$\phi$-contraction maps are also obtained.     

On orders of approximation of plane curves by parametric cubic splines

The aim of the present paper is to show that the convergence rate of the parametric cubic spline approximation of a plane curve is of order four instead of order three. For the first and second derivatives, the rates are of order three and two, respectively. Finally some numerical examples are given to illustrate the predicted error behaviour.     

Pseudo-polyharmonic vectorial approximation for div-curl and elastic semi-norms

Vector field reconstruction is a problem arising in many scientific applications. In this paper, we study a div-curl approximation of vector fields by pseudo-polyharmonic splines. This leads to the variational smoothing and interpolating spline problems with minimization of an energy involving the curl and the divergence of the vector field. The relationship between the div-curl energy and elastic energy is established. Some examples are given to illustrate the effectiveness of our approach for a vector field reconstruction.     

The similarity between the best approximation and the best copositive approximation

In this paper the author studies the copositive approximation in C(?) by elements of finite dimensional Chebyshev subspaces in the general case when ? is any totally ordered compact space. He studies the similarity between me behavior of the ordinary best approximation and the behavior pf the copositive best approximation. At the end of this paper, the author isolates many cases at which the two behaviors are the same.     

Some common fixed point theorems for Banach operator pairs with applications in best approximation

The ordered pair (T,I) of two self-maps of a metric space (X,d) is called a Banach operator pair if the set F(I) of fixed points of I is T-invariant i.e. T(F(I))⊆F(I). Some common fixed point theorems for a Banach operator pair and the existence of common fixed points of best approximation are presented in this paper. The results prove, generalize and extend some results of Al-Thagafi [M.A. Al-Thagafi, Common fixed points and best approximation, J. Approx. Theory 85 (1996) 318-323], Carbone [A. Carbone, Applications of fixed point theorems, Jnanabha 19 (1989) 149-155], Chen and Li [J. Chen, Z. Li, Common fixed points for Banach operator pairs in best approximations, J. Math. Anal. Appl. 336 (2007) 1466-1475], Habiniak [L. Habiniak, Fixed point theorems and invariant approximation, J. Approx. Theory 56 (1989) 241-244], Jungck and Sessa [G. Jungck, S. Sessa, Fixed point theorems in best approximation theory, Math. Japon. 42 (1995) 249-252], Sahab, Khan and Sessa [S.A. Sahab, M.S. Khan, S. Sessa, A result in best approximation theory, J. Approx. Theory 55 (1988) 349-351], Shahzad [N. Shahzad, Invariant approximations and R-subweakly commuting maps, J. Math. Anal. Appl. 257 (2001) 39-45] and of few others.