In this paper we present the theoretical foundation of forward error analysis of numerical algorithms under;• Approximations in "built-in" functions.• Rounding errors in arithmetic floating-point operations.• Perturbations of data.The error analysis is based on linearization method. The fundamental tools of the forward error analysis are system of linear absolute and relative a prior and a posteriori error equations and associated condition numbers constituting optimal of possible cumulative round – off errors. The condition numbers enable simple general, quantitative bounds definitions of numerical stability. The theoretical results have been applied a Gaussian elimination, and have proved to be very effective means of both a priori and a posteriori error analysis.
The aim of this paper is to study the Zariski topology of a commutative KU-algebra. Firstly, we introduce new concepts of a KU-algebra, such as KU-lattice, involutory ideal and prime ideal and investigate some basic properties of these concepts. Secondly, the notion of the topology spectrum of a commutative KU-algebra is studied and several properties of this topology are provided. Also, we study the continuous map of this topological space.
We used to think of grammar as the bones of the language and vocabulary as the flesh to be added given that language consisted largely of life generated chunks of lexis. This “skeleton image” has been proverbially used to refer to that central feature of lexis named collocation- an idea that for the first 15 years of language study and analysis gave a moment‟s thought to English classroom material and methodology.
The work of John Sinclair, Dave Willis, Ron Carter, Michael McCarthy, Michael Lewis, and many others have all contributed to the way teachers today approach the area of lexis and what it means in the teaching/learning process of the language. This also seems to have incorporated lexical ideas into the teaching mechanis
A new definition of a graph called Pure graph of a ring denote Pur(R) was presented , where the vertices of the graph represent the elements of R such that there is an edge between the two vertices ???? and ???? if and only if ????=???????? ???????? ????=????????, denoted by pur(R) . In this work we studied some new properties of pur(R) finally we defined the complement of pur(R) and studied some of it is properties
The concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter, circumference, independence number, clique number, vertex connectivity, spectra, and Laplacian spectra of the order sum graph are determined. Characterizations of the order sum graph to be complete, perfect, etc. are also obtained.
An energy and exergy thermodynamic analysis using EES program was done for a domestic refrigerator working with R-134a using vapor compression refrigeration cycle. The analysis deals with the system component, i.e. compressor, condenser, evaporator and the expansion device. The analysis depends on the entropy generation minimization approach to improve the refrigerator performance by exploring the optimum design points. These design points were derived from three different theories governing the entropy generation minimization using exergy analyzing method. These theories were first applied to find the optimum balance between the hot inner condenser area and the cold inner evaporator area of the refrigerator and between
... Show MoreIn this study, a brand-new graph definition known Associate graph of a ring R denote Ass(R) is present, where the graph’s vertices stand in for R’s elements s.t, any two vertices α and β merage by an edge if and only if α = rβ and β = sα. In this paper, we investigated some new property of Ass (R) are studied., the complement of Ass (R) is finally defined and a few of its characteristics are researched.
Most of the Weibull models studied in the literature were appropriate for modelling a continuous random variable which assumes the variable takes on real values over the interval [0,∞]. One of the new studies in statistics is when the variables take on discrete values. The idea was first introduced by Nakagawa and Osaki, as they introduced discrete Weibull distribution with two shape parameters q and β where 0 < q < 1 and b > 0. Weibull models for modelling discrete random variables assume only non-negative integer values. Such models are useful for modelling for example; the number of cycles to failure when components are subjected to cyclical loading. Discrete Weibull models can be obta
... Show More