有理曲线的多项式逼近

利用曲线摄动的思想给出了用多项式曲线逼近有理曲线的一种新方法．其基本步骤是对有理曲线的控制顶点进行摄动，使之产生一多项式曲线，并使摄动误差在某种范数意义之下达到最小．同时，通过适当控制摄动曲线的顶点，使逼近多项式曲线与有理曲线在两端点保持一定的连续性．这一结果可以与细分（ｓｕｂｄｉｖｉｓｉｏｎ）技术结合给出有理曲线的整体光滑的分片多项式逼近．实例表明，在某些情况下本文中的方法要优于传统的Ｈｅｒｍｉｔｅ插值方法及Ｔ．Ｗ．Ｓｅｄｅｒｂｅｒｇ和Ｍ．Ｋａｋｉｍｏｔｏ（１９９１）提出的杂交曲线逼近算法．     

累积两点信息的有理逼近RALND的改进

文献[1l提出了分子分母皆为线性函数的多元有理逼近(Rational Approximation with Linear Numerator and Denominator,RALND),满意地求了非线性方程组的解和数学规划最优解,为了克服RALND的不足,使之更好地发挥作用,本文试图改进该逼近:(1)提出了更合理地筛选有理逼近解的方法;(2)证明了该逼近的单调性;(3)对于原函数在当前点与前次迭代点连线方向上方向导数符号相反的情况,分别提出了迭代求有理逼近和构造在当前点与估算点连线方向上相应的方向导数符号相同的近似有理逼近的方法;(4)提出了一个非单调的有理逼近函数;(5)通过数值计算验证了本文提出的有理逼近是有效和可行的.     

Null space correction and adaptive model order reduction in multi-frequency Maxwell’s problem

A model order reduction method is developed for an operator with a non-empty null-space and applied to numerical solution of a forward multi-frequency eddy current problem using a rational interpolation of the transfer function in the complex plane. The equation is decomposed into the part in the null space of the operator, calculated exactly, and the part orthogonal to it which is approximated on a low-dimensional rational Krylov subspace. For the Maxwell’s equations the null space is related to the null space of the curl. The proposed null space correction is related to divergence correction and uses the Helmholtz decomposition. In the case of the finite element discretization with the edge elements, it is accomplished by solving the Poisson equation on the nodal elements of the same grid. To construct the low-dimensional approximation we adaptively choose the interpolating frequencies, defining the rational Krylov subspace, to reduce the maximal approximation error. We prove that in the case of an adaptive choice of shifts, the matrix spanning the approximation subspace can never become rank deficient. The efficiency of the developed approach is demonstrated by applying it to the magnetotelluric problem, which is a geophysical electromagnetic remote sensing method used in mineral, geothermal, and groundwater exploration. Numerical tests show an excellent performance of the proposed methods characterized by a significant reduction of the computational time without a loss of accuracy. The null space correction regularizes the otherwise ill-posed interpolation problem.     

Discrete linearized least-squares rational approximation on the unit circle

We already generalized the Rutishauser—Gragg—Harrod—Reichel algorithm for discrete least-squares polynomial approximation on the real axis to the rational case. In this paper, a new method for discrete least-squares linearized rational approximation on the unit circle is presented. It generalizes the algorithms of Reichel—Ammar—Gragg for discrete least-squares polynomial approximation on the unit circle to the rationale case. The algorithm is fast in the sense that it requires order m computation time where m is the number of data points and is the degree of the approximant. We describe how this algorithm can be implemented in parallel. Examples illustrate the numerical behavior of the algorithm.     

Discrete l1 Approximation by Rational Functions

The problem of finding a best approximation by a rational functionto discrete data, using the l₁ norm, is considered. An algorithmis developed which is frequently convergent in a finite numberof steps, and failing this usually has a second-order convergencerate. Details are given of the application of the algorithmto a number of rational approximation problems.     

Jacobi rational approximation and spectral method for differential equations of degenerate type

We introduce an orthogonal system on the half line, induced by Jacobi polynomials. Some results on the Jacobi rational approximation are established, which play important roles in designing and analyzing the Jacobi rational spectral method for various differential equations, with the coefficients degenerating at certain points and growing up at infinity. The Jacobi rational spectral method is proposed for a model problem appearing frequently in finance. Its convergence is proved. Numerical results demonstrate the efficiency of this new approach.

     

A multivariate QD-like algorithm

The problem of constructing a univariate rational interpolant or Padé approximant for given data can be solved in various equivalent ways: one can compute the explicit solution of the system of interpolation or approximation conditions, or one can start a recursive algorithm, or one can obtain the rational function as the convergent of an interpolating or corresponding continued fraction.In case of multivariate functions general order systems of interpolation conditions for a multivariate rational interpolant and general order systems of approximation conditions for a multivariate Padé approximant were respectively solved in [6] and [9]. Equivalent recursive computation schemes were given in [3] for the rational interpolation case and in [5] for the Padé approximation case. At that moment we stated that the next step was to write the general order rational interpolants and Padé approximants as the convergent of a multivariate continued fraction so that the univariate equivalence of the three main defining techniques was also established for the multivariate case: algebraic relations, recurrence relations, continued fractions. In this paper a multivariate qd-like algorithm is developed that serves this purpose.     

A robust implementation of the Carathéodory-Fejér method for rational approximation

Best rational approximations are notoriously difficult to compute. However, the difference between the best rational approximation to a function and its Carathéodory-Fejér (CF) approximation is often so small as to be negligible in practice, while CF approximations are far easier to compute. We present a robust and fast implementation of this method in the Chebfun software system and illustrate its use with several examples. Our implementation handles both polynomial and rational approximation and substantially improves upon earlier published software.     

Legendre rational approximation on the whole line

The Legendre rational approximation is investigated. Some approximation results are established, which form the mathematical foundation of a new spectral method on the whole line. A model problem is considered. Numerical results show the efficiency of this new approach.     

有理曲线和曲面的分片多项式逼近

本文利用摄动的思想,以摄动有理曲线（曲面）的系数的无穷模作为优化目标,给出了用多项式曲线（曲面）逼近有理曲线（曲面）的一种新方法．同以前的各种方法相比,该方法不仅收敛而且具有更快的收敛速度,并且可以与细分技术相结合,得到有理曲线与曲面的整体光滑、分片多项式的逼近．     

Legendre rational approximation on the whole line

The Legendre rational approximation is investigated. Some approximation results are established, which form the mathematical foundation of a new spectral method on the whole line. A model problem is considered. Numerical results show the efficiency of this new approach.     

三元重心Thiele型混合有理插值

有理插值比多项式插值有更好的近似,但有理插值一般很难控制极点的产生.基于Thiele型连分式插值与重心有理插值,构造三元重心Thiele型混合有理插值,当选取适当的权后能避免部分极点的产生.文章最后通过数值例子验证了这种方法的正确性和有效性.     

A rational approximate solution for generalized pantograph‐delay differential equations

In this paper, a new rational approximation based on a rational interpolation and collocation method is proposed for the solutions of generalized pantograph equations. A comprehensive error analysis is provided. The first part of the error analysis gives an upper bound for the absolute error. The second part is based on residual error procedure that estimates the absolute error. Some numerical examples are given to illustrate the method. The theoretical results support the numerical results. Copyright © 2015 John Wiley & Sons, Ltd.     

On the Lebesgue constant of barycentric rational interpolation at equidistant nodes

Recent results reveal that the family of barycentric rational interpolants introduced by Floater and Hormann is very well-suited for the approximation of functions as well as their derivatives, integrals and primitives. Especially in the case of equidistant interpolation nodes, these infinitely smooth interpolants offer a much better choice than their polynomial analogue. A natural and important question concerns the condition of this rational approximation method. In this paper we extend a recent study of the Lebesgue function and constant associated with Berrut’s rational interpolant at equidistant nodes to the family of Floater–Hormann interpolants, which includes the former as a special case.     

A fast numerical algorithm for the integration of rational functions

A new iterative method for high-precision numerical integration of rational functions on the real line is presented. The algorithm transforms the rational integrand into a new rational function preserving the integral on the line. The coefficients of the new function are explicit polynomials in the original ones. These transformations depend on the degree of the input and the desired order of the method. Both parameters are arbitrary. The formulas can be precomputed. Iteration yields an approximation of the desired integral with mth order convergence. Examples illustrating the automatic generation of these formulas and the numerical behaviour of this method are given.     

|x|α(1≤α<2)在改进的正切节点组的有理逼近

本文研究了|x|α在改进的正切结点组的有理逼近的问题.利用改变结点的方法,获得其逼近阶为O(1/n^4α)的结果.推广了一些学者在正切结点组下的研究的逼近阶,而且优于等距结点组、第一和第二类Chebyshev结点组的结果.     

A new linearized method for Benjamin‐Bona‐Mahony equations

In this article, a new method called linearized and rational approximation method based on differential quadrature method (DQM) is proposed for the Benjamin‐Bona‐Mahony (BBM) equation on a semi‐infinite interval. Numerical result indicates the high accuracy and relatively little computational effort of this method. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2004     

Approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces

An attractive method for approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces is introduced. The main result is that the arbitrary given order derived vectors of a polynomial triangular surface converge uniformly to those of the approximated rational triangular Bézier surface as the elevated degree tends to infinity. The polynomial triangular surface is constructed as follows. Firstly, we elevate the degree of the approximated rational triangular Bézier surface, then a polynomial triangular Bézier surface is produced, which has the same order and new control points of the degree-elevated rational surface. The approximation method has theoretical significance and application value: it solves two shortcomings-fussy expression and uninsured convergence of the approximation-of Hybrid algorithms for rational polynomial curves and surfaces approximation.     

On the efficient evaluation of ruin probabilities for completely monotone claim distributions

In this paper we propose a highly accurate approximation procedure for ruin probabilities in the classical collective risk model, which is based on a quadrature/rational approximation procedure proposed in [2]. For a certain class of claim size distributions (which contains the completely monotone distributions) we give a theoretical justification for the method. We also show that under weaker assumptions on the claim size distribution, the method may still perform reasonably well in some cases. This in particular provides an efficient alternative to a related method proposed in [3]. A number of numerical illustrations for the performance of this procedure is provided for both completely monotone and other types of random variables.     

Reliably computing all characteristic roots of delay differential equations in a given right half plane using a spectral method

Spectral discretization methods are well established methods for the computation of characteristic roots of time-delay systems. In this paper a method is presented for computing all characteristic roots in a given right half plane. In particular, a procedure for the automatic selection of the number of discretization points is described. This procedure is grounded in the connection between a spectral discretization and a rational approximation of exponential functions. First, a region that contains all desired characteristic roots is estimated. Second, the number of discretization points is selected in such a way that in this region the rational approximation of the exponential functions is accurate. Finally, the characteristic roots approximations, obtained from solving the discretized eigenvalue problem, are corrected up to the desired precision by a local method. The effectiveness and robustness of the procedure are illustrated with several examples and compared with DDE-BIFTOOL.