On theA 0-acceptability of rational approximations to the exponential function with only real poles

We consider rational approximations to the exponential function with real poles, ₁ ^–1 ,..., _m ^–1 , that correspond to implicit Runge-Kutta collocation methods. We show that if _i 1/2,i=1,...,m, the rational approximation isA ₀-acceptable.     

On the stability of rational approximations to the cosine with only imaginary poles

Letr(z) be a rational approximation to cosz with only imaginary poles ±i ₁ ^–1/2 , ±i ₂ ^–1/2 , ..., ±i _m ^–1/2 such that |cozz –r(z)| C|z|^2m+2 as |z| 0. If the degree of the numerator ofr(z) is less than or equal to 2m and _i m/4,i=1, ...,m, then we show that |r(z)|1 for all realz.     

Error control of rational approximations to the exponential function

Several methods for the numerical solution of stiff ordinary differential equations require approximation of an exponential of a matrix. In the present paper we present a technique for estimating the error incurred in replacing a matrix exponential by a rational approximation. This estimation is done by introducing another approximation, of superior order, whose aposteriori evaluation is cheap. Properties of the new approximation pertaining to both its stability and the behavior of the error for matrices with negative eigenvalues are analyzed.     

Rational exponential approximation with real poles

This paper shows that, in the set of rational functions with real poles there exists a best minimax approximation to the exponential function over the non-negative real axis. This minimax approximation has an equal-ripple property similar to the classical Chebyshev approximation and, under certain conditions, it has a form that could be gainfully exploited in the numerical solutions of heat-conduction type problems.     

A note on a recent result of rational approximations to the exponential function

In a recent paper by Nørsett and Wolfbrandt [1] it is shown that the maximum attainable order ofN-approximationsR _m,n(u) to exp (u) ism + 1. The purpose of this note is to present an alternative proof of this result.     

Real pole approximations to the exponential function

Rational approximations to the exponential function with real, not necessarily distinct poles are studied in this paper. The orthogonality relation is established in order to show that the zeros of the collocation polynomial of the corresponding Runge-Kutta method are all real, simple and positive. It is proven, that approximants with the smallest error constant are the Restricted Padé approximants of Nørsett. Some results concerning acceptability properties are given.This work was supported by RSS, Ljubljana while the author was at Division of Mathematical Sciences, Norwegian Institute of Technology, Trondheim.     

A stability result for general linear methods with characteristic function having real poles only

It is shown that there exist A-stable multistep formulae, with a characteristic function havings poles, all of which are real, with orderp satisfyingp>s+1. This contradicts the widely held belief thatp=s+1 is the maximum possible order of such a method.     

On the simultaneous rational approximations to real and p-adic numbers

Lithuanian Mathematical Journal - We consider simultaneous rational approximations to real and p-adic numbers. We prove that for any irrational number α0 and p-adic number α, there are...     

On the q-Bernstein polynomials of rational functions with real poles

The paper aims to investigate the convergence of the q  -Bernstein polynomials _Bn,q(f;x)$B_{n,q}(f;x)$ attached to rational functions in the case q>1$q>1$. The problem reduces to that for the partial fractions (x−α)^−j${(x-\alpha )}^{-j}$, j∈N$j\in \mathbb{N}$. The already available results deal with cases, where either the pole α   is simple or α≠q^−m$\alpha \ne q^{-m}$, m∈_N0$m\in {\mathbb{N}}_0$. Consequently, the present work is focused on the polynomials _Bn,q(f;x)$B_{n,q}(f;x)$ for the functions of the form f(x)=(x−q^−m)^−j$f(x)={(x-q^{-m})}^{-j}$ with j?2$j?2$. For such functions, it is proved that the interval of convergence of {_Bn,q(f;x)}$\{B_{n,q}(f;x)\}$ depends not only on the location, but also on the multiplicity of the pole – a phenomenon which has not been considered previously.     

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.     

Sums of exponential functions having only real zeros

Let H_n(z) be the function of a complex variable z defined by where the summation is over all 2ⁿ possible plus and minus sign combinations, the same sign combination being used in both the argument of G and in the exponent. The numbers and are assumed to be positive, and G is an entire function of genus 0 or 1 that is real on the real axis and has only real zeros. Then the function H_n(z) has only real zeros.     

On RD‐rational Krylov approximations to the core‐functions of exponential integrators

The paper deals with the application of the restricted‐denominator rational Krylov method, recently discussed in (BIT 2004; 44 (3):595–615; SIAM J. Sci. Comput. 2005; 27 :1438–1457), to the computation of the action of the so‐called φ‐functions, which play a fundamental role in several modern exponential integrators. The analysis here presented is devoted in particular to the construction of error estimates of easy practical use. Copyright © 2007 John Wiley & Sons, Ltd.     

Time-stepping algorithms for semidiscretized linear parabolic PDEs based on rational approximants with distinct real poles

Time dependent problems in Partial Differential Equations (PDEs) are often solved by the Method Of Lines (MOL). For linear parabolic PDEs, the exact solution of the resulting system of first order Ordinary Differential Equations (ODEs) satisfies a recurrence relation involving the matrix exponential function. In this paper, we consider the development of a fourth order rational approximant to the matrix exponential function possessing real and distinct poles which, consequently, readily admits a partial fraction expansion, thereby allowing the distribution of the work in solving the corresponding linear algebraic systems in essentially Backward Euler-like solves on concurrent processors. The resulting parallel algorithm possesses appropriate stability properties, and is implemented on various parabolic PDEs from the literature including the forced heat equation and the advection-diffusion equation.Dedicated to Professor J. Crank on the occasion of his 80th birthday     

On implicit Runge-Kutta methods with a stability function having distinct real poles

Because of their potential for offering a computational speed-up when used on certain multiprocessor computers, implicit Runge-Kutta methods with a stability function having distinct poles are analyzed. These are calledmultiply implicit (MIRK) methods, and because of the so-calledorder reduction phenomenon, their poles are required to be real, i.e., only real MIRK's are considered. Specifically, it is proved that a necessary condition for aq-stage, real MIRK to beA-stable with maximal orderq+1 is thatq=1, 2, 3 or 5. Nevertheless, it is shown that for every positive integerq, there exists aq-stage, real MIRK which is stronglyA ₀-stable with orderq+1, and for every evenq, there is aq-stage, real MIRK which isI-stable with orderq. Finally, some useful examples of algebraically stable real MIRK's are given.This work was supported by the National Aeronautics and Space Administration under NASA Contract No. NAS1-18107 while the author was in residence at the Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA 23665-5225.