In this work, an analytical approximation solution is presented, as well as a comparison of the Variational Iteration Adomian Decomposition Method (VIADM) and the Modified Sumudu Transform Adomian Decomposition Method (M STADM), both of which are capable of solving nonlinear partial differential equations (NPDEs) such as nonhomogeneous Kertewege-de Vries (kdv) problems and the nonlinear Klein-Gordon. The results demonstrate the solution’s dependability and excellent accuracy.

Praise be to God, who said: {And establish prayer and pay zakat and lend to God a good loan, and whatever good you put forward for yourselves you will find with God. It is better and greater in reward. Ask forgiveness of God. Indeed, God is Forgiving, Most Merciful. May blessings and peace be upon Muhammad, the servant of God, and His Messenger, may God bless him and grant him peace, who said: “Islam is built on five Testifying that there is no god but God and that Muhammad is the Messenger of God, establishing prayer, paying zakat, Hajj, and fasting Ramadan” ().
Now that follows: Islamic law aims to make man happy in this world and the afterlife, starting with faith in God Almighty until the end of the legal obligations. This is

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app

A new class of higher derivatives  for harmonic univalent functions defined by a generalized fractional integral operator inside an open unit disk E is the aim of this paper.

A mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc