A Direct Matrix Method for Computing Analytical Jacobians of Discretized Nonlinear Integro-differential Equations

In this paper, we propose a new adaptation of the D-iteration algorithm to numerically solve the differential equations. This problem can be reinterpreted in 2D or 3D (or higher dimensions) as a limit of a diffusion process where the boundary or initial conditions are replaced by fluid catalysts. It has been shown that pre-computing the diffusion process for an elementary catalyst case as a fundamental block of a class of differential equations, the computation efficiency can...

SPSMAT (Spectral/Pseudospectral matrix method) is an add-on for Octave, that helps you solve nonfractional-/fractional ordinary/partial differential/integral equations. In this version, as the first version, the well-defined spectral or pseudospectral algorithms are considered to solve differential and integral equations. The motivation is that there are few software packages available that make such methods easy to use for practitioners in the field of scientific computing. ...

In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized to transform the differential equation to a matrix equation which corresponds to a system of algebraic equations with unknown Bernoulli coefficients. This method can be used for many problems such as differential equations, integral equation...

We describe an algorithm, based on Euler's method, for solving Volterra integro-differential equations. The algorithm approximates the relevant integral by means of the composite Trapezium Rule, using the discrete nodes of the independent variable as the required nodes for the integration variable. We have developed an error control device, using Richardson extrapolation, and we have achieved accuracy better than 1e-12 for all numerical examples considered.

The aim of the present paper is to introduce a new numerical method for solving nonlinear Volterra integro-differential equations involving delay. We apply trapezium rule to the integral involved in the equation. Further, Daftardar-Gejji and Jafari method (DGJ) is employed to solve the implicit equation. Existence-uniqueness theorem is derived for solutions of such equations and the error and convergence analysis of the proposed method is presented. We illustrate efficacy of ...

A new numerical method for solving a scalar ordinary differential equation with a given initial condition is introduced. The method is using a numerical integration procedure for an equivalent integral equation and is called in this paper an integrating method. Bound to specific constraints, the method returns an approximate solution assuredly within a given tolerance provided by a user. This makes it different from a large variety of single- and multi-step methods for solvin...

In this paper, Bernstein piecewise polynomials are used to solve the integral equations numerically. A matrix formulation is given for a non-singular linear Fredholm Integral Equation by the technique of Galerkin method. In the Galerkin method, the Bernstein polynomials are used as the approximation of basis functions. Examples are considered to verify the effectiveness of the proposed derivations, and the numerical solutions guarantee the desired accuracy.

This short communication develops a new numerical procedure suitable for a large class of ordinary differential equation systems found in models in physics and engineering. The main numerical procedure is analogous to those concerning the generalized method of lines, originally published in the here referenced books of 2011 and 2014, [3,5], respectively. Finally, in the last section, we apply the method to a model in flight mechanics.

We present a sparse spectral method for nonlinear integro-differential Volterra equations based on the Volterra operator's banded sparsity structure when acting on specific Jacobi polynomial bases. The method is not restricted to convolution-type kernels of the form $K(x,y)=K(x-y)$ but instead works for general kernels at competitive speeds and with exponential convergence. We provide various numerical experiments on problems with or without known analytic solutions and compa...

The problem of numerical differentiation can be thought of as an inverse problem by considering it as solving a Volterra equation. It is well known that such inverse integral problems are ill-posed and one requires regularization methods to approximate the solution appropriately. The commonly practiced regularization methods are (external) parameter-based like Tikhonov regularization, which have certain inherent difficulties like choosing an optimal value of the regularizatio...