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.     

Gauss-Radau and Gauss-Lobatto interval quadrature rules for Jacobi weight function

In this paper we prove the existence and uniqueness of the Gauss-Lobatto and Gauss-Radau interval quadrature formulae for the Jacobi weight function. An algorithm for numerical construction is also investigated and some suitable solutions are proposed. For the special case of the Chebyshev weight of the first kind and a special set of lengths we give an analytic solution. The authors were supported in parts by the Swiss National Science Foundation (SCOPES Joint Research Project No. IB7320–111079 ``New Methods for Quadrature') and the Serbian Ministry of Science and Environmental Protection. Serbian Ministry of Science and Environmental Protection.     

Numerical accuracy of real inversion formulas for the Laplace transform

In this article, we investigate and compare a number of real inversion formulas for the Laplace transform. The focus is on the accuracy and applicability of the formulas for numerical inversion. In this contribution, we study the performance of the formulas for measures concentrated on a positive half-line to continue with measures on an arbitrary half-line. As our trial measure concentrated on a positive half-line, we take the broad Gamma probability distribution family.     

Superconvergence of the composite Simpson’s rule for a certain finite-part integral and its applications

The superconvergence phenomenon of the composite Simpson’s rule for the finite-part integral with a third-order singularity is studied. The superconvergence points are located and the superconvergence estimate is obtained. Some applications of the superconvergence result, including the evaluation of the finite-part integrals and the solution of a certain finite-part integral equation, are also discussed and two algorithms are suggested. Numerical experiments are presented to confirm the superconvergence analysis and to show the efficiency of the algorithms.     

Computation of the inverse Laplace transform based on a collocation method which uses only real values

We develop a numerical algorithm for inverting a Laplace transform (LT), based on Laguerre polynomial series expansion of the inverse function under the assumption that the LT is known on the real axis only. The method belongs to the class of Collocation methods (C-methods), and is applicable when the LT function is regular at infinity. Difficulties associated with these problems are due to their intrinsic ill-posedness. The main contribution of this paper is to provide computable estimates of truncation, discretization, conditioning and roundoff errors introduced by numerical computations. Moreover, we introduce the pseudoaccuracy which will be used by the numerical algorithm in order to provide uniform scaled accuracy of the computed approximation for any x   with respect to e^σx${\mathrm{e}}^{\sigma x}$. These estimates are then employed to dynamically truncate the series expansion. In other words, the number of the terms of the series acts like the regularization parameter which provides the trade-off between errors.     

The superconvergence of the composite midpoint rule for the finite-part integral

The composite midpoint rule is probably the simplest one among the Newton-Cotes rules for Riemann integral. However, this rule is divergent in general for Hadamard finite-part integral. In this paper, we turn this rule to a useful one and, apply it to evaluate Hadamard finite-part integral as well as to solve the relevant integral equation. The key point is based on the investigation of its pointwise superconvergence phenomenon, i.e., when the singular point coincides with some a priori known point, the convergence rate of the midpoint rule is higher than what is globally possible. We show that the superconvergence rate of the composite midpoint rule occurs at the midpoint of each subinterval and obtain the corresponding superconvergence error estimate. By applying the midpoint rule to approximate the finite-part integral and by choosing the superconvergence points as the collocation points, we obtain a collocation scheme for solving the finite-part integral equation. More interesting is that the inverse of the coefficient matrix of the resulting linear system has an explicit expression, by which an optimal error estimate is established. Some numerical examples are provided to validate the theoretical analysis.     

The superconvergence of the Newton-Cotes rule for Cauchy principal value integrals

We consider the general (composite) Newton-Cotes method for the computation of Cauchy principal value integrals and focus on its pointwise superconvergence phenomenon, which means that the rate of convergence of the Newton-Cotes quadrature rule is higher than what is globally possible when the singular point coincides with some a priori known point. The necessary and sufficient conditions satisfied by the superconvergence point are given. Moreover, the superconvergence estimate is obtained and the properties of the superconvergence points are investigated. Finally, some numerical examples are provided to validate the theoretical results.     

Subspace-restricted singular value decompositions for linear discrete ill-posed problems

The truncated singular value decomposition is a popular solution method for linear discrete ill-posed problems. These problems are numerically underdetermined. Therefore, it can be beneficial to incorporate information about the desired solution into the solution process. This paper describes a modification of the singular value decomposition that permits a specified linear subspace to be contained in the solution subspace for all truncations. Modifications that allow the range to contain a specified subspace, or that allow both the solution subspace and the range to contain specified subspaces also are described.     

Best quadrature formula on Sobolev class with Chebyshev weight

Using best interpolation function based on a given function information, we present a best quadrature rule of function on Sobolev class KW^r[-1,1]${\mathit{KW}}^r[-1,1]$ with Chebyshev weight. The given function information means that the values of a function f∈KW^r[-1,1]$f\in {\mathit{KW}}^r[-1,1]$ and its derivatives up to r-1$r-1$ order at a set of nodes x$\mathbf{x}$ are given. Error bounds are obtained, and the method is illustrated by some examples.     

Numerical evaluation for Cauchy type singular integrals on the interval

The singular integral (SI) with the Cauchy kernel is considered. New quadrature formulas (QFs) based on the modification of discrete vortex method to approximate SI are constructed. Convergence of QFs and error bounds are shown in the classes of functions H^α([−1,1]) and C¹([−1,1]). Numerical examples are shown to validate the QFs constructed.     

Two new formulas for the numerical evaluation of the Hilbert Transform

We develop two algorithms for the numerical evaluation of the semi-infinite Hilbert Transform of functions with a given algebraic behaviour at the origin and at infinity. The first algorithm is connected with a Gauss-Jacobi type quadrature formula for unbounded intervals; the second is based on a rational Bernstein-type operator. Error estimates for different classes of functions are shown. Finally numerical examples are given, comparing the rules among themselves.     

A discussion of a new error estimate for adaptive quadrature

Previously D. P. Laurie has introduced a new and sharper error estimate for adaptive quadrature routines with the attractive property that the error is guaranteed to be in a small interval if some constraints are satisfied. In this paper we discuss how to test whether or not the constraints are satisfied, and we report a selection of results from our tests with one dimensional integrals to see how the error estimate works in practice. It turns out that we get a more economic routine using this error estimate, but the loss in reliability, even with the new tests, can be catastrophic.This work was supported by the Norwegian Research Council for Sciences and Huminaties.     

Weighted quadrature rules for finite element methods

We discuss the numerical integration of polynomials times non-polynomial weighting functions in two dimensions arising from multiscale finite element computations. The proposed quadrature rules are significantly more accurate than standard quadratures and are better suited to existing finite element codes than formulas computed by symbolic integration. We validate this approach by introducing the new quadrature formulas into a multiscale finite element method for the two-dimensional reaction–diffusion equation.     

The Superconvergence of the Composite Trapezoidal Rule for Hadamard Finite Part Integrals

The composite trapezoidal rule has been well studied and widely applied for numerical integrations and numerical solution of integral equations with smooth or weakly singular kernels. However, this quadrature rule has been less employed for Hadamard finite part integrals due to the fact that its global convergence rate for Hadamard finite part integrals with (p+1)-order singularity is p-order lower than that for the Riemann integrals in general. In this paper, we study the superconvergence of the composite trapezoidal rule for Hadamard finite part integrals with the second-order and the third-order singularity, respectively. We obtain superconvergence estimates at some special points and prove the uniqueness of the superconvergence points. Numerical experiments confirm our theoretical analysis and show that the composite trapezoidal rule is efficient for Hadamard finite part integrals by noting the superconvergence phenomenon. The work of this author was partially supported by the National Natural Science Foundation of China(No.10271019), a grant from the Research Grants Council of the Hong Kong Special Administractive Region, China (Project No. City 102204) and a grant from the Laboratory of Computational Physics The work of this author was supported in part by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. CityU 102204).     

An IMT-type quadrature formula with the same asymptotic performance as the DE formula

We propose an IMT-type quadrature formula which achieves the same asymptotic error estimate as the DE formula. The point of the idea is to optimize the parameters of the IMT-type transformation depending on the number of sampling points. We also show the performance of our IMT-type quadrature formula by numerical examples.     

The superconvergence of Newton–Cotes rules for the Hadamard finite-part integral on an interval

We study the general (composite) Newton–Cotes rules for the computation of Hadamard finite-part integral with the second-order singularity and focus on their pointwise superconvergence phenomenon, i.e., when the singular point coincides with some a priori known point, the convergence rate is higher than what is globally possible. We show that the superconvergence rate of the (composite) Newton–Cotes rules occurs at the zeros of a special function and prove the existence of the superconvergence points. Several numerical examples are provided to validate the theoretical analysis. The work of J. Wu was partially supported by the National Natural Science Foundation of China (No. 10671025) and a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (No. CityU 102507). The work of W. Sun was supported in part by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (No. City U 102507) and the National Natural Science Foundation of China (No. 10671077).     

Fully symmetric integration rules for the 4-cube

In this paper we discuss fully symmetric integration rules of degree 7 and 9 for the 4-cube. In particular we are interested in good rules. (i.e. rules with all the evaluation points inside the cube and all the weights positive).This work was supported by the Norwegian Research Council for Sciences and Humanities.     

On the quadrature error in operational quadrature methods for convolutions

Summary We analyze the quadrature error associated with operational quadrature methods for convolution equations. The assumptions are that the convolution kernel is inL ¹ and that its Laplace transform is analytic and bounded in an obtuse sector of the complex plane. Under these circumstances the Laplace transform has a slow variation property which admits a Fourier analysis of the quadrature error. We provide generalL ^p error estimates assuming suitable smoothness conditions on the function under convolution.