We present a reliable algorithm for solving, homogeneous or inhomogeneous, nonlinear ordinary delay differential equations with initial conditions. The form of the solution is calculated as a series with easily computable components. Four examples are considered for the numerical illustrations of this method. The results reveal that the semi analytic iterative method (SAIM) is very effective, simple and very close to the exact solution demonstrate reliability and efficiency of this method for such problems.
The aim of this paper is to introduce the concepts of asymptotically p-contractive and asymptotically severe accretive mappings. Also, we give an iterative methods (two step-three step) for finite family of asymptotically p-contractive and asymptotically severe accretive mappings to solve types of equations.
The aim of this paper, is to study different iteration algorithms types two steps called, modified SP, Ishikawa, Picard-S iteration and M-iteration, which is faster than of others by using like contraction mappings. On the other hand, the M-iteration is better than of modified SP, Ishikawa and Picard-S iterations. Also, we support our analytic proof with a numerical example.
The main goal of this paper is to dualize the two concepts St-closed submodule and semi-extending module which were given by Ahmed and Abbas in 2015. These dualizations are called CSt-closed submodule and cosemi-extending mod- ule. Many important properties of these dualizations are investigated, as well as some others useful results which mentioned by those authors are dualized. Furthermore, the relationships of cosemi-extending and other related modules are considered.
In this research, a new application has been developed for games by using the generalization of the separation axioms in topology, in particular regular, Sg-regular and SSg- regular spaces. The games under study consist of two players and the victory of the second player depends on the strategy and choice of the first player. Many regularity, Sg, SSg regularity theorems have been proven using this type of game, and many results and illustrative examples have been presented
Numerical simulations are carried out to assess the quality of the circular and square apodize apertures in observing extrasolar planets. The logarithmic scale of the normalized point spread function of these apertures showed sharp decline in the radial frequency components reaching to 10-36 and 10-34 respectively and demonstrating promising results. This decline is associated with an increase in the full width of the point spread function. A trade off must be done between this full width and the radial frequency components to overcome the problem of imaging extrasolar planets.
In this study, the flow and heat transfer characteristics of Al2O3-water nanofluids for a range of the Reynolds number of 3000, 4500, 6000 and 7500 with a range of volume concentration of 1%, 2%, 3% and 4% are studied numerically. The test rig consists of cold liquid loop, hot liquid loop and the test section which is counter flow double pipe heat exchanger with 1m length. The inner tube is made of smooth copper with diameter of 15mm. The outer tube is made of smooth copper with diameter of 50mm. The hot liquid flows through the outer tube and the cold liquid (or nanofluid) flow through the inner tube. The boundary condition of this study is thermally insulated the outer wall with uniform velocity a
... Show MoreThe purpose of this paper is to study a new types of compactness in the dual bitopological spaces. We shall introduce the concepts of L-pre- compactness and L-semi-P- compactness .
In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .