Hani Khashan - Academia.edu (original) (raw)
Uploads
Papers by Hani Khashan
Turkish Journal of Mathematics, 2009
In this paper, we study some of the properties of gr-multiplication ideals in a graded ring R . W... more In this paper, we study some of the properties of gr-multiplication ideals in a graded ring R . We first characterize finitely generated gr-multiplication ideals and then give a characterization of gr-multiplication ideals by using the gr-localization of R . Finally we determine the set of gr-P -primary ideals of R when P is a gr-multiplication gr-prime ideal of R .
Vietnam Journal of Mathematics, 2016
Journal of the Egyptian Mathematical Society, 2015
Acta Mathematica Scientia, 2012
In this article, we define almost prime submodules as a new generalization of prime and weakly pr... more In this article, we define almost prime submodules as a new generalization of prime and weakly prime submodules of unitary modules over a commutative ring with identity. We study some basic properties of almost prime submodules and give some characterizations of them, especially for (finitely generated faithful) multiplication modules.
Chaos, Solitons & Fractals, 2008
In this paper we use the conjugate gradient predictor corrector method (CGPCM) in the context of ... more In this paper we use the conjugate gradient predictor corrector method (CGPCM) in the context of continuation methods. By exploiting symmetry in certain nonlinear eigenvalue problems, we can decompose the centered difference discretization matrices into small ones and reduce computational cost. We use the cyclic group of order two to divide the system into two smaller systems. We reduce the cost and the computational time by combining CGPCM with the idea of the exploiting symmetries. Theoretical and numerical results are presented. Conclusions are given.
International Journal of Computer Mathematics, 2011
ABSTRACT We present a new method for computing zeros of polynomial systems using the algebraic so... more ABSTRACT We present a new method for computing zeros of polynomial systems using the algebraic solver and the QR-method. It is based on the theory of algebraic solvers. The unstable calculation of the determinant of the large matrix is replaced by a stable technique using the QR-method. Algorithms and numerical results are presented.
Turkish Journal of Mathematics, 2009
In this paper, we study some of the properties of gr-multiplication ideals in a graded ring R . W... more In this paper, we study some of the properties of gr-multiplication ideals in a graded ring R . We first characterize finitely generated gr-multiplication ideals and then give a characterization of gr-multiplication ideals by using the gr-localization of R . Finally we determine the set of gr-P -primary ideals of R when P is a gr-multiplication gr-prime ideal of R .
Vietnam Journal of Mathematics, 2016
Journal of the Egyptian Mathematical Society, 2015
Acta Mathematica Scientia, 2012
In this article, we define almost prime submodules as a new generalization of prime and weakly pr... more In this article, we define almost prime submodules as a new generalization of prime and weakly prime submodules of unitary modules over a commutative ring with identity. We study some basic properties of almost prime submodules and give some characterizations of them, especially for (finitely generated faithful) multiplication modules.
Chaos, Solitons & Fractals, 2008
In this paper we use the conjugate gradient predictor corrector method (CGPCM) in the context of ... more In this paper we use the conjugate gradient predictor corrector method (CGPCM) in the context of continuation methods. By exploiting symmetry in certain nonlinear eigenvalue problems, we can decompose the centered difference discretization matrices into small ones and reduce computational cost. We use the cyclic group of order two to divide the system into two smaller systems. We reduce the cost and the computational time by combining CGPCM with the idea of the exploiting symmetries. Theoretical and numerical results are presented. Conclusions are given.
International Journal of Computer Mathematics, 2011
ABSTRACT We present a new method for computing zeros of polynomial systems using the algebraic so... more ABSTRACT We present a new method for computing zeros of polynomial systems using the algebraic solver and the QR-method. It is based on the theory of algebraic solvers. The unstable calculation of the determinant of the large matrix is replaced by a stable technique using the QR-method. Algorithms and numerical results are presented.