The polynomial chaos method has been widely adopted as a computationally feasible approach for uncertainty quantification. Most studies to date have focused on non-stiff systems. When stiff systems are considered, implicit numerical integration requires the solution of a nonlinear system of equations at every time step. Using the Galerkin approach, the size of the system state increases from n ...

In this paper a new method for solving (non-linear) ordinary differential equations is proposed. The method is based on finite elements (collocation method) as well as on genetic algorithms. The method seems to have some advantages in comparison with the typical sequential (one – step and multi – step) methods. Key-Words: Ordinary Differential Equations, Finite Elements, Genetic Algorithms, Evo...

Abstract. Spherical radial basis functions are used to define approximate solutions to pseudodifferential equations of negative orders on the unit sphere. These equations arise from geodesy. The approximate solutions are found by the collocation method. A salient feature of our approach in this paper is a simple error analysis for the collocation method using the same argument as that for the G...

The linguistic phenomenon of collocation, the habitual juxtaposition of some words in natural language has been shown to benefit natural language processing tasks such as information retrieval. This paper examines the utility of several methods for collocation extraction for document retrieval, specifically for queries in question form.

We present optimal error estimates for spectral Petrov–Galerkin methods and spectral collocation methods for linear fractional ordinary differential equations with initial value on a finite interval. We also develop Laguerre spectral Petrov–Galerkin methods and collocation methods for fractional equations on the half line. Numerical results confirm the error estimates.

In this paper, we show that accessibility of syntactic information eases collocation extraction from corpora, and supports identi cation of lexical and structural restrictions related to collocations. For collocation identi cation we use a corpus that is automatically annotated applying a part-of-speech tagger and a phrase chunker.

This paper is concerned with the convergence, global superconvergence, local superconvergence, and stability of collocation methods for u′ t au t bu t . The optimal convergence order and superconvergence order are obtained, and the stability regions for the collocation methods are determined. The conditions that the analytic stability region is contained in the numerical stability region are ob...

We consider solving integral equations on a piecewise smooth surface S in R 3 with a smooth kernel function, using piecewise polynomial collocation interpolation of the surface. The theoretical analysis includes the eeects of the numerical integration of the collocation coeecients and the use of the approximating surface. The resulting order of convergence is higher than had previously been exp...

A collocation-//"'-Galerkin method is defined for some elliptic boundary value problems on a rectangle. The method uses tensor products of discontinuous piecewise polynomial spaces and collocation based on Jacobi points with weight function >c2(l x)2. Optimal order of L2 rates of convergence is established for the approximation solution. A numerical example which confirms these results is prese...

The numerical stability of the polynomial spline collocation method for general Volterra integro-differential equation is being considered. The convergence and stability of the newmethod are given and the efficiency of the newmethod is illustrated by examples. We also proved the conjecture suggested by Danciu in 1997 on the stability of the polynomial spline collocation method for the higher-or...