Quadrature formulas for Fourier coefficients

We consider quadrature formulas of high degree of precision for the computation of the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials. In particular, we show the uniqueness of a multiple node formula for the Fourier-Tchebycheff coefficients given by Micchelli and Sharma and construct new Gaussian formulas for the Fourier coefficients of a function, based on the values of the function and its derivatives.     

Quadrature formulas for oscillatory integral transforms

Summary Quadrature formulas are obtained for the Fourier and Bessel transforms which correspond to the well-known Gauss-Laguerre formula for the Laplace transform. These formulas provide effective asymptotic approximations, complete with error bounds. Comparison is also made between the quadrature formulas and the asymptotic expansions of these transforms.This research was supported in part by the Natural Sciences and Engineering Research Council of Canada under Contract A7359     

Algorithms for spline wavelet packets on an interval

The aim of this paper is to describe decomposition and reconstruction algorithms for spline wavelet packets on a closed interval. In order to generate packet spaces of dyadic dimensions, it is necessary to modify the approach for spline wavelets on an interval as studied by Chui, Quak and Weyrich in [3, 11]. The first author was supported by the Department of the Air Force, contract F33600-94-M-2603, and the second author by the Department of Defense, contract H98230-R5-93-9187.     

Cubature rule associated with a discrete blending sum of quadratic spline quasi-interpolants

A new cubature rule for a parallelepiped domain is defined by integrating a discrete blending sum of C¹ quadratic spline quasi-interpolants in one and two variables. We give the weights and the nodes of this cubature rule and we study the associated error estimates for smooth functions. We compare our method with cubature rules based on the tensor products of spline quadratures and classical composite Simpson’s rules.     

Jacobi matrices for sums of weight functions

Orthogonal polynomials are conveniently represented by the tridiagonal Jacobi matrix of coefficients of the recurrence relation which they satisfy. LetJ ₁ andJ ₂ be finite Jacobi matrices for the weight functionsw ₁ andw ₂, resp. Is it possible to determine a Jacobi matrix \(\tilde J\) , corresponding to the weight functions \(\tilde w\) =w ₁+w ₂ using onlyJ ₁ andJ ₂ and if so, what can be said about its dimension? Thus, it is important to clarify the connection between a finite Jacobi matrix and its corresponding weight function(s). This leads to the need for stable numerical processes that evaluate such matrices. Three newO(n ²) methods are derived that “merge” Jacobi matrices directly without using any information about the corresponding weight functions. The first can be implemented using any of the updating techniques developed earlier by the authors. The second new method, based on rotations, is the most stable. The third new method is closely related to the modified Chebyshev algorithm and, although it is the most economical of the three, suffers from instability for certain kinds of data. The concepts and the methods are illustrated by small numerical examples, the algorithms are outlined and the results of numerical tests are reported.     

The completeness of a polynomial vector field is determined by a transcendental trajectory

We prove that every polynomial vector field on C² that is complete on a transcendental (proper and non-algebraic) trajectory is complete in C².     

Error estimates of anti-Gaussian quadrature formulae

Anti-Gauss quadrature formulae associated with four classical Chebyshev weight functions are considered. Complex-variable methods are used to obtain expansions of the error in anti-Gaussian quadrature formulae over the interval [−1,1]$[-1,1]$. The kernel of the remainder term in anti-Gaussian quadrature formulae is analyzed. The location on the elliptic contours where the modulus of the kernel attains its maximum value is investigated. This leads to effective L^∞$L^{\infty }$-error bounds of anti-Gauss quadratures. Moreover, the effective L¹$L^1$-error estimates are also derived. The results obtained here are an analogue of some results of Gautschi and Varga (1983) [11], Gautschi et al. (1990) [9] and Hunter (1995) [10] concerning Gaussian quadratures.     

Error bounds of certain Gaussian quadrature formulae

We study the kernel of the remainder term of Gauss quadrature rules for analytic functions with respect to one class of Bernstein-Szegö weight functions. The location on the elliptic contours where the modulus of the kernel attains its maximum value is investigated. This leads to effective error bounds of the corresponding Gauss quadratures.     

On the remainder term of Gauss–Radau quadratures for analytic functions

For analytic functions the remainder term of Gauss–Radau quadrature formulae can be represented as a contour integral with a complex kernel. We study the kernel on elliptic contours with foci at the points ±1$\pm 1$ and a sum of semi-axes ?>1$?>1$ for the Chebyshev weight function of the second kind. Starting from explicit expressions of the corresponding kernels the location of their maximum modulus on ellipses is determined. The corresponding Gautschi's conjecture from [On the remainder term for analytic functions of Gauss–Lobatto and Gauss–Radau quadratures, Rocky Mountain J. Math. 21 (1991), 209–226] is proved.     

Error estimates for Gaussian quadratures of analytic functions

For analytic functions the remainder term of Gaussian quadrature formula and its Kronrod extension can be represented as a contour integral with a complex kernel. We study these kernels on elliptic contours with foci at the points ±1 and the sum of semi-axes ?>1 for the Chebyshev weight functions of the first, second and third kind, and derive representation of their difference. Using this representation and following Kronrod’s method of obtaining a practical error estimate in numerical integration, we derive new error estimates for Gaussian quadratures.     

Gaussian rational quadrature formulas for ill-scaled integrands

A flexible treatment of Gaussian quadrature formulas based on rational functions is given to evaluate the integral , when f is meromorphic in a neighborhood V of the interval I and W(x) is an ill-scaled weight function. Some numerical tests illustrate the power of this approach in comparison with Gautschi’s method.     

A one-step 7-stage Hermite-Birkhoff-Taylor ODE solver of order 11

A one-step 7-stage Hermite-Birkhoff-Taylor method of order 11, denoted by HBT(11)7, is constructed for solving nonstiff first-order initial value problems y^′=f(t,y), y(t₀)=y₀. The method adds the derivatives y^′ to y⁽⁶⁾, used in Taylor methods, to a 7-stage Runge-Kutta method of order 6. Forcing an expansion of the numerical solution to agree with a Taylor expansion of the true solution to order 11 leads to Taylor- and Runge-Kutta-type order conditions. These conditions are reorganized into Vandermonde-type linear systems whose solutions are the coefficients of the method. The new method has a larger scaled interval of absolute stability than the Dormand-Prince DP87 and a larger unscaled interval of absolute stability than the Taylor method, T11, of order 11. HBT(11)7 is superior to DP87 and T11 in solving several problems often used to test higher-order ODE solvers on the basis of the number of steps, CPU time, and maximum global error. Numerical results show the benefit of adding high-order derivatives to Runge-Kutta methods.     

Hermite–Birkhoff–Obrechkoff four-stage four-step ODE solver of order 14 with quantized step size

A four-stage Hermite–Birkhoff–Obrechkoff method of order 14 with four quantized variable steps, denoted by HBOQ(14)4, is constructed for solving non-stiff systems of first-order differential equations of the form y^′=f(t,y)$y^{\prime }=f(t,y)$ with initial conditions y(_t0)=_y0$y\left(t_0\right)=y_0$. Its formula uses y^′$y^{\prime }$, y^″$y^{″}$ and y^?$y^{?}$ as in Obrechkoff methods. Forcing a Taylor expansion of the numerical solution to agree with an expansion of the true solution leads to multistep- and Runge–Kutta-type order conditions which are reorganized into linear Vandermonde-type systems. To reduce overhead, simple formulae are derived only once to obtain the values of Hermite–Birkhoff interpolation polynomials in terms of Lagrange basis functions for 16 quantized step size ratios. The step size is controlled by a local error estimator. When programmed in C ++, HBOQ(14)4 is superior to the Dormand–Prince Runge–Kutta pair DP(8,7)13M of order 8 in solving several problems often used to test higher order ODE solvers at stringent tolerances. When programmed in Matlab, it is superior to ode113 in solving costly problems, on the basis of the number of steps, CPU time, and maximum global error. The code is available on the URL www.site.uottawa.ca/~remi.     

Cohomology of semi 1-coronae and extension of analytic subsets

We deal with the cohomology of semi 1-coronae. Semi 1-coronae are domains whose boundary is the union of a Levi flat part, a 1-pseudoconvex part and a 1-pseudoconcave part. Using the main result in [C. Laurent-Thiébaut, J. Leiterer, Uniform estimates for the Cauchy-Riemann equation on q-concave wedges, in: Colloque d'Analyse Complexe et Géométrie, Marseille, 1992, Astérisque 217 (7) (1993) 151-182], we prove a bump lemma for compact semi 1-coronae in Cn and then, applying Andreotti-Grauert theory, we get a cohomology finiteness theorem for coherent sheaves whose depth is at least 3. As an application we get an extension theorem for coherent sheaves and analytic subsets.     

Natural bicubic spline fractal interpolation

Fractal Interpolation functions provide natural deterministic approximation of complex phenomena. Cardinal cubic splines are developed through moments (i.e. second derivative of the original function at mesh points). Using tensor product, bicubic spline fractal interpolants are constructed that successfully generalize classical natural bicubic splines. An upper bound of the difference between the natural cubic spline blended fractal interpolant and the original function is deduced. In addition, the convergence of natural bicubic fractal interpolation functions towards the original function providing the data is studied.     

A nodal spline interpolant for the Gregory rule of even order

Summary The Gregory rule is a well-known example in numerical quadrature of a trapezoidal rule with endpoint corrections of a given order. In the literature, the methods of constructing the Gregory rule have, in contrast to Newton-Cotes quadrature,not been based on the integration of an interpolant. In this paper, after first characterizing an even-order Gregory interpolant by means of a generalized Lagrange interpolation operator, we proceed to explicitly construct such an interpolant by employing results from nodal spline interpolation, as established in recent work by the author and C.H. Rohwer. Nonoptimal order error estimates for the Gregory rule of even order are then easily obtained.     

On best cubature formulas and spline interpolation

Summary A general cubature formula with an arbitrary preassigned weight function is derived using monosplines and integration by parts. The problem of determining the best cubature is formulated in terms of monosplines of least deviation and a solution to the problem is given by Theorem 3 below. This theorem may also be viewed as an optimal property of a new kind of two-dimensional spline interpolation.This work was done while the author was working at CERN, Geneva, Switzerland     

Numerical evaluation of analytic functions by Cauchy's theorem

The use of the Cauchy theorem (instead of the Cauchy formula) in complex analysis together with numerical integration rules is proposed for the computation of analytic functions and their derivatives inside a closed contour from boundary data for the analytic function only. This approach permits a dramatical increase of the accuracy of the numerical results for points near the contour. Several theoretical results about this method are proved. Related numerical results are also displayed. The present method together with the trapezoidal quadrature rule on a circular contour is investigated from a theoretical point of view (including error bounds and corresponding asymptotic estimates), compared with the numerically competitive Lyness-Delves method and rederived by using the Theotokoglou results on the error term. Generalizations for the present method are suggested in brief.     

FBSDEs with time delayed generators: L-solutions, differentiability, representation formulas and path regularity

We extend the work of Delong and Imkeller (2010) [6] and [7] concerning backward stochastic differential equations with time delayed generators (delay BSDEs). We give moment and a priori estimates in general L^p-spaces and provide sufficient conditions for the solution of a delay BSDE to exist in L^p. We introduce decoupled systems of SDEs and delay BSDEs (delay FBSDEs) and give sufficient conditions for their variational differentiability. We connect these variational derivatives to the Malliavin derivatives of delay FBSDEs via the usual representation formulas. We conclude with several path regularity results, in particular we extend the classic L²-path regularity to delay FBSDEs.