This paper is dealing with non-polynomial spline functions "generalized spline" to find the approximate solution of linear Volterra integro-differential equations of the second kind and extension of this work to solve system of linear Volterra integro-differential equations. The performance of generalized spline functions are illustrated in test examples

In this paper Heun method has been used to find numerical solution for first order nonlinear functional differential equation. Moreover, this method has been modified in order to treat system of nonlinear functional differential equations .two numerical examples are given for conciliated the results of this method.

The aim of this article, we define new iterative methods called three-step type in which Jungck resolvent CR-iteration and resolvent Jungck SP-iteration are discussed and study rate convergence and strong convergence in Banach space to reach the fixed point which is differentially solve of nonlinear equations. The studies also expanded around it to find the best solution for nonlinear operator equations in addition to the varying inequalities in Hilbert spaces and Banach spaces, as well as the use of these iterative methods to approximate the difference between algorithms and their images, where we examined the necessary conditions that guarantee the unity and existence of the solid point. Finally, the results show that resolvent CR-iter

This paper is concerned with the numerical solutions of the vorticity transport equation (VTE) in two-dimensional space with homogenous Dirichlet boundary conditions. Namely, for this problem, the Crank-Nicolson finite difference equation is derived.  In addition, the consistency and stability of the Crank-Nicolson method are studied. Moreover, a numerical experiment is considered to study the convergence of the Crank-Nicolson scheme and to visualize the discrete graphs for the vorticity and stream functions. The analytical result shows that the proposed scheme is consistent, whereas the numerical results show that the solutions are stable with small space-steps and at any time levels.

This paper present the fast and robust approach of English text encryption and decryption based on Pascal matrix. The technique of encryption the Arabic or English text or both and show the result when apply this method on plain text (original message) and how will form the intelligible plain text to be unintelligible plain text in order to secure information from unauthorized access and from steel information, an encryption scheme usually uses a pseudo-random enecryption key generated by an algorithm. All this done by using Pascal matrix. Encryption and decryption are done by using MATLAB as programming language and notepad ++to write the input text.This paper present the fast and robust approach of English text encryption and decryption b