For many problems in Physics and Computational Fluid Dynamics (CFD), providing an accurate approximation of derivatives is a challenging task. This paper presents a class of high order numerical schemes for approximating the first derivative. These approximations are derived based on solving a special system of equations with some unknown coefficients. The construction method provides numerous types of schemes with different orders of accuracy. The accuracy of each scheme is analyzed by using Fourier analysis, which illustrates the dispersion and dissipation of the scheme. The polynomial technique is used to verify the order of accuracy of the proposed schemes by obtaining the error terms. Dispersion and dissipation errors are calculated

In this paper, the proposed phase fitted and amplification fitted of the Runge-Kutta-Fehlberg method were derived on the basis of existing method of 4(5) order to solve ordinary differential equations with oscillatory solutions. The recent method has null phase-lag and zero dissipation properties. The phase-lag or dispersion error is the angle between the real solution and the approximate solution. While the dissipation is the distance of the numerical solution from the basic periodic solution. Many of problems are tested over a long interval, and the numerical results have shown that the present method is more precise than the 4(5) Runge-Kutta-Fehlberg method.

This Book is intended to be textbook studied for undergraduate course in multivariate analysis. This book is designed to be used in semester system. In order to achieve the goals of the book, it is divided into the following chapters (as done in the first edition 2019). Chapter One introduces matrix algebra. Chapter Two devotes to Linear Equation System Solution with quadratic forms, Characteristic roots & vectors. Chapter Three discusses Partitioned Matrices and how to get Inverse, Jacobi and Hessian matrices. Chapter Four deals with Multivariate Normal Distribution (MVN). Chapter Five concern with Joint, Marginal and Conditional Normal Distribution, independency and correlations. While the revised new chapters have been added (as the curr

This Book is intended to be textbook studied for undergraduate course in multivariate analysis. This book is designed to be used in semester system. In order to achieve the goals of the book, it is divided into the following chapters (as done in the first edition 2019). Chapter One introduces matrix algebra. Chapter Two devotes to Linear Equation System Solution with quadratic forms, Characteristic roots & vectors. Chapter Three discusses Partitioned Matrices and how to get Inverse, Jacobi and Hessian matrices. Chapter Four deals with Multivariate Normal Distribution (MVN). Chapter Five concern with Joint, Marginal and Conditional Normal Distribution, independency and correlations. While the revised new chapters have been added (as the curr

Markov chains are an application of stochastic models in operation research, helping the analysis and optimization of processes with random events and transitions. The method that will be deployed to obtain the transient solution to a Markov chain problem is an important part of this process. The present paper introduces a novel Ordinary Differential Equation (ODE) approach to solve the Markov chain problem. The probability distribution of a continuous-time Markov chain with an infinitesimal generator at a given time is considered, which is a resulting solution of the Chapman-Kolmogorov differential equation. This study presents a one-step second-derivative method with better accuracy in solving the first-order Initial Value Problem

In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex.