Application of JMN Approximants to Numerical Initial-value Problems in Linear Differential-algebraic Systems

For f: [0,) R, the J_MN approximant of f(t) is where M and N are non-negative integers and ß_k, _i,K_iare defined constants. Under appropriate conditions on f andprovided Re(_i) > 0 The approximants are the bases of recursions for numerical initial-valueproblems in linear differential-algebraic systems with constantcoefficients. The recursions are stable when N M N–2.Each step of a recursion involves mainly the solution of N/2uncoupled algebraic systems.     

Numerical Evaluation of Fourier Integrals

A method is developed for evaluating Fourier integrals of theform A() = ¹_–1f(x) e^fax dx, 0. The method consists of expanding the function f in a seriesof Chebyshev polynomials and expressing the integral A() asa series of the Bessel functionsJ_r+(), r= 0, 1, 2,.... A partialsum A_N() of the series provides an approximant to A(). The principalfeature of the method is that one set of N+1 evaluations off(x) suffices for the calculation of A_N() for all , and alsothe truncation error A()–A_N() is essentially independentof . Numerical tests show that the method is accurate, economicaland reliable. An application to the inversion of Fourier andLaplace transforms is briefly described.     

Well matched systems

The product (3.10) on page 33 is incorrectly called a cartesianproduct on pages 33 and 35. This misnomer in effect amountsto a wrong definition. The product (3.10) should be definedso that the right-hand member of (3.10) is the set of all sums_f=1 f_j (not the set of all ordered q-tuples) such that f₁ F(m₁,d₁), ..., f_q F(m_q, d_q).