On Taylor-series expansion methods for the second kind integral equations

In this paper, we comment on the recent papers by Yuhe Ren et al. (1999) [1] and Maleknejad et al. (2006) [7] concerning the use of the Taylor series to approximate a solution of the Fredholm integral equation of the second kind as well as a solution of a system of Fredholm equations. The technique presented in Yuhe Ren et al. (1999) [1] takes advantage of a rapidly decaying convolution kernel k(|s−t|) as |s−t| increases. However, it does not apply to equations having other types of kernels. We present in this paper a more general Taylor expansion method which can be applied to approximate a solution of the Fredholm equation having a smooth kernel. Also, it is shown that when the new method is applied to the Fredholm equation with a rapidly decaying kernel, it provides more accurate results than the method in Yuhe Ren et al. (1999) [1]. We also discuss an application of the new Taylor-series method to a system of Fredholm integral equations of the second kind.     

Solution of high‐order linear Fredholm integro‐differential equations with piecewise intervals

In this study, a practical matrix method is presented to find an approximate solution for high‐order linear Fredholm integro‐differential equations with piecewise intervals under the initial boundary conditions in terms of Taylor polynomials. The method converts the integro differential equation to a matrix equation, which corresponds to a system of linear algebraic equations. Error analysis and illustrative examples are included to demonstrate the validity and applicability of the technique. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010 27: 1327–1339, 2011     

A new Euler matrix method for solving systems of linear Volterra integral equations with variable coefficients

This article develops an efficient solver based on collocation points for solving numerically a system of linear Volterra integral equations (VIEs) with variable coefficients. By using the Euler polynomials and the collocation points, this method transforms the system of linear VIEs into the matrix equation. The matrix equation corresponds to a system of linear equations with the unknown Euler coefficients. A small number of Euler polynomials is needed to obtain a satisfactory result. Numerical results with comparisons are given to confirm the reliability of the proposed method for solving VIEs with variable coefficients.     

Spectral methods for weakly singular Volterra integral equations with smooth solutions

We propose and analyze a spectral Jacobi-collocation approximation for the linear Volterra integral equations (VIEs) of the second kind with weakly singular kernels. In this work, we consider the case when the underlying solutions of the VIEs are sufficiently smooth. In this case, we provide a rigorous error analysis for the proposed method, which shows that the numerical errors decay exponentially in the infinity norm and weighted Sobolev space norms. Numerical results are presented to confirm the theoretical prediction of the exponential rate of convergence.     

MULTILEVEL AUGMENTATION METHODS FOR SOLVING OPERATOR EQUATIONS

We introduce multilevel augmentation methods for solving operator equations based on direct sum decompositions of the range space of the operator and the solution space of the operator equation and a matrix splitting scheme. We establish a general setting for the analysis of these methods, showing that the methods yield approximate solutions of the same convergence order as the best approximation from the subspace. These augmentation methods allow us to develop fast, accurate and stable nonconventional numerical algorithms for solving operator equations. In particular, for second kind equations, special splitting techniques are proposed to develop such algorithms. These algorithms are then applied to solve the linear systems resulting from matrix compression schemes using wavelet-like functions for solving Fredholm integral equations of the second kind. For this special case, a complete analysis for computational complexity and convergence order is presented. Numerical examples are included to demonstra     

Time accurate fast wavelet‐Taylor Galerkin method for partial differential equations

We introduce the concept of fast wavelet‐Taylor Galerkin methods for the numerical solution of partial differential equations. In wavelet‐Taylor Galerkin method discretization in time is performed before the wavelet based spatial approximation by introducing accurate generalizations of the standard Euler, θ and leap‐frog time‐stepping scheme with the help of Taylor series expansions in the time step. We will present two different time‐accurate wavelet schemes to solve the PDEs. First, numerical schemes taking advantage of the wavelet bases capabilities to compress the operators and sparse representation of functions which are smooth, except for in localized regions, up to any given accuracy are presented. Here numerical experiments deal with advection equation with the spiky solution in one dimension, two dimensions, and nonlinear equation with a shock in solution in two dimensions. Second, our schemes deal with more regular class of problems where wavelets are not efficient procedure for data compression but we can use the good approximation properties of wavelet. Here time‐accurate schemes lead to consistent mass matrix in an explicit time stepping, which can be solved by approximate factorization techniques. Numerical experiment deals with more regular class of problems like heat equation as well as coupled linear system in two dimensions. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Differential transform method for solving Volterra integral equation with separable kernels

In this paper, Volterra integral equations with separable kerenels are solved using the differential transform method. The approximate solution of this equation is calculated in the form of a series with easily computable terms. Exact solutions of linear and nonlinear integral equations have been investigated and the results illustrate the reliability and the performance of the differential transform method.     

Polynomial solution of the most general linear Fredholm integrodifferential–difference equations by means of Taylor matrix method

In this article, a Taylor matrix method is developed to find an approximate solution of the most general linear Fredholm integrodifferential–difference equations with variable coefficients under the mixed conditions in terms of Taylor polynomials. Also numerical examples are presented, which illustrate the pertinent features of the method. In some numerical examples, MAPLE modules are designed for the purpose of testing and using the method.     

Improving the accuracy of solutions of the linear second kind volterra integral equations system by using the taylor expansion method

This paper presents a new and an efficient method for determining solutions of the linear second kind Volterra integral equations system. In this method, the linear Volterra integral equations system using the Taylor series expansion of the unknown functions transformed to a linear system of ordinary differential equations. For determining boundary conditions we use a new method. This method is effective to approximate solutions of integral equations system with a smooth kernel, and a convolution kernel. An error analysis for the proposed method is provided. And illustrative examples are given to represent the efficiency and the accuracy of the proposed method.     

Solution of nonlinear weakly singular Volterra integral equations using the fractional‐order Legendre functions and pseudospectral method

In this article, our main goal is to render an idea to convert a nonlinear weakly singular Volterra integral equation to a non‐singular one by new fractional‐order Legendre functions. The fractional‐order Legendre functions are generated by change of variable on well‐known shifted Legendre polynomials. We consider a general form of singular Volterra integral equation of the second kind. Then the fractional Legendre–Gauss–Lobatto quadratures formula eliminates the singularity of the kernel of the integral equation. Finally, the Legendre pseudospectral method reduces the solution of this problem to the solution of a system of algebraic equations. This method also can be utilized on fractional differential equations as well. The comparison of results of the presented method and other numerical solutions shows the efficiency and accuracy of this method. Also, the obtained maximum error between the results and exact solutions shows that using the present method leads to accurate results and fast convergence for solving nonlinear weakly singular Volterra integral equations. Copyright © 2015 John Wiley & Sons, Ltd.     

Numerical solution of a class of complex differential equations by the Taylor collocation method in elliptic domains

An approximate method for solving higher‐order linear complex differential equations in elliptic domains is proposed. The approach is based on a Taylor collocation method, which consists of the matrix represantation of expressions in the differential equation and the collocation points defined in an elliptic domain. Illustrative examples are included to demonstrate the validity and applicability of the technique. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Modified integral current methods in electrodynamics of nonhomogeneous media

The main difficulty in numerical solution of integral equations of electrodynamics is associated with the need to solve a high-order system of linear equations with a dense matrix. It is therefore relevant to develop numerical methods that lead to linear equation systems of lower order at the cost of more complex evaluation of the coefficients. In this article we propose a method for solving linear equations of electrodynamics which is a modification of the integral current method. The main distinctive feature of the proposed method is double integration of the electric Green’s tensor in the process of algebraization of the original integral equation. The solutions of the system of linear equations are thus integral means of the electric field inside the anomaly constructed by the proposed transformation formula. We prove convergence and derive error bounds for both the solution of the integral equation and the electromagnetic field components evaluated from approximate transformation formulas.     

An algorithm for the solution of ill-posed linear systems arising from the discretization of Fredholm integral equation of the first kind

An algorithm for obtaining approximate solutions of ill-posed systems of linear equations arising from the discretization of Fredholm integral equation of the first kind is described. The ill-posed system is first replaced by an equivalent consistent system of linear equations. The method calculates the minimum length least squares solution of the consistent system. Starting from rank = 1 of the consistent system, the rank is increased by one in succession and a new solution is calculated. This is repeated until a certain simple criterion is satisfied. Linear programming techniques are used for which successive solutions are the basic solutions in the successive simplex tableaux. The algorithm is numerically stable. Numerical results show that this method compares favorably with other direct methods.     

The exact solution of a class of Volterra integral equation with weakly singular kernel

In this paper, the weakly singular Volterra integral equations with an infinite set of solutions are investigated. Among the set of solutions only one particular solution is smooth and all others are singular at the origin. The numerical solutions of this class of equations have been a difficult topic to analyze and have received much previous investigation. The aim of this paper is to present a numerical technique for giving the approximate solution to the only smooth solution based on reproducing kernel theory. Applying weighted integral, we provide a new definition for reproducing kernel space and obtain reproducing kernel function. Using the good properties of reproducing kernel function, the only smooth solution is exactly expressed in the form of series. The n-term approximate solution is obtained by truncating the series. Meanwhile, we prove that the derivative of approximation converges to the derivative of exact solution uniformly. The final numerical examples compared with other methods show that the method is efficient.     

A fast numerical algorithm based on the Taylor wavelets for solving the fractional integro‐differential equations with weakly singular kernels

In this paper, a fast numerical algorithm based on the Taylor wavelets is proposed for finding the numerical solutions of the fractional integro‐differential equations with weakly singular kernels. The properties of Taylor wavelets are given, and the operational matrix of fractional integration is constructed. These wavelets are utilized to reduce the solution of the given fractional integro‐differential equation to the solution of a linear system of algebraic equations. Also, convergence of the proposed method is studied. Illustrative examples are included to demonstrate the validity and applicability of the technique.     

The dual reciprocity boundary integral equation technique to solve a class of the linear and nonlinear fractional partial differential equations

In this paper, we apply the boundary integral equation technique and the dual reciprocity boundary elements method (DRBEM) for the numerical solution of linear and nonlinear time‐fractional partial differential equations (TFPDEs). The main aim of the present paper is to examine the applicability and efficiency of DRBEM for solving TFPDEs. We employ the time‐stepping scheme to approximate the time derivative, and the method of linear radial basis functions is also used in the DRBEM technique. This method is improved by using a predictor–corrector scheme to overcome the nonlinearity that appears in the nonlinear problems under consideration. To confirm the accuracy of the new approach, several examples are presented. The convergence of the DRBEM is studied numerically by comparing the exact solutions of the problems under investigation. Copyright © 2015 John Wiley & Sons, Ltd.     

Numerical Treatment of Homogeneous Semi-Markov Processes in Transient Case–a Straightforward Approach

This paper presents the numerical solution of the process evolution equation of a homogeneous semi-Markov process (HSMP) with a general quadrature method. Furthermore, results that justify this approach proving that the numerical solution tends to the evolution equation of the continuous time HSMP are given. The results obtained generalize classical results on integral equation numerical solutions applying them to particular kinds of integral equation systems. A method for obtaining the discrete time HSMP is shown by applying a very particular quadrature formula for the discretization. Following that, the problem of obtaining the continuous time HSMP from the discrete one is considered. In addition, the discrete time HSMP in matrix form is presented and the fact that the solution of the evolution equation of this process always exists is proved. Afterwards, an algorithm for solving the discrete time HSMP is given. Finally, a simple application of the HSMP is given for a real data social security example.     

FINITE ELEMENT NONLINEAR GALERKIN COUPLING METHOD FOR THE EXTERIOR STEADY NAVIER-STOKES PROBLEM

1.IntroductionNonlinearGalerkinmethodsaremultilevelschemesforthedissipativeevolutionpartialdifferentialequations.Theycorrespondtothesplittingsoftheunknownu:u=y z)wherethecomponentsareofdifferentorderofmagnitudewithrespecttoaparameterrelatedtothespati...     

Numerical solution of the Burgers’ equation by automatic differentiation

We compute the solution of the one-dimensional Burgers’ equation by marching the solution in time using a Taylor series expansion. Our approach does not require symbolic manipulation and does not involve the solution of a system of linear or non-linear algebraic equations. Instead, we use recursive formulas obtained from the differential equation to calculate exact values of the derivatives needed in the Taylor series. We illustrate the effectiveness of our method by solving four test problems with known exact solutions. The numerical solutions we obtain are in excellent agreement with the exact solutions, while being superior to other previously reported numerical solutions.