Quadratic Hermite–Padé polynomials associated with the exponential function

The asymptotic behavior of quadratic Hermite–Padé polynomials associated with the exponential function is studied for n→∞. These polynomials are defined by the relation

(*)

p_n(z)+q_n(z)e^z+r_n(z)e^2z=O(z³ⁿ⁺²) as z→0,

where O(·) denotes Landau's symbol. In the investigation analytic expressions are proved for the asymptotics of the polynomials, for the asymptotics of the remainder term in (*), and also for the arcs on which the zeros of the polynomials and of the remainder term cluster if the independent variable z is rescaled in an appropriate way. The asymptotic expressions are defined with the help of an algebraic function of third degree and its associated Riemann surface. Among other possible applications, the results form the basis for the investigation of the convergence of quadratic Hermite–Padé approximants, which will be done in a follow-up paper.     

A class of multi‐step difference schemes by using Padé approximant

In this paper, we present a method for the construction of a class of multi‐step finite differences schemes for solving arbitrary order linear two‐point boundary value problems. The construction technique is based on Padé approximant. It is easy to derive multi‐step difference schemes, and it includes many existing schemes as its special cases. Numerical experiments show that the proposed schemes are flexible and convergent. Copyright © 2013 John Wiley & Sons, Ltd.     

B-splines and Hermite–Padé approximants to the exponential function

This paper is the continuation of a work initiated in [P. Sablonnière, An algorithm for the computation of Hermite–Padé approximations to the exponential function: divided differences and Hermite–Padé forms. Numer. Algorithms 33 (2003) 443–452] about the computation of Hermite–Padé forms (HPF) and associated Hermite–Padé approximants (HPA) to the exponential function. We present an alternative algorithm for their computation, based on the representation of HPF in terms of integral remainders with B-splines as Peano kernels. Using the good properties of discrete B-splines, this algorithm gives rise to a great variety of representations of HPF of higher orders in terms of HPF of lower orders, and in particular of classical Padé forms. We give some examples illustrating this algorithm, in particular, another way of constructing quadratic HPF already described by different authors. Finally, we briefly study a family of cubic HPF.     

Scalar and matrix Riemann–Hilbert approach to the strong asymptotics of Padé approximants and complex orthogonal polynomials with varying weight

We describe methods for the derivation of strong asymptotics for the denominator polynomials and the remainder of Padé approximants for a Markov function with a complex and varying weight. Two approaches, both based on a Riemann–Hilbert problem, are presented. The first method uses a scalar Riemann–Hilbert boundary value problem on a two-sheeted Riemann surface, the second approach uses a matrix Riemann–Hilbert problem. The result for a varying weight is not with the most general conditions possible, but the loss of generality is compensated by an easier and transparent proof.     

A family of high order iterations for calculating the sign of a matrix

For the computation of a matrix sign function, a family of iterative methods is proposed. for some cases of the accelerator parameters, this method is proven to converge globally with higher rates of convergence. Its stability is discussed analytically as well. to illustrate the efficiency of the proposed methods from the family, several tests of various matrix sizes are considered to worked out.     

High‐order Padé and singly diagonally Runge‐Kutta schemes for linear ODEs,application to wave propagation problems

In this article, we address the problem of constructing high‐order implicit time schemes for wave equations. We consider two classes of one‐step A‐stable schemes adapted to linear Ordinary Differential Equation (ODE). The first class, which is not dissipative is based on the diagonal Padé approximant of exponential function. For this class, the obtained schemes have the same stability function as Gauss Runge‐Kutta (Gauss RK) schemes. They have the advantage to involve the solution of smaller linear systems at each time step compared to Gauss RK. The second class of schemes are constructed such that they require the inversion of a unique linear system several times at each time step like the Singly Diagonally Runge‐Kutta (SDIRK) schemes. While the first class of schemes is constructed for an arbitrary order of accuracy, the second‐class schemes is given up to order 12. The performance assessment we provide shows a very good level of accuracy for both classes of schemes, and the great interest of considering high‐order time schemes that are faster. The diagonal Padé schemes seem to be more accurate and more robust.     

Analytic approximation of the blow‐up time for nonlinear differential equations by the ADM–Padé technique

We present a new approach to calculate analytic approximations of blow‐up solutions and their critical blow‐up times. Our approach applies the Adomian decomposition–Padé method to quickly and easily compute the critical blow‐up times, which comprises the Adomian decomposition method combined with the Padé approximants technique. We validate our new approach with a variety of numerical examples, including nonlinear ODEs, systems of nonlinear ODEs, and nonlinear PDEs. Furthermore, our new method is shown to be more convenient than prior art that relies on compound discretized algorithms. Copyright © 2013 John Wiley & Sons, Ltd.     

On a new family of high‐order iterative methods for the matrix pth root

The main goal of this paper is to approximate the principal pth root of a matrix by using a family of high‐order iterative methods. We analyse the semi‐local convergence and the speed of convergence of these methods. Concerning stability, it is well known that even the simplified Newton method is unstable. Despite it, we present stable versions of our family of algorithms. We test numerically the methods: we check the numerical robustness and stability by considering matrices that are close to be singular and badly conditioned. We find algorithms of the family with better numerical behavior than the Newton and the Halley methods. These two algorithms are basically the iterative methods proposed in the literature to solve this problem. Copyright © 2015 John Wiley & Sons, Ltd.     

Simultaneous approximation for the Bézier variant of Baskakov-Beta operators

In the present paper, we study the rate of convergence in simultaneous approximation for the Bézier variant of the Baskakov-Beta operators by using the decomposition technique of functions of bounded variation.     

Solution of a multiple Nevanlinna–Pick problem for Carathéodory functions via orthogonal rational functions in the matrix case

We consider an interpolation problem of Nevanlinna–Pick type for matrix‐valued Carathéodory functions, where the values of the functions and its derivatives up to certain orders are given at finitely many points of the open unit disk. For the non‐degenerate case, i.e., in the particular situation that a specific block matrix (which is formed by the given data in the problem) is positive Hermitian, the solution set of this problem is described in terms of orthogonal rational matrix‐valued functions. These rational matrix functions play here a similar role as Szegő's orthogonal polynomials on the unit circle in the classical case of the trigonometric moment problem. In particular, we present and use a connection between Szegő and Schur parameters for orthogonal rational matrix‐valued functions which in the primary situation of orthogonal polynomials was found by Geronimus. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A combined finite volume–finite element scheme for the discretization of strongly nonlinear convection–diffusion–reaction problems on nonmatching grids

We propose and analyze in this paper a numerical scheme for nonlinear degenerate parabolic convection–diffusion–reaction equations in two or three space dimensions. We discretize the time evolution, convection, reaction, and source terms on a given grid, which can be nonmatching and can contain nonconvex elements, by means of the cell‐centered finite volume method. To discretize the diffusion term, we construct a conforming simplicial mesh with the vertices given by the original grid and use the conforming piecewise linear finite element method. In this way, the scheme is fully consistent and the discrete solution is naturally continuous across the interfaces between the subdomains with nonmatching grids, without introducing any supplementary equations and unknowns or using any interpolation at the interfaces. We allow for general inhomogeneous and anisotropic diffusion–dispersion tensors, propose two variants corresponding respectively to arithmetic and harmonic averaging, and use the local Péclet upstream weighting in order to only add the minimal numerical diffusion necessary to avoid spurious oscillations in the convection‐dominated case. The scheme is robust, efficient since it leads to positive definite matrices and one unknown per element, locally conservative, and satisfies the discrete maximum principle under the conditions on the simplicial mesh and the diffusion tensor usual in the finite element method. We prove its convergence using a priori estimates and the Kolmogorov relative compactness theorem and illustrate its behavior on a numerical experiment. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010