Zobrazeno 1 - 10
of 135
pro vyhledávání: '"A. Beggas"'
Publikováno v:
Iranian Journal of Numerical Analysis and Optimization, Vol 14, Iss Issue 4, Pp 991-1015 (2024)
In this article, we apply three numerical methods to study the L∞-convergence of the Newton-multigrid method for parabolic quasi-variational inequalities with a nonlinear right-hand side. To discretize the problem, we utilize a finite element metho
Externí odkaz:
https://doaj.org/article/669f0f9809ed47c5b03a4b42034bb3d1
Autor:
Bouras, L.1, Beggas, A.1 azzeddine-beggas@univ-eloued.d, Sahnoune, D.2, Ghougali, M.1, Ferhat, R.1
Publikováno v:
Chalcogenide Letters. Nov2024, Vol. 21 Issue 11, p917-926. 10p.
Autor:
Ouarda Ben Ali, Mohammed Sadok Mahboub, Soria Zeroual, Samir Bayou, Azzeddine Beggas, Mebrouk Ghougali, Adel Benarfa, Souhaila Meneceur
Publikováno v:
East European Journal of Physics, Iss 1, Pp 278-287 (2024)
In this study, La1-xBixFeO3 (x=0.0, 0.2, 0.4, and 0.6) perovskite nanoparticles were synthesized by a modified Pechini method. Rigorous analysis through XRD and SEM/EDX confirmed the absence of secondary phases in both pure and Bi-substituted LaFeO3
Externí odkaz:
https://doaj.org/article/38213f0872354e2ebbd4055db7021611
Publikováno v:
Journal of Sensor and Actuator Networks, Vol 13, Iss 4, p 36 (2024)
In the rapidly advancing landscape of digital technologies, clustering plays a critical role in the domains of artificial intelligence and big data. Clustering is essential for extracting meaningful insights and patterns from large, intricate dataset
Externí odkaz:
https://doaj.org/article/79ca46727feb461984766ad3a8b7d124
A vertex subset $S$ of a graph $G=(V,E)$ is a $[1,2]$-dominating set if each vertex of $V\backslash S$ is adjacent to either one or two vertices in $S$. The minimum cardinality of a $[1,2]$-dominating set of $G$, denoted by $\gamma_{[1,2]}(G)$, is ca
Externí odkaz:
http://arxiv.org/abs/1906.11966
Autor:
NESBA, Nour El Houda1 nour17nesba@gmail.com, BEGGAS, Mohammed2 beggasmr@gmail.com
Publikováno v:
Communications Series A1 Mathematics & Statistics. 2024, Vol. 73 Issue 1, p222-234. 13p.
Autor:
Beggas, Azzeddine, Kabeel, Abd Elnaby, Abdelgaied, Mohamed., Attia, Mohammed El Hadi, Abdulla, A.S., Abdel-Aziz, Moataz M.
Publikováno v:
In Journal of Energy Storage April 2023 60
Publikováno v:
In Discrete Applied Mathematics 15 November 2022 321:49-63
In this paper, we study the complexity of the edge monitoring problem. A vertex $v$ monitors an edge $e$ if both extremities together with $v$ form a triangle in the graph. Given a graph $G=(V,E)$ and a weight function on edges $c$ where $c(e)$ is th
Externí odkaz:
http://arxiv.org/abs/1710.02013