Chebyshev approximations in subspaces of spline functions

The main purpose of this paper is to consider strict approximations from subspaces of spline functions of degree m-1 with k fixed knots. Rice defines the strict approximation which is a particular unique best Chebyshev approximation for problems defined on a finite set. In order to determine best approximations on an interval I we define a sequence of strict approximations on finite subsets of I where the subsets fill up the interval. It is shown that the sequences always converge if k≤m. In the case k>m the sequences are convergent if we restrict ourselves to problems defined on certain subsets of I. It seems to be natural to denote these limits as strict approximations. To be able to compute these functions we also develop a Remez type algorithm.     

On the Problem of Best Rational Approximation with Interpolating Constraints (I)

The aim of this conjoint paper is to discuss the problem of the best rational approximation with interpolating constraints. In part I, we give the necessary and sufficient conditions for the existence of the best rational approximations and establish some characterization theorem for such approximations. The problems of uniqueness, the properties for the set of best approximations, strong uniqueness and continuity of best approximation operator are considered in Part II. The results obtained in this paper are the completion and extension of those given in [1].     

Zur Theorie der nichtlinearen Tschebyscheff-Approximation mit Nebenbedingungen

This paper deals with questions of nonlinear Tschebyscheff-approximation theory, the approximations being constrained by nonlinear relations. We assume the approximating functions depending Fréchet-differentiable on a parameter and the constraints satisfying certain regularity and differentiability properties. Under these hypotheses in the main theorem we give necessary conditions to characterisize best approximations. Using these results, some problems in approximating functions, the best approximations being regarded to satisfy interpolatory conditions, are discussed. We deduce, that in this case best approximations admit a characterisation by generalized alternants.

---

---

Erster Teil einer gekürzten Fassung der Dissertation des Verfassers [1968].     

关于最佳局部逼近

The purpose of this paper is to introduce certain aspects concerning the problem of best local approximations. Especially in multipoint best local approximation, there are many intuitively quite clear yet unsolved interesting problems. We will discuss some recent results and some unsolved problems.     

Best Chebyshev approximation from families of ordinary differential equations

Within the framework of the Meinardus and Schwedt theory ofnonlinear Chebyshev approximation we consider the approximationof functions and data by approximants generated from the solutionof parameter dependent initial value problems in ordinary differentialequations. New results are obtained for the uniqueness and characterizationof best approximations in terms of properties of the differentialequation. Some examples of new approximating families are givenalong with computed best approximations.     

On certain order constrained Chebyshev rational approximations

Some rational approximations which share the properties of Padé and best uniform approximations are considered. The approximations are best in the Chebyshev sense, but the optimization is performed over subsets of the rational functions which have specified derivatives at one end point of the approximation interval. Explicit relationships between the Padé and uniform approximations are developed assuming the function being approximated satisfies easily verified constraints. The results are applied to the exponential function to determine the existence of best uniform A-acceptable approximations.     

Optimality conditions in nondifferentiable programming and their applications to best approximations

This paper studies constrained optimization problems in Banach spaces without usual differentiability and convexity assumptions on the functionals involved in the data. The aim is to give optimality conditions for the problems from which one can derive the characterization of best approximations. The objective and the inequality constraint functionals are assumed to have one-sided directional derivatives. First-order necessary conditions are given in terms of subdifferentials of the directional derivatives. The notion of max-pseudoconvexity weaker than pseudoconvexity is introduced for sufficiency. The optimality conditions are applied to linear and nonlinear Tchebycheff approximation problems to derive the characterization of best approximations.     

Rational approximation of maximal commutative subgroups of $${GL(n,\mathbb{R})}$$

How to find “best rational approximations” of maximal commutative subgroups of \({GL(n,\mathbb{R})}\)? In this paper we specify this problem and make first steps in its study. It contains the classical problems of Diophantine and simultaneous approximation as particular subcases but in general is much wider. We prove estimates for n = 2 for both totally real and complex cases and give an algorithm to construct best approximations of a fixed size. In addition we introduce a relation between best approximations and sails of cones and interpret the result for totally real subgroups in geometric terms of sails.     

Termination Criteria for Linear Problems

We study two termination criteria which are used in computational practice. They are analyzed for linear problems in the average case setting. It is assumed that arbitrary continuous linear functionals can be computed and consecutive approximations are chosen in the best possible way. The first termination criterion is satisfied if the difference between two consecutive approximations becomes less than a certain bound τ. We prove that the first termination criterion gives satisfactory results only for some cases. The second termination criterion is satisfied if two consecutive differences between consecutive approximations become less than τ. We prove that the second termination criterion gives satisfactory results for all cases.     

非唯一的有理L_p逼近

设f∈L_p\R_m~1,p≥1。如果f在R_m~1中有无穷多个最佳逼近,则这些最佳逼近必有一致收敛的子序列,并且其极限函数也是f的最佳逼近。如果f在R_m~1中的最佳逼近都是非退化的临界点,则这些最佳逼近仅有有限个。f在R_m~1中的形如P_1(x)/(1-λx)~n的最佳逼近仅有有限个。     

Extremal problems for numerical series

In this paper, we consider extremal problems for numerical positive series. The terms of these series are pairwise products of the elements of two sequences, one of which is fixed and the other varies within a given set of sequences. We obtain exact solutions for a number of such problems. As one of the possible applications of the results obtained, we find solutions of some extremal problems related to best n-term approximations of periodic functions.     

On vector valued function approximation using a peak norm

A peak norm is defined for L_p spaces of E-valued Bochner integrable functions, where E is a Banach space, and best approximations from a sun to elements of the space are characterized. Applications are given to some families of simultaneous best approximation problems.     

Corrected Collocation Approximations for the Harmonic Dirichlet Problem

Collocation approximations with harmonic basis functions tothe solution of the harmonic Dirichlet problem are investigated.The choice of collocation points for a best local approximationis discussed, and a result is given in terms of the abscissaeof some best quadrature formulae. A global near-best approximationis obtained by adding a correction term to the collocation approximation,utilizing basic properties of the Green's function. Numericalexamples are given, demonstrating the great improvement achieved.The same correction term can also improve on least-squares approximationsand Galerkin approximations, and the results can easily be adaptedto deal with mixed harmonic boundary value problems.     

A class of multidimensional periodic splines

Periodic spline functions are introduced by use of reproducing kernel structure in Hilbert spaces. Minimum properties are described in interpolation and best approximation problems. A numerical method for determining interpolating splines and best approximations is proposed.Dedicated to Prof. Dr. F. Reutter on the occasion of his 70th birthday     

Interpolation and Approximation by Splines on [0, ∞ )

We investigate interpolation and approximation problems by splines, which possess a countable set of knots on the positive axis. In particular, we characterize those sets of points, which admit unique Lagrange interpolation and give some sufficient and some necessary conditions for best approximations. Moreover, we show that the classical results of spline-approximation theory are not available for splines with a countable set of knots.     

Functions with prescribed best linear approximations

A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In the present paper we study the question of the existence of solutions to such problems. A finite family of subspaces is said to satisfy the Inverse Best Approximation Property (IBAP) if there exists a point that admits any selection of points from these subspaces as best approximations. We provide various characterizations of the IBAP in terms of the geometry of the subspaces. Connections between the IBAP and the linear convergence rate of the periodic projection algorithm for solving the underlying affine feasibility problem are also established. The results are applied to investigate problems in harmonic analysis, integral equations, signal theory, and wavelet frames.     

最优分段逼近的几个迭代算法及其收敛性

本文给出了最优分段逼近的几类迭代算法,并从理论上证明它们对于任意初始条件都收敛到唯一的最优逼近.在电子计算机上进行了计算,表明效果良好.文末给出一些数值例子.     

Characterization of strict approximations in subspaces of spline functions

The problem of approximating a given function by spline functions with fixed knots is discussed. Strict approximations which are particular unique best Chebyshev approximations are considered. The chief purpose is to develop a characterization theorem for these strict approximations.     

An algorithm for the computation of strict approximations in subspaces of spline functions

The problem of approximating a given function by spline functions with fixed knots is discussed. Strict approximations which are particular unique best Chebyshev approximations are considered. The chief purpose is to develop a characterization theorem for these strict approximations.     

The Usual Behavior of Rational Approximation, II

The speeds of convergence of best rational approximations, best polynomial approximations, and the modulus of continuity on the unit disc are compared. We show that, in a Baire category sense, it is expected that subsequences of these approximants will converge at the same rate. Similar problems on the interval [−1, 1] are also examined. A problem raised by P. Turán (J. Approx. Theory29, 1980, 23-89) concerning rational approximation to non-analytically continuable ƒ on the unit circle is negated as an application.