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.
This paper deals with founding an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to the convex polynomials by means of weighted moduli of smoothness of fractional order , ( , ) p f t . In addition we prove some properties of weighted moduli of smoothness of fractional order.
This paper deals to how to estimate points non measured spatial data when the number of its terms (sample spatial) a few, that are not preferred for the estimation process, because we also know that whenever if the data is large, the estimation results of the points non measured to be better and thus the variance estimate less, so the idea of this paper is how to take advantage of the data other secondary (auxiliary), which have a strong correlation with the primary data (basic) to be estimated single points of non-measured, as well as measuring the variance estimate, has been the use of technique Co-kriging in this field to build predictions spatial estimation process, and then we applied this idea to real data in th
... Show MoreIn this paper, a simple fast lossless image compression method is introduced for compressing medical images, it is based on integrates multiresolution coding along with polynomial approximation of linear based to decompose image signal followed by efficient coding. The test results indicate that the suggested method can lead to promising performance due to flexibility in overcoming the limitations or restrictions of the model order length and extra overhead information required compared to traditional predictive coding techniques.
The main work of this paper is devoted to a new technique of constructing approximated solutions for linear delay differential equations using the basis functions power series functions with the aid of Weighted residual methods (collocations method, Galerkin’s method and least square method).
Proxy-based sliding mode control PSMC is an improved version of PID control that combines the features of PID and sliding mode control SMC with continuously dynamic behaviour. However, the stability of the control architecture maybe not well addressed. Consequently, this work is focused on modification of the original version of the proxy-based sliding mode control PSMC by adding an adaptive approximation compensator AAC term for vibration control of an Euler-Bernoulli beam. The role of the AAC term is to compensate for unmodelled dynamics and make the stability proof more easily. The stability of the proposed control algorithm is systematically proved using Lyapunov theory. Multi-modal equation of motion is derived using the Galerkin metho
... Show MoreA new blind restoration algorithm is presented and shows high quality restoration. This
is done by enforcing Wiener filtering approach in the Fourier domains of the image and the
psf environments
Adsorption and ion exchange are examples of fixed-bed sorption processes that show transient behavior. This means that differential equations are needed to design them. As a result, numerical methods are commonly utilized to solve these equations. The solution frequently used in analytical methods is called the Thomas solution. Thomas gave a complete solution that adds a nonlinear equilibrium relationship that depends on second-order reaction kinetics. A computational approach was devised to solve the Thomas model. The Thomas model's validity was established by conducting three distinct sets of experiments. The first entails the adsorption of acetic acid from the air through the utilization of activated carbon. Following
... Show More