AC 0-collocation-like method for two-point boundary value problems

Summary A method of a collocation type based onC ⁰-piecewise polynomial spaces is presented for a two-point boundary value problem of the second order. The method has an optimal order of convergence under smoothness requirements on the exact solution which are weaker than forC ¹-collocation methods. If the differential operator is symmetric, a modification of this method leads to a symmetric system of linear equations. It is shown that if the collocation solution is a piecewise polynomial of degree not greater thanr, the method is stable and convergent with orderh ^r inH ¹-norm. A similar symmetric modification forC ⁰-colloction-finite element method [7] is also obtained. Superconvergence at the nodes is established.     

Local flux mimetic finite difference methods

We develop a local flux mimetic finite difference method for second order elliptic equations with full tensor coefficients on polyhedral meshes. To approximate the velocity (vector variable), the method uses two degrees of freedom per element edge in two dimensions and n degrees of freedom per n-gonal mesh face in three dimensions. To approximate the pressure (scalar variable), the method uses one degree of freedom per element. A specially chosen quadrature rule for the L ²-product of vector-functions allows for a local flux elimination and reduction of the method to a cell-centered finite difference scheme for the pressure unknowns. Under certain assumptions, first-order convergence is proved for both variables and second-order convergence is proved for the pressure. The assumptions are verified on simplicial meshes for a particular quadrature rule that leads to a symmetric method. For general polyhedral meshes, non-symmetric methods are constructed based on quadrature rules that are shown to satisfy some of the assumptions. Numerical results confirm the theory.     

The effect of numerical integration on the finite element approximation of linear functionals

In this paper, we have studied the effect of numerical integration on the finite element method based on piecewise polynomials of degree k, in the context of approximating linear functionals, which are also known as “quantities of interest”. We have obtained the optimal order of convergence, O(h^2k){\mathcal{O}(h^{2k})}, of the error in the computed functional, when the integrals in the stiffness matrix and the load vector are computed with a quadrature rule of algebraic precision 2k − 1. However, this result was obtained under an increased regularity assumption on the data, which is more than required to obtain the optimal order of convergence of the energy norm of the error in the finite element solution with quadrature. We have obtained a lower bound of the error in the computed functional for a particular problem, which indicates the necessity of the increased regularity requirement of the data. Numerical experiments have been presented indicating that over-integration may be necessary to accurately approximate the functional, when the data lack the increased regularity.     

Splitting extrapolation algorithm for first kind boundary integral equations with singularities by mechanical quadrature methods

The accuracy of numerical solutions near singular points is crucial for numerical methods. In this paper we develop an efficient mechanical quadrature method (MQM) with high accuracy. The following advantages of MQM show that it is very promising and beneficial for practical applications: (1) the O(h_max³) O(h_{\rm {max}}^{3}) convergence rate; (2) the O(h_max⁵)O(h_{\rm {max}}^{5}) convergence rate after splitting extrapolation; (3) Cond = O(h_min^-1)O(h_{\rm {min}}^{-1}); (4) the explicit discrete matrix entries. In this paper, the above theoretical results are briefly addressed and then verified by numerical experiments. The solutions of MQM are more accurate than those of other methods. Note that for the discontinuous model in Li et al. (Eng Anal Bound Elem 29:59–75, 2005), the highly accurate solutions of MQM may even compete with those of the collocation Trefftz method.     

The algebraic theory approach for ordinary differential equations: Highly accurate finite differences

This article reports further developments of Herrera's algebraic theory approach to the numerical treatment of differential equations. A new solution procedure for ordinary differential equations is presented. Finite difference algorithms of 0(h^r), for arbitrary “r” are developed. The method consists in constructing local approximate solutions and using them to extract information about the sought solution. Only nodal information is derived. The local approximate solutions are constructed by collocation, using polynomials of degree G. When “n” collocation points are used at each subinterval, G = n + 1and the order of accuracy is 0(h^2n?1). The procedure here presented is very easy to implement. A program in which n can be chosen arbitrarily, was constructed and applied to selected examples.     

On richardson extrapolation for finite difference methods on regular grids

Summary Difference solutions of partial differential equations can in certain cases be expanded by even powers of a discretization parameterh. If we haven solutions corresponding to different mesh widthsh ₁,...,h _n we can improve the accuracy by Richardson extrapolation and get a solution of order 2n, yet only on the intersection of all grids used, i.e. normally on the coarsest grid. To interpolate this high order solution with the same accuracy in points not belonging to all grids, we need 2n points in an interval of length (2n–1)h ₁.This drawback can be avoided by combining such an interpolation with the extrapolation byh. In this case the approximation depends only on grid points in an interval of length 3/2h ₁. The length of this interval is independent of the desired order.By combining this approach with the method of Kreiss, boundary conditions on curved boundaries can be discretized with a high order even on coarse grids.This paper is based on a lecture held at the 5th Sanmarinian University Session of the International Academy of Sciences San Marino, at San Marino, 1988-08-27-1988-09-05     

Gaussian collocation via defect correction

Summary For the numerical integration of boundary value problems for first order ordinary differential systems, collocation on Gaussian points is known to provide a powerful method. In this paper we introduce a defect correction method for the iterative solution of such high order collocation equations. The method uses the trapezoidal scheme as the basic discretization and an adapted form of the collocation equations for defect evaluation. The error analysis is based on estimates of the contractive power of the defect correction iteration. It is shown that the iteration producesO(h ²), convergence rates for smooth starting vectors. A new result is that the iteration damps all kind of errors, so that it can also handle non-smooth starting vectors successfully.     

High-order Gauss–Lobatto formulae

Currently, the method of choice for computing the (n+2)-point Gauss–Lobatto quadrature rule for any measure of integration is to first generate the Jacobi matrix of order n+2 for the measure at hand, then modify the three elements at the right lower corner of the matrix in a manner proposed in 1973 by Golub, and finally compute the eigenvalues and first components of the respective eigenvectors to produce the nodes and weights of the quadrature rule. In general, this works quite well, but when n becomes large, underflow problems cause the method to fail, at least in the software implementation provided by us in 1994. The reason is the singularity (caused by underflow) of the 2×2 system of linear equations that is used to compute the modified matrix elements. It is shown here that in the case of arbitrary Jacobi measures, these elements can be computed directly, without solving a linear system, thus allowing the method to function for essentially unrestricted values of n. In addition, it is shown that all weights of the quadrature rule can also be computed explicitly, which not only obviates the need to compute eigenvectors, but also provides better accuracy. Numerical comparisons are made to illustrate the effectiveness of this new implementation of the method.     

Superconvergence of interpolated collocation solutions for Hammerstein equations

In this article, we discuss the superconvergence of the interpolated collocation solutions for Hammerstein equations. Applying this new interpolation postprocessing to the collocation approximation x_h, we get a higher accuracy approximation I x_h, whose convergence order is the same as that of the iterated collocation method. Such an interpolation postprocessing method is much simpler. Also, numerical experiments are shown to demonstrate the efficiency of the interpolation postprocessing method. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Product integration for the linear transport equation in slab geometry

Summary In this paper we present a product quadrature rule for the discretization of the well-known linear transport equation in slab geometry. In particular we give an algorithm for constructing the weights of the rule and prove that the order of convergence isO(n ^–3+ ), >0 small as we like. Numerical examples are given, and our formula is also compared with product Simpson rules. Finally, we examine a Nyström method based on our quadrature.Work sponsored by the Ministero della Pubblica Instruzione of Italy     

Suboptimal Kronrod extension formulae for numerical quadrature

Summary We consider cases where the Stieltjes polynomial associated with a Gaussian quadrature formula has complex zeros. In such cases a Kronrod extension of the Gaussian rule does not exist. A method is described for modifying the Stieltjes polynomial so that the resulting polynomial has no complex zeros. The modification is performed in such a way that the Kronrod-type extension rule resulting from the addition of then+1 zeros of the modified Stieltjes polynomial to the original knots of the Gaussian rule has only slightly lower degree of precision than normally achieved when the Kronrod extension rule exists. As examples of the use of the method, we present some new formulae extending the classical Gauss-Hermite quadrature rules. We comment on the limited success of the method in extending Gauss-Laguerre rules and show that several modified extensions of the Gauss Gegenbauer formulae exist in cases where the standard Kronrod extension does not.     

Error estimates for the combinedh andp versions of the finite element method

Summary In theh-version of the finite element method, convergence is achieved by refining the mesh while keeping the degree of the elements fixed. On the other hand, thep-version keeps the mesh fixed and increases the degree of the elements. In this paper, we prove estimates showing the simultaneous dependence of the order of approximation on both the element degrees and the mesh. In addition, it is shown that a proper design of the mesh and distribution of element degrees lead to a better than polynomial rate of convergence with respect to the number of degrees of freedom, even in the presence of corner singularities. Numerical results comparing theh-version,p-version, and combinedh-p-version for a one dimensional problem are presented.     

A note onC o Galerkin methods for two-point boundary problems

Summary As is known [4]. theC ^o Galerkin solution of a two-point boundary problem using piecewise polynomial functions, hasO(h ^2k ) convergence at the knots, wherek is the degree of the finite element space. Also, it can be proved [5] that at specific interior points, the Gauss-Legendre points the gradient hasO(h ^k+1) convergence, instead ofO(h ^k ). In this note, it is proved that on any segment there arek–1 interior points where the Galerkin solution is ofO(h ^k+2), one order better than the global order of convergence. These points are the Lobatto points.     

Hybrid Galerkin boundary elements: theory and implementation

Summary. In this paper we present a new quadrature method for computing Galerkin stiffness matrices arising from the discretisation of 3D boundary integral equations using continuous piecewise linear boundary elements. This rule takes as points some subset of the nodes of the mesh and can be used for computing non-singular Galerkin integrals corresponding to pairs of basis functions with non-intersecting supports. When this new rule is combined with standard methods for the singular Galerkin integrals we obtain a “hybrid” Galerkin method which has the same stability and asymptotic convergence properties as the true Galerkin method but a complexity more akin to that of a collocation or Nystr?m method. The method can be applied to a wide range of singular and weakly-singular first- and second-kind equations, including many for which the classical Nystr?m method is not even defined. The results apply to equations on piecewise-smooth Lipschitz boundaries, and to non-quasiuniform (but shape-regular) meshes. A by-product of the analysis is a stability theory for quadrature rules of precision 1 and 2 based on arbitrary points in the plane. Numerical experiments demonstrate that the new method realises the performance expected from the theory. Received January 22, 1998 / Revised version received May 26, 1999 / Published online April 20, 2000 –? Springer-Verlag 2000     

L 2 estimates for the finite element method for the Dirichlet problem with singular data

Summary In this paper we consider the approximation by the finite element method of second order elliptic problems on convex domains and homogeneous Dirichlet condition on the boundary. In these problems the data are Borel measures. Using a quasiuniform mesh of finite elements and polynomials of degree 1, we prove that in two dimensions the convergence is of orderh inL ² and in three dimensions of orderh ^1/2.     

The Qualocation Method for Symm's Integral Equation on a Polygon

This paper discusses the convergence of the qualocation method for Symm's integral equation on closed polygonal boundaries in IR². Qualocation is a Petrov-Galerkin method in which the outer integrals are performed numerically by special quadrature rules. Before discretisation a nonlinear parametrisation of the polygon is introduced which varies more slowly than arc-length near each corner and leads to a transformed integral equation with a regular solution. We prove that the qualocation method using smoothest splines of any order k on a uniform mesh (with respect to the new parameter) converges with optimal order O (h^k). Furthermore, the method is shown to produce superconvergent approximations to linear functionals, retaining the same high convergence rates as in the case of a smooth curve.     

A fully discrete H 1-Galerkin method with quadrature for nonlinear advection–diffusion–reaction equations

We propose and analyze a fully discrete H ¹-Galerkin method with quadrature for nonlinear parabolic advection–diffusion–reaction equations that requires only linear algebraic solvers. Our scheme applied to the special case heat equation is a fully discrete quadrature version of the least-squares method. We prove second order convergence in time and optimal H ¹ convergence in space for the computer implementable method. The results of numerical computations demonstrate optimal order convergence of scheme in H ^k for k = 0, 1, 2. Support of the Australian Research Council is gratefully acknowledged.     

A Chebyshev Quadrature Rule for One Sided Finite Part Integrals

This paper is concerned with a Chebyshev quadrature rule for approximating one sided finite part integrals with smooth density functions. Our quadrature rule is based on the Chebyshev interpolation polynomial with the zeros of the Chebyshev polynomial T_N+1(τ)−T_N−1(t). We analyze the stability and the convergence for the quadrature rule with a differentiable function. Also we show that the quadrature rule has an exponential convergence when the density function is analytic.     

Reducible quadrature methods for Volterra integral equations of the first kind

Quadrature rules, generated by linear multistep methods for ordinary differential equations, are employed to construct a wide class of direct quadrature methods for the numerical solution of first kind Volterra integral equations. Our class covers several methods previously considered in the literature. The methods are convergent provided that both the first and second characteristic polynomial of the linear multistep method satisfy the root condition. Furthermore, the stability behaviour for fixed positive values of the stepsizeh is analyzed, and it turns out that convergence implies (fixedh) stability. The subclass formed by the backward differentiation methods up to order six is discussed and illustrated with numerical examples.     

Monotony in interpolatory quadratures

Summary Let , be holomorphic in an open disc with the centrez ₀=0 and radiusr>1. LetQ _n (n=1, 2, ...) be interpolatory quadrature formulas approximating the integral . In this paper some classes of interpolatory quadratures are considered, which are based on the zeros of orthogonal polynomials corresponding to an even weight function. It is shown that the sequencesQ _n 9f] (n=1, 2, ...) are monotone. Especially we will prove monotony in Filippi's quadrature rule and with an additional assumption onf monotony in the Clenshaw-Curtis quadrature rule.