Placement of cuts in Padé-like approximation

We propose a method for continuing an analytic function from its power series expansion that enables us to choose the location of cuts joining the branch points. The method is superior to the Padé approximant method in this respect and also because point-wise convergence may be proved.     

非对角二元二次函数逼近的存在性和局部性质

§ 1　IntroductionThis paper is concerned with the properties of the simple off-diagonal bivariatequadratic Hermite-Padé approximation.Thisapproximation may be defined asfollows(see,for example,[1 ] ) .Let f(x,y) be a bivariate function,analytic in some neighbourhood of the origin(0 ,0 ) ,whose series expansion about the origin is known.Let a0 (x,y) ,a1 (x,y) ,a2 (x,y) bebivariate polynomials,a0 (x,y) = ki,j=0 a(0 )ij xiyj,a1 (x,y) = ni,j=0 a(1 )ij xiyj,a2 (x,y) = mi,j=0 a(2 )ij xiyj,such th…     

The modified algorithm for the differential transform method to solution of Genesio systems

In this article, approximate analytical solution of chaotic Genesio system is acquired by the modified differential transform method (MDTM). The differential transform method (DTM) is mentioned in summary. MDTM can be obtained from DTM applied to Laplace, inverse Laplace transform and Padé approximant. The MDTM is used to increase the accuracy and accelerate the convergence rate of truncated series solution getting by the DTM. Results are given with tables and figures.     

Analytic continuation by reproducing kernel methods combined with Padé approximations

The analytic continuation of power series is an old problem attacked by various methods, a notable one being the Padé approximant. Although quite powerful in some cases, the Padé approximant suffers sometimes from being a non-linear transformation. The linearity is useful whenever the coefficients of the Taylor developments are themselves functions of another complex variable. There are well-known linear transformations that improve convergence and their connection with some conformal mapping was discovered long ago, although not always appreciated. The present paper endeavours to extend the applicability of such methods by means of reproducing kernels. A general and flexible analytic continuation method — which does not have the drawback of limiting processes — is outlined, shown to encompass other existing procedures and to be potentially a strong competitor to the Padé approximant. The dynamic polarizability of hydrogen is shown as a numerical example.     

Near-field and far-field approximations by the Adomian and asymptotic decomposition methods

The Adomian decomposition method and the asymptotic decomposition method give the near-field approximate solution and far-field approximate solution, respectively, for linear and nonlinear differential equations. The Padé approximants give solution continuation of series solutions, but the continuation is usually effective only on some finite domain, and it can not always give the asymptotic behavior as the independent variables approach infinity. We investigate the global approximate solution by matching the near-field approximation derived from the Adomian decomposition method with the far-field approximation derived from the asymptotic decomposition method for linear and nonlinear differential equations. For several examples we find that there exists an overlap between the near-field approximation and the far-field approximation, so we can match them to obtain a global approximate solution. For other nonlinear examples where the series solution from the Adomian decomposition method has a finite convergent domain, we can match the Padé approximant of the near-field approximation with the far-field approximation to obtain a global approximate solution representing the true, entire solution over an infinite domain.     

A study on the convergence conditions of generalized differential transform method

This paper deals with constructing generalized ‘fractional’ power series representation for solutions of fractional order differential equations. We present a brief review of generalized Taylor's series and generalized differential transform methods. Then, we study the convergence of fractional power series. Our emphasis is to address the sufficient condition for convergence and to estimate the truncated error. Numerical simulations are performed to estimate maximum absolute truncated error when the generalized differential transform method is used to solve non‐linear differential equations of fractional order. The study highlights the power of the generalized differential transform method as a tool in obtaining fractional power series solutions for differential equations of fractional order. Copyright © 2016 John Wiley & Sons, Ltd.     

Bivariate Thiele-type matrix-valued rational interpolants

A new method for the construction of bivariate matrix-valued rational interpolants on a rectangular grid is introduced in this paper. The rational interpolants are of the continued fraction form, with scalar denominator. In this respect the approach is essentially different from that of Bose and Basu (1980) where a rational matrix-valued approximant with matrix-valued numerator and denominator is used for the approximation of a bivariate matrix power series. The matrix quotients are based on the generalized inverse for a matrix introduced by Gu Chuanqing and Chen Zhibing (1995) which is found to be effective in continued fraction interpolation. A sufficient condition of existence is obtained. Some important conclusions such as characterisation and uniqueness are proven respectfully. The inner connection between two type interpolating functions is investigated. Some examples are given so as to illustrate the results in the paper.     

A Rational Approximant for the Digamma Function

Power series representations for special functions are computationally satisfactory only in the vicinity of the expansion point. Thus, it is an obvious idea to use Padé approximants or other rational functions constructed from sequence transformations instead. However, neither Padé approximants nor sequence transformation utilize the information which is avaliable in the case of a special function – all power series coefficients as well as the truncation errors are explicitly known – in an optimal way. Thus, alternative rational approximants, which can profit from additional information of that kind, would be desirable. It is shown that in this way a rational approximant for the digamma function can be constructed which possesses a transformation error given by an explicitly known series expansion.     

An analysis of two variable rational approximants

We present two determinants whose ratio is the Hughes Jones approximant to a power series in two variables. They are generalizations of Jacobi's determinants for Padé approximants. They are useful in certain circumstances when the defining equations are degenerate. We analyze the indeterminacies associated with degenerate approximants, at least one of which is quite different in nature from the degeneracies of the single variable Padé approximants. We are led to suggest a modification of the symmetrizing equations which leads to numerical stability.     

Computing the Matrix Cosine

An algorithm is developed for computing the matrix cosine, building on a proposal of Serbin and Blalock. The algorithm scales the matrix by a power of 2 to make the -norm less than or equal to 1, evaluates a Padé approximant, and then uses the double angle formula cos(2A)=2cos(A)²–I to recover the cosine of the original matrix. In addition, argument reduction and balancing is used initially to decrease the norm. We give truncation and rounding error analyses to show that an [8,8] Padé approximant produces the cosine of the scaled matrix correct to machine accuracy in IEEE double precision arithmetic, and we show that this Padé approximant can be more efficiently evaluated than a corresponding Taylor series approximation. We also provide error analysis to bound the propagation of errors in the double angle recurrence. Numerical experiments show that our algorithm is competitive in accuracy with the Schur–Parlett method of Davies and Higham, which is designed for general matrix functions, and it is substantially less expensive than that method for matrices of -norm of order 1. The dominant computational kernels in the algorithm are matrix multiplication and solution of a linear system with multiple right-hand sides, so the algorithm is well suited to modern computer architectures.     

On parametric polynomial circle approximation

In the paper, the uniform approximation of a circle arc (or a whole circle) by a parametric polynomial curve is considered. The approximant is obtained in a closed form. It depends on a parameter that should satisfy a particular equation, and it takes only a couple of tangent method steps to compute it. For low degree curves, the parameter is provided exactly. The distance between a circle arc and its approximant asymptotically decreases faster than exponentially as a function of polynomial degree. Additionally, it is shown that the approximant could be applied for a fast evaluation of trigonometric functions too.     

A type of matrix Padé approximant inspired by scalar component models

In this paper we define a type of matrix Padé approximant inspired by the identification stage of multivariate time series models considering scalar component models. Of course, the formalization of certain properties in the matrix Padé approximation framework can be applied to time series models and in other fields. Specifically, we want to study matrix Padé approximants as follows: to find rational representations (or rational approximations) of a matrix formal power series, with both matrix polynomials, numerator and denominator, satisfying three conditions: (a) minimum row degrees for the numerator and denominator, (b) an invertible denominator at the origin, and (c) canonical representation (without free parameters).     

Introduction to the improved functional epsilon algorithm

This paper introduces the improved functional epsilon algorithm. We have defined this new method in principle of the modified Aitken Δ² algorithm. Moreover, we have found that the improved functional epsilon algorithm has remarkable precision of the approximation of the exact solution and there exists a relationship with the integral Padé approximant. The use of the improved functional epsilon algorithm for accelerating the convergence of sequence of functions is demonstrated. The relationship of the improved functional epsilon algorithm with the integral Padé approximant is also demonstrated. Moreover, we illustrate the similarity between the integral Padé approximant and the modified Aitken Δ² algorithm; thus we have shown that the integral Padé approximant is a natural generalisation of modified Aitken Δ² algorithm.     

具有重节点的分段Pade''逼近的一个算法

Baker在[1]中提出了具有重节点的Pade’逼近问题,但提供的算法很繁.我们发现,具有重节点的Pade’逼近和有理切触插值有关.基于这种想法,我们先给出分段Pade’逼近的概念,然后给出一个一般算法.     

An efficient method for solving non-linear singularly perturbed two points boundary-value problems of fractional order

In this paper, we discuss a numerical solution of a class of non-linear fractional singularly perturbed two points boundary-value problem. The method of solution consists of solving reduced problem and boundary layer correction problem. A series method is used to solve the boundary layer correction problem, and then the series solutions is approximated by the Pade’ approximant of order [m, m]. Some theoretical results are established and proved. Two numerical examples are discussed to illustrate the efficiency of the present scheme.     

The convergence of padé approximants and the size of the power series coefficients

Let f be a power series ∑a_izⁱ with complex coefficients. The (n. n) Pade approximant to f is a rational function P/Q where P and Q are polynomials, Q(z) ? 0, of degree ≦ n such that f(z)Q(z)-P(z) = Az²ⁿ⁺¹ + higher degree terms. It is proved that if the coefficients a_i satisfy a certain growth condition, then a corresponding subsequence of the sequence of (n, n) Pade approximants converges to f in the region where the power series f converges, except on an exceptional set E having a certain Hausdorff measure 0. It is also proved that the result is best possible in the sense that we may have divergence on E. In particular,there exists an entire function f such that the sequence of (ny n) Pade approximants diverges everywhere (except at 0)     

改进的微分变换法对不连续冲击波的求解

提出了一种改进的微分变换法,将Padé逼近法与标准微分变换法结合,这种改进的微分变换法主要应用于对冲击波的分析处理方面,能够改善级数的收敛性,并且给出收敛的渐进级数解,甚至精确解,从而为求解强非线性间断问题提供了一种有效的解析方法．     

Optimal Mathematical Models for Nonlinear Dynamical Systems

We propose a new method for the optimal causal representation of nonlinear systems. The proposed approach is based on the best constrained approximation of mappings in probability spaces by operators constructed from matrices of special form so that the approximant preserves the causality property. It is supposed that the observable input is contaminated with noise. The approximant minimises the mean-square difference between a desired output signal and the output signal of the approximating model. The method provides a numerically realisable mathematical model of the system. An analysis is given of the error associated with this representation.     

Reconstruction of Sampled Signals with Fractal Functions

This paper proposes a procedure to build a fractal model for real sampled signals like financial series, climatic data, bioelectric recordings, etc. The mapping constructed owns in general a rich geometric structure. In a first step, the method provides a truncate Chebyshev approximant which performs a low-pass filtering of the signal, displaying in this way the leading cycles of the phenomenon observed. In the second, the polynomial is transformed in a fractal object. The Lipschitz properties of the original signal guarantee a good approximation of the represented variable, whenever the sampling frequency is high enough.     

Extrapolation Algorithms for Filtering Series of Functions,and Treating the Gibbs Phenomenon

In this paper, we study the application of some convergence acceleration methods to Fourier series, to orthogonal series, and, more generally, to series of functions. Sometimes, the convergence of these series is slow and, moreover, they exhibit a Gibbs phenomenon, in particular when the solution or its first derivative has discontinuities. It is possible to circumvent, at least partially, these drawbacks by applying a convergence acceleration method (in particular, the -algorithm) or by approximating the series by a rational function (in particular, a Padé approximant). These issues are discussed and some numerical results are presented. We will see that adding its conjugate series as an imaginary part to a Fourier series greatly improves the efficiency of the algorithms for accelerating the convergence of the series and reducing the Gibbs phenomenon. Conjugacy for series of functions will also be considered.