There 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.
Let be a ring with identity. Recall that a submodule of a left -module is called strongly essential if for any nonzero subset of , there is such that , i.e., . This paper introduces a class of submodules called se-closed, where a submodule of is called se-closed if it has no proper strongly essential extensions inside . We show by an example that the intersection of two se-closed submodules may not be se-closed. We say that a module is have the se-Closed Intersection Property, briefly se-CIP, if the intersection of every two se-closed submodules of is again se-closed in . Several characterizations are introduced and studied for each of these concepts. We prove for submodules and of that a module has the
... Show MoreLet R be a ring with 1 and W is a left Module over R. A Submodule D of an R-Module W is small in W(D ≪ W) if whenever a Submodule V of W s.t W = D + V then V = W. A proper Submodule Y of an R-Module W is semismall in W(Y ≪_S W) if Y = 0 or Y/F ≪ W/F ∀ nonzero Submodules F of Y. A Submodule U of an R-Module E is essentially semismall(U ≪es E), if for every non zero semismall Submodule V of E, V∩U ≠ 0. An R-Module E is essentially semismall quasi-Dedekind(ESSQD) if Hom(E/W, E) = 0 ∀ W ≪es E. A ring R is ESSQD if R is an ESSQD R-Module. An R-Module E is a scalar R-Module if, ∀ , ∃ s.t V(e) = ze ∀ . In this paper, we study the relationship between ESSQD Modules with scalar and multiplication Modules. We show that
... Show MoreThe goal of this research is to solve several one-dimensional partial differential equations in linear and nonlinear forms using a powerful approximate analytical approach. Many of these equations are difficult to find the exact solutions due to their governing equations. Therefore, examining and analyzing efficient approximate analytical approaches to treat these problems are required. In this work, the homotopy analysis method (HAM) is proposed. We use convergence control parameters to optimize the approximate solution. This method relay on choosing with complete freedom an auxiliary function linear operator and initial guess to generate the series solution. Moreover, the method gives a convenient way to guarantee the converge
... Show MoreThe aim of this paper is to design fast neural networks to approximate periodic functions, that is, design a fully connected networks contains links between all nodes in adjacent layers which can speed up the approximation times, reduce approximation failures, and increase possibility of obtaining the globally optimal approximation. We training suggested network by Levenberg-Marquardt training algorithm then speeding suggested networks by choosing most activation function (transfer function) which having a very fast convergence rate for reasonable size networks. In all algorithms, the gradient of the performance function (energy function) is used to determine how to
... Show MoreThis paper investigates an effective computational method (ECM) based on the standard polynomials used to solve some nonlinear initial and boundary value problems appeared in engineering and applied sciences. Moreover, the effective computational methods in this paper were improved by suitable orthogonal base functions, especially the Chebyshev, Bernoulli, and Laguerre polynomials, to obtain novel approximate solutions for some nonlinear problems. These base functions enable the nonlinear problem to be effectively converted into a nonlinear algebraic system of equations, which are then solved using Mathematica®12. The improved effective computational methods (I-ECMs) have been implemented to solve three applications involving
... Show MoreThere is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that
... Show MoreIn this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.
The research is an article that teaches some classes of fully stable Banach - Å modules. By using Unital algebra studies the properties and characterizations of all classes of fully stable Banach - Å modules. All the results are existing, and they've been listed to complete the requested information.
Let M be an R-module, where R is commutative ring with unity. In this paper we study the behavior of strongly hollow and quasi hollow submodule in the class of strongly comultiplication modules. Beside this we give the relationships between strongly hollow and quasi hollow submodules with V-coprime, coprime, bi-hollow submodules.