We consider Hammerstein equations of the form y(i)=f(t)+(hk(t,s)g(s,y(s))ds, te[a,b], J a and present a new method for solving them numerically. The method is a collocation method applied not to the equation in its original form, but rather to an equivalent equation for z(t):= g(t,y(t)). The desired approximation to y is then obtained by use of the (exact) equation y(t)=f(t) + fh k(t,s)z(s)ds, ...

Simplest results presented here are the stability criteria of collocation methods for the second-order Volterra integrodifferential equation (VIDE) by polynomial spline functions. The polynomial spline collocation method is stable if all eigenvalues of a matrix are in the unit disk and all eigenvalues with |λ| = 1 belong to a 1× 1 Jordan block. Also many other conditions are derived depending u...

in this paper, a new spectral-iterative method is employed to give approximate solutions of fractional logistic differential equation. this approach is based on combination of two different methods, i.e. the iterative method cite{35} and the spectral method. the method reduces the differential equation to systems of linear algebraic equations and then the resulting systems are solved by a numer...

. In this paper, we develop a quadratic spline collocation method for integrating the nonlinear partial differential equations (PDEs) of a plug flow reactor model. The method is proposed in order to be used for the operation of control design and/or numerical simulations. We first present the Crank-Nicolson method to temporally discretize the state variable. Then, we develop and analyze the pro...

Differential–difference equation; Collocation points; Polynomial solutions Abstract This paper contributes a new matrix method for solving systems of high-order linear differential–difference equations with variable coefficients under given initial conditions. On the basis of the presented approach, the matrix forms of the Euler polynomials and their derivatives are constructed, and then by sub...

In this paper, a Chebyshev spectral collocation domain decomposition (DD) semidiscretization by using a grid mapping, derived by Kosloff and Tal-Ezer in space is applied to the numerical solution of the generalized Burger’s–Huxley (GBH) equation. To reduce roundoff error in computing derivatives we use the above mentioned grid mapping. In this work, we compose the Chebyshev spectral collocation...

We propose a discrete collocation method for the boundary integral equations which arise from solving Laplace's equation u = 0. The Laplace's equation is deened on connected regions D in R 3 with a smooth boundary S. The piecewise polynomial interpolation in the parametrization variables along with the collocation method is used, and a numerical integration scheme for collocation integrals is g...

in this paper we use radial basis functions to solve multivariable integral equations. we use collocation method for implementation. numerical experiments show the accuracy of the method.

The Meshless Local Petrov-Galerkin (MLPG) “mixed collocation” method is applied to the problem of topology-optimization of elastic structures. In this paper, the topic of compliance minimization of elastic structures is pursued, and nodal design variables which represent nodal volume fractions at discretized nodes are adopted. A so-called nodal sensitivity filter is employed, to prevent the phe...

In this article, we have investigate a Taylor collocation method, which is based on collocation method for solving fractional pantograph equation. This method is based on first taking the truncated fractional Taylor expansions of the solution function in the mathematical model and then substituting their matrix forms into the equation. Using the collocation points, we have the system of nonline...