Beny Neta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Beny Neta has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
Changbum Chun
Department of Mathematics, Sungkyunkwan University, Suwon, Republic of Korea
17 shared publicationsFrancis X. Giraldo
6 shared publications- Temur Jangveladze
Ivane Javakhishvili Tbilisi State University
6 shared publications Dan Givoli
Department of Aerospace Engineering and Asher Center for Space Research, Technion, Israel Institute of Technology, Haifa 32000, Israel
5 shared publicationsMelvin Scott
5 shared publications- Zurab Kiguradze
Ilia Vekua Institute of Applied Mathematics of Ivane Javakhishvili Tbilisi State University Tbilisi, Georgia
5 shared publications
Latest Publications
- 24 July 2026
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 250, 883-904
Optimal fourth-order schemes in (p,q)-calculus: Structural asymmetry and dynamical behavior
- 24 July 2026
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 250, 883-904
Optimal fourth-order schemes in (p,q)-calculus: Structural asymmetry and dynamical behavior
- Open Access
- 28 November 2025
- Published by Further Science in Applied Mathematics on Science and Engineering
- Vol. 2 (2) , 37-47
Sierpinski-like carpets
The Sierpinski carpet was developed as a two-dimension extension of the Cantor set. Here we discuss the artistic expression of such carpets along with the development of more visually pleasing Sierpi´nski-like carpets created by using the basins of attraction of iterative methods for the solution of certain nonlinear equations.
- 28 November 2025
- Published by Further Science in Applied Mathematics on Science and Engineering
- Vol. 2 (2) , 37-47
Open AccessSierpinski-like carpets
The Sierpinski carpet was developed as a two-dimension extension of the Cantor set. Here we discuss the artistic expression of such carpets along with the development of more visually pleasing Sierpi´nski-like carpets created by using the basins of attraction of iterative methods for the solution of certain nonlinear equations.
- Open Access
- 4 April 2024
- Published by Qeios Ltd
Review of: "New Computational Methods Using Seventh Derivative Type for the Solution of First Order Initial Value Problems"
The introduction is unclear, and not only because of a lack of knowledge of the English language. The authors try to cover everything, even the trigonometrically-fitted methods that are not used here. The authors of this manuscript discuss the numeri...
- 4 April 2024
- Published by Qeios Ltd
Open AccessReview of: "New Computational Methods Using Seventh Derivative Type for the Solution of First Order Initial Value Problems"
The introduction is unclear, and not only because of a lack of knowledge of the English language. The authors try to cover everything, even the trigonometrically-fitted methods that are not used here. The authors of this manuscript discuss the numeri...
- Open Access
Analysis of Traub’s Method for Cubic Polynomials
The dynamical analysis of Kurchatov’s scheme is extended to Traub’s method. The difference here is that Traub’s method requires two additional starting points. Therefore, the map is three-dimensional instead of 2-D. We obtain a complete description of the dynamical planes and show that the method is stable for cubic polynomials.
Open AccessAnalysis of Traub’s Method for Cubic Polynomials
The dynamical analysis of Kurchatov’s scheme is extended to Traub’s method. The difference here is that Traub’s method requires two additional starting points. Therefore, the map is three-dimensional instead of 2-D. We obtain a complete description of the dynamical planes and show that the method is stable for cubic polynomials.
- Open Access
- 23 November 2023
- Published by Qeios Ltd in Qeios Preprints
Analysis of Traub's method for cubic
The dynamical analysis of the Kurchatov scheme is extended to Traub's method. The difference here is that Traub's method requires two additional starting points. Therefore, the map is 3-dimensional instead of 2-D. We obtain a complete description of the dynamical planes and show that the method is stable for cubic polynomials.
- 23 November 2023
- Published by Qeios Ltd in Qeios Preprints
Open AccessAnalysis of Traub's method for cubic
The dynamical analysis of the Kurchatov scheme is extended to Traub's method. The difference here is that Traub's method requires two additional starting points. Therefore, the map is 3-dimensional instead of 2-D. We obtain a complete description of the dynamical planes and show that the method is stable for cubic polynomials.
- 27 October 2023
- Published by Walter de Gruyter GmbH in Georgian Mathematical Journal
- Vol. 31 (2) , 331-338
Comparison of several numerical solvers for a discretized nonlinear diffusion model with source terms
The numerical solution of the nonlinear system of equations resulting from a real engineering problem is discussed. We use the approximate solution of a system of two nonlinear integrodifferential equations to build the nonlinear system of equations. This system can be solved by Newton’s method if the solution is differentiable, or using some derivative-free methods, such as Steffensen’s method. Here we show that Steffensen’s method does not always converge and secant method requires more iterations than Traub’s method and Newton’s method. We recommend Traub’s method in case the solution is not differentiable.
- 27 October 2023
- Published by Walter de Gruyter GmbH in Georgian Mathematical Journal
- Vol. 31 (2) , 331-338
Comparison of several numerical solvers for a discretized nonlinear diffusion model with source terms
The numerical solution of the nonlinear system of equations resulting from a real engineering problem is discussed. We use the approximate solution of a system of two nonlinear integrodifferential equations to build the nonlinear system of equations. This system can be solved by Newton’s method if the solution is differentiable, or using some derivative-free methods, such as Steffensen’s method. Here we show that Steffensen’s method does not always converge and secant method requires more iterations than Traub’s method and Newton’s method. We recommend Traub’s method in case the solution is not differentiable.
- Open Access
On a Fifth-Order Method for Multiple Roots of Nonlinear Equations
There are several measures for comparing methods for solving a single nonlinear equation. The first is the order of convergence, then the cost to achieve such rate. This cost is measured by counting the number of functions (and derivatives) evaluated at each step. After that, efficiency is defined as a function of the order of convergence and cost. Lately, the idea of basin of attraction is used. This shows how far one can start and still converge to the root. It also shows the symmetry/asymmetry of the method. It was shown that even methods that show symmetry when solving polynomial equations are not so when solving nonpolynomial ones. We will see here that the Euler–Cauchy method (a member of the Laguerre family of methods for multiple roots) is best in the sense that the boundaries of the basins have no lobes. The symmetry in solving a polynomial equation having two roots at with any multiplicity is obvious. In fact, the Euler–Cauchy method converges very fast in this case. We compare one member of a family of fifth-order methods for multiple roots with several well-known lower-order and efficient methods. We will show using a basin of attraction that the fifth-order method cannot compete with most of those lower-order methods.Open AccessOn a Fifth-Order Method for Multiple Roots of Nonlinear Equations
There are several measures for comparing methods for solving a single nonlinear equation. The first is the order of convergence, then the cost to achieve such rate. This cost is measured by counting the number of functions (and derivatives) evaluated at each step. After that, efficiency is defined as a function of the order of convergence and cost. Lately, the idea of basin of attraction is used. This shows how far one can start and still converge to the root. It also shows the symmetry/asymmetry of the method. It was shown that even methods that show symmetry when solving polynomial equations are not so when solving nonpolynomial ones. We will see here that the Euler–Cauchy method (a member of the Laguerre family of methods for multiple roots) is best in the sense that the boundaries of the basins have no lobes. The symmetry in solving a polynomial equation having two roots at with any multiplicity is obvious. In fact, the Euler–Cauchy method converges very fast in this case. We compare one member of a family of fifth-order methods for multiple roots with several well-known lower-order and efficient methods. We will show using a basin of attraction that the fifth-order method cannot compete with most of those lower-order methods. - 12 April 2023
- Published by Walter de Gruyter GmbH in Georgian Mathematical Journal
- Vol. 30 (4) , 539-554
Numerical solution for a nonlinear diffusion model with source terms
The nonlinear diffusion system with source terms is studied. This model is derived via Maxwell equations describing electromagnetic field propagation in media. The uniqueness of the solution and its behavior as are proved. We also prove that the finite difference approximation converges in space and time. Numerical implementation with various experiments for different values of the input parameters is performed to validate the theoretical conclusions.- 12 April 2023
- Published by Walter de Gruyter GmbH in Georgian Mathematical Journal
- Vol. 30 (4) , 539-554
Numerical solution for a nonlinear diffusion model with source terms
The nonlinear diffusion system with source terms is studied. This model is derived via Maxwell equations describing electromagnetic field propagation in media. The uniqueness of the solution and its behavior as are proved. We also prove that the finite difference approximation converges in space and time. Numerical implementation with various experiments for different values of the input parameters is performed to validate the theoretical conclusions.- Open Access
- 29 November 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (23) , 3073
A Note on Traub’s Method for Systems of Nonlinear Equations
Traub’s method was extended here to systems of nonlinear equations and compared to Steffensen’s method. Even though Traub’s method is only of order 1.839 and not quadratic, it performed better in the 10 examples.
- 29 November 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (23) , 3073
Open AccessA Note on Traub’s Method for Systems of Nonlinear Equations
Traub’s method was extended here to systems of nonlinear equations and compared to Steffensen’s method. Even though Traub’s method is only of order 1.839 and not quadratic, it performed better in the 10 examples.
- Open Access
- 13 October 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (20) , 2570
Memorizing Schröder’s Method as an Efficient Strategy for Estimating Roots of Unknown Multiplicity
In this paper, we propose, to the best of our knowledge, the first iterative scheme with memory for finding roots whose multiplicity is unknown existing in the literature. It improves the efficiency of a similar procedure without memory due to Schröder and can be considered as a seed to generate higher order methods with similar characteristics. Once its order of convergence is studied, its stability is analyzed showing its good properties, and it is compared numerically in terms of their basins of attraction with similar schemes without memory for finding multiple roots.
- 13 October 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (20) , 2570
Open AccessMemorizing Schröder’s Method as an Efficient Strategy for Estimating Roots of Unknown Multiplicity
In this paper, we propose, to the best of our knowledge, the first iterative scheme with memory for finding roots whose multiplicity is unknown existing in the literature. It improves the efficiency of a similar procedure without memory due to Schröder and can be considered as a seed to generate higher order methods with similar characteristics. Once its order of convergence is studied, its stability is analyzed showing its good properties, and it is compared numerically in terms of their basins of attraction with similar schemes without memory for finding multiple roots.