‎in this paper‎, ‎an approach based on statistical spline model (ssm) and collocation method is proposed to solve volterra-fredholm integral equations‎. ‎the set of collocation nodes is chosen so that the points yield minimal error in the nodal polynomials‎. ‎under some standard assumptions‎, ‎we establish the convergence property of this approach‎. ‎numerical results on some problems are given...

In this talk, we are concerned with embedded formulae of the Chebyshev collocation methods [1] developed recently. We introduce two Chebyshev collocation methods based on generalized Chebyshev interpolation polynomials [2], which are used to make an automatic integration method. We apply an elegant algorithm of generalized Chebyshev interpolation increasing the node points to make an error esti...

We propose a modification of collocation methods extending the ‘averaged vector field method’ to high order. These new integrators exactly preserve energy for Hamiltonian systems, are of arbitrarily high order, and fall into the class of B-series integrators. We discuss their symmetry and conjugate-symplecticity, and we compare them to energypreserving composition methods. c © 2010 European Soc...

The sparse grid stochastic collocation method is a new method for solving partial differential equations with random coefficients. However, when the probability space has high dimensionality, the number of points required for accurate collocation solutions can be large, and it may be costly to construct the solution. We show that this process can be made more efficient by combining collocation ...

In the theoretical part of this paper, we introduce a simplified proof technique for error bounds and convergence of a variation of E. Kansa’s well-known unsymmetric meshless collocation method. For a numerical implementation of the convergent variation, a previously proposed greedy technique is coupled with linear optimization. This algorithm allows a fully adaptive on-the-fly data-dependent m...

Meshfree methods have been formulated based on Galerkin type weak formulation and collocation type strong formulation. The approximation functions commonly used in the Galerkin based meshfree methods are the moving least-squares (MLS) and reproducing kernel (RK) approximations, while the radial basis functions (RBFs) are usually employed in the strong form collocation method. Galerkin type form...