Interpolation of analytic functions with finitely many singularities

We consider an interpolation process for the class of functions with finitely many singular points by means of rational functions whose poles coincide with the singular points of the function under interpolation. The interpolation nodes form a triangular matrix. We find necessary and sufficient conditions for the uniform convergence of sequences of interpolation fractions to the function under interpolation on every compact set disjoint from the singular points of the function and other conditions for convergence. We generalize and improve the familiar results on the interpolation of functions with finitely many singular points by rational fractions and of entire functions by polynomials.     

Convergence Conditions for Interpolation Fractions at the Nodes Distinct from the Singular Points of a Function

We consider an interpolation process for the class of functions with finitely many singular points by means of the rational functions whose poles coincide with the singular points of the function under interpolation. The interpolation nodes constitute a triangular matrix and are distinct from the singular points of the function. We find a necessary and sufficient condition for uniform convergence of sequences of interpolation fractions to the function under interpolation on every compact set disjoint from the singular points of the function and other conditions for convergence.Original Russian Text Copyright © 2005 Lipchinskii A. G.__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 822–833, July–August, 2005.     

Local mass conservative Hermite interpolation for the solution of flow problems by a multi-domain boundary element approach

This paper presents a local Hermite radial basis function interpolation scheme for the velocity and pressure fields. The interpolation for velocity satisfies the continuity equation (mass conservative interpolation) while the pressure interpolation obeys the pressure equation. Additionally, the Dual Reciprocity Boundary Element method (DRBEM) is applied to obtain an integral representation of the Navier-Stokes equations. Then, the proposed local interpolation is used to obtain the values of the field variables and their partial derivatives at the boundary of the sub-domains. This interpolation allows one to obtain the boundary values needed for the integral formulas for velocity and pressure at some nodes within the sub-domains. In the proposed approach the boundary elements are merely used to parameterize the geometry, but not for the evaluation of the integrals as it is usually done. The presented multi-domain approach is different from the traditional ones in boundary elements because the resulting integral equations are non singular and the boundary data needed for the boundary integrals are approximated using a local interpolation. Some accurate results for simple Stokes problems and for the Navier-Stokes equations at low Reynolds numbers up to Re = 400 were obtained.     

│x│的有理插值的若干注记

本文中我们构造了一个结点组,基于它定义的有理插值函数,对于任意给定的自然数k,对|x|的逼近能达到精确阶O(1/(n^klogn)).更重要的是,这样的构造揭示了一个本质:当结点向(|x|的唯一奇异点)零点集中时,|x|的有理插值逼近阶也随之更佳,这或许为将来本质性的自然结点组的构造提供了一种思路.     

Numerical solution of singular IVPs of Lane–Emden type using a modified Legendre-spectral method

In this paper, a numerical method for singular initial value problems of the Lane–Emden type in the second-order ordinary differential equations is proposed. The method changes solving the equation to solving a Volterra integral equation. We have applied the improved Legendre-spectral method to solve Lane–Emden type equations. The Legendre Gauss points are used as collocation nodes and Lagrange interpolation is employed in Volterra term. The results reveal that the method is effective, simple and accurate.     

A criterion for the solvability of the multiple interpolation problem by simple partial fractions

Using reduction to polynomial interpolation, we study the multiple interpolation problem by simple partial fractions. Algebraic conditions are obtained for the solvability and the unique solvability of the problem. We introduce the notion of generalized multiple interpolation by simple partial fractions of order ≤ n. The incomplete interpolation problems (i.e., the interpolation problems with the total multiplicity of nodes strictly less than n) are considered; the unimprovable value of the total multiplicity of nodes is found for which the incomplete problem is surely solvable. We obtain an order n differential equation whose solution set coincides with the set of all simple partial fractions of order ≤ n.     

A reliable modification of the cross rule for rational Hermite interpolation

Claessens' cross rule [8] enables simple computation of the values of the rational interpolation table if the table is normal, i.e. if the denominators in the cross rule are non-zero. In the exceptional case of a vanishing denominator a singular block is detected having certain structural properties so that some values are known without further computations. Nevertheless there remain entries which cannot be determined using only the cross rule.In this note we introduce a simple recursive algorithm for computation of the values of neighbours of the singular block. This allows to compute entries in the rational interpolation table along antidiagonals even in the presence of singular blocks. Moreover, in the case of non-square singular blocks, we discuss a facility to monitor the stability.Dedicated to Professor G. Mühlbach on the occasion of his 50th birthday     

An efficient algorithm for periodic Hermite spline interpolation with shifted nodes

Generalized Hermite spline interpolation with periodic splines of defect 2 on an equidistant lattice is considered. Then the classic periodic Hermite spline interpolation with shifted interpolation nodes is obtained as a special case.By means of a new generalization of Euler-Frobenius polynomials the symbol of the considered interpolation problem is defined. Using this symbol, a simple representation of the fundamental splines can be given. Furthermore, an efficient algorithm for the computation of the Hermite spline interpolant is obtained, which is mainly based on the fast Fourier transform.     

An interpolation theorem between one-sided Hardy spaces

In this paper we generalize an interpolation result due to J.-O. Strömberg and A. Torchinsky to the case of one-sided Hardy spaces. This generalization is important in the study of the weak type (1,1) for lateral strongly singular operators. We shall need an atomic decomposition in which for every atom there exists another atom supported contiguously at its right. In order to obtain this decomposition we have developed a rather simple technique to break up an atom into a sum of others atoms.     

On the numerical evaluation of Cauchy transforms

In this paper we consider simple methods for the reconstruction of the Cauchy transform over a curve when an explicit parametrization of the latter is not provided. The methods consist of replacing the parametrization of the curve by piecewise polynomial interpolation followed by the use of Newton-Cotes type formulae for the integration. The order of convergence of the resulting quadrature is higher than would be expected on the basis of considerations involving just interpolation theory, provided that the Cauchy transform is evaluated at known nodes on the curve. These results allow the calculation of the Cauchy transform at other points with the same accuracy if this scheme is followed by an interpolatory formula of sufficiently high accuracy.     

Infinite domain potential problems by a new formulation of singular boundary method

This study proposes a new formulation of singular boundary method (SBM) and documents the first attempt to apply this new method to infinite domain potential problems. The essential issue in the SBM-based methods is to evaluate the origin intensity factor. This paper derives a new regularization technique to evaluate the origin intensity factor on the Neumann boundary condition without the need of sample solution and nodes as in the traditional SBM. We also modify the inverse interpolation technique in the traditional SBM to get rid of the perplexing sample nodes in the calculation of the origin intensity factor on the Dirichlet boundary condition. It is noted that this new SBM retains all merits of the traditional SBM being truly meshless, free of integration, mathematically simple, and easy-to-program without the requirement of a fictitious boundary as in the method of fundamental solutions (MFS). We examine the new SBM by the four benchmark infinite domain problems to verify its applicability, stability, and accuracy.     

On the Lebesgue constant of Berrut’s rational interpolant at equidistant nodes

It is well known that polynomial interpolation at equidistant nodes can give bad approximation results and that rational interpolation is a promising alternative in this setting. In this paper we confirm this observation by proving that the Lebesgue constant of Berrut’s rational interpolant grows only logarithmically in the number of interpolation nodes. Moreover, the numerical results suggest that the Lebesgue constant behaves similarly for interpolation at Chebyshev as well as logarithmically distributed nodes.     

On the Lebesgue constant of Berrut’s rational interpolant at equidistant nodes

It is well known that polynomial interpolation at equidistant nodes can give bad approximation results and that rational interpolation is a promising alternative in this setting. In this paper we confirm this observation by proving that the Lebesgue constant of Berrut’s rational interpolant grows only logarithmically in the number of interpolation nodes. Moreover, the numerical results suggest that the Lebesgue constant behaves similarly for interpolation at Chebyshev as well as logarithmically distributed nodes.     

Interpolation of entire functions with infinitely many nodes

A method is described for the construction of an interpolating entire function for any countable set of interpolation nodes without condensation points in a finite domain, given the values of the function and its derivative at the interpolation nodes.Kiev University. Translated from Vychislitel'naya i Prikladnaya Matematika, No. 75, pp. 26–34, 1991.     

Analysis of the Accuracy of Interpolation of Entire Operators in a Hilbert Space in the Case of Perturbed Nodal Values

In a Hilbert space with Gaussian measure, we obtain an estimate for the accuracy of interpolation of an entire operator in the case where its values are perturbed at nodes and determine the value of the degree of an interpolation polynomial the exceeding of which does not improve the estimate of the accuracy of interpolation.     

Gauss Harmonic Interpolation Formulas for Circular Regions

This paper developes a procedure for computing and tabulatingweights and nodes for a Gauss harmonic interpolation formulawhich allows one to approximate a harmonic function of two variablesat a given interior point of an arbitrary circular region withgiven prescribed values on the boundary. The nodes can be calculatedby finding the Zeros of simple, well-behaved trigonometric polynomial,and each individual weight can be calculated directly by usingexactness properties. Examples are given demonstrating the easeof computation and the accuracy of the formulas.     

A Naimark Dilation Perspective of Nevanlinna-Pick Interpolation

In this paper a positive real tangential Nevanlinna-Pick interpolation problem with interpolation at operator points is solved. The Naimark dilation theorem together with the state space method from systems theory are used to obtain a parameterization for the set of all solutions. Explicit state space formulas are given for both the singular and non-ingular case. In the proofs the solution of an intermediate isometric extension problem plays an important role.     

某些奇异积分方程配置解的高阶“插值”

1 引言 考虑第二类(可以是Fredholm型,也可以是Volterra型)积分方程 (I—K)u(t)=f(t),t∈J=[a,b],(1.1)其中I表恒同算子,K:C(J)→C(J)是一积分算子(可能是非线性的),f∈C(J),我们假定(1.1)有唯一解u∈C(J). 对给定的自然数N,以II_N:a=t_0相似文献   

Lower complexity bounds for interpolation algorithms

We introduce and discuss a new computational model for the Hermite-Lagrange interpolation with nonlinear classes of polynomial interpolants. We distinguish between an interpolation problem and an algorithm that solves it. Our model includes also coalescence phenomena and captures a large variety of known Hermite-Lagrange interpolation problems and algorithms. Like in traditional Hermite-Lagrange interpolation, our model is based on the execution of arithmetic operations (including divisions) in the field where the data (nodes and values) are interpreted and arithmetic operations are counted at unit cost. This leads us to a new view of rational functions and maps defined on arbitrary constructible subsets of complex affine spaces. For this purpose we have to develop new tools in algebraic geometry which themselves are mainly based on Zariski’s Main Theorem and the theory of places (or equivalently: valuations). We finish this paper by exhibiting two examples of Lagrange interpolation problems with nonlinear classes of interpolants, which do not admit efficient interpolation algorithms (one of these interpolation problems requires even an exponential quantity of arithmetic operations in terms of the number of the given nodes in order to represent some of the interpolants).In other words, classic Lagrange interpolation algorithms are asymptotically optimal for the solution of these selected interpolation problems and nothing is gained by allowing interpolation algorithms and classes of interpolants to be nonlinear. We show also that classic Lagrange interpolation algorithms are almost optimal for generic nodes and values. This generic data cannot be substantially compressed by using nonlinear techniques.We finish this paper highlighting the close connection of our complexity results in Hermite-Lagrange interpolation with a modern trend in software engineering: architecture tradeoff analysis methods (ATAM).     

Lagrange插值和Hermite-Fejér插值在Wiener空间下的平均误差

在L_q-范数逼近的意义下,确定了基于Chebyshev多项式零点的Lagrange插值多项式列和Hermite-Fejér插值多项式列在Wiener空间下的p-平均误差的弱渐近阶.从我们的结果可以看出,当2≤q<∞,1≤p<∞时,基于第一类Chebyshev多项式零点的Lagrange插值多项式列和Hermite-Fejér插值多项式列的p-平均误差弱等价于相应的最佳逼近多项式列的p-平均误差.在信息基计算复杂性的意义下,如果可允许信息泛函为计算函数在固定点的值,那么当1≤p,q<∞时,基于第一类Chebyshev多项式零点的Lagrange插值多项式列和Hermite-Fejér插值多项式列在Wiener空间下的p-平均误差弱等价于相应的最小非自适应p-平均信息半径.