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.
Our main interest in this study is to look for soft semi separations axioms in soft quad topological spaces. We talk over and focus our attention on soft semi separation axioms in soft quad topological spaces with respect to ordinary points and soft points. Moreover study the inherited characteristics at different angles with respect to ordinary points and soft points. Some of their central properties in soft quad topological spaces are also brought under examination.
In this paper, the computational method (CM) based on the standard polynomials has been implemented to solve some nonlinear differential equations arising in engineering and applied sciences. Moreover, novel computational methods have been developed in this study by orthogonal base functions, namely Hermite, Legendre, and Bernstein polynomials. The nonlinear problem is successfully converted into a nonlinear algebraic system of equations, which are then solved by Mathematica®12. The developed computational methods (D-CMs) have been applied to solve three applications involving well-known nonlinear problems: the Darcy-Brinkman-Forchheimer equation, the Blasius equation, and the Falkner-Skan equation, and a comparison between t
... Show MoreIn this paper we introduce a new class of degree of best algebraic approximation polynomial Α,, for unbounded functions in weighted space Lp,α(X), 1 ∞ .We shall prove direct and converse theorems for best algebraic approximation in terms modulus of smoothness in weighted space
In this paper we investigate the use of two types of local search methods (LSM), the Simulated Annealing (SA) and Particle Swarm Optimization (PSO), to solve the problems ( ) and . The results of the two LSMs are compared with the Branch and Bound method and good heuristic methods. This work shows the good performance of SA and PSO compared with the exact and heuristic methods in terms of best solutions and CPU time.
In this paper generalized spline method is used for solving linear system of fractional integro-differential equation approximately. The suggested method reduces the system to system of linear algebraic equations. Different orders of fractional derivative for test example is given in this paper to show the accuracy and applicability of the presented method.
Abstract
This study aims to identify the repercussions of the Corona pandemic (Covid 19) and its impact on the educational and psychological functions of the Omani family from the point of view of a number of fathers and mothers. Drive for a group of fathers and mothers, some of whom work in the government sector and others are mothers enrolled in graduate studies programs at the university, their ages range between (30-50 years) totally (28) mothers and fathers: 22 mothers and 6 fathers. The results showed that the repercussions of the transformation of e-learning, home quarantine, social distancing, and the challenges associated with them were among the most frequent responses that posed a real challenge to the
... Show MoreThere are two (non-equivalent) generalizations of Von Neuman regular rings to modules; one in the sense of Zelmanowize which is elementwise generalization, and the other in the sense of Fieldhowse. In this work, we introduced and studied the approximately regular modules, as well as many properties and characterizations are considered, also we study the relation between them by using approximately pointwise-projective modules.
The theory of general topology view for continuous mappings is general version and is applied for topological graph theory. Separation axioms can be regard as tools for distinguishing objects in information systems. Rough theory is one of map the topology to uncertainty. The aim of this work is to presented graph, continuity, separation properties and rough set to put a new approaches for uncertainty. For the introduce of various levels of approximations, we introduce several levels of continuity and separation axioms on graphs in Gm-closure approximation spaces.
This book includes three main chapters: 1. Functions & Their Derivatives. 2. Minimum, Maximum and Inflection points. 3. Partial Derivative. In addition to many examples and exercises for the purpose of acquiring the student's ability to think correctly in solving mathematical questions.
The modern systems that have been based upon the hash function are more suitable compared to the conventional systems; however, the complicated algorithms for the generation of the invertible functions have a high level of time consumption. With the use of the GAs, the key strength is enhanced, which results in ultimately making the entire algorithm sufficient. Initially, the process of the key generation is performed by using the results of n-queen problem that is solved by the genetic algorithm, with the use of a random number generator and through the application of the GA operations. Ultimately, the encryption of the data is performed with the use of the Modified Reverse Encryption Algorithm (MREA). It was noticed that the
... Show More