Tugal Zhanlav
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tugal Zhanlav has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Khuder Otgondorj
Mongolian University of Science and Technology
12 shared publications - Renchin-Ochir Mijiddorj
Mongolian National University of Education, Ulaanbaatar, Mongolia
8 shared publications - Yuriy Stepanovich Volkov
Sobolev Institute of Mathematics, Novosibirsk, Russia
3 shared publications - Barintag Saheya
College of Mathematics Science, Inner Mongolia Normal University, Hohhot, China
2 shared publications - Ochbadrakh Chuluunbaatar
Joint Institute for Nuclear Research
2 shared publications - Ochbadrakh Chuluunbaatar
Mongolian Academy of Sciences
2 shared publications
Latest Publications
- 30 July 2026
- Published by Pleiades Publishing Ltd in Siberian Mathematical Journal
- Vol. 67 (4) , 774-784
Formulas for Quasi-Interpolation by Integral Quadratic Splines
We consider the problem of approximating a function by integral quadratic splines, also known as integro quadratic splines, from the known integral averages over the mesh intervals. It is shown that, in the mean interpolation problem, an integral quadratic spline can be defined in terms of an interpolating cubic spline. Since interpolating cubic splines have been studied quite well, some of their properties can be transferred to integral quadratic splines. We propose formulas for quasi-interpolation by integral quadratic splines. The problem of local approximation by integral splines is considered for the first time on an arbitrary nonuniform mesh. On a uniform mesh, we find all superconvergence points for mean interpolation and quasi-interpolation, i.e., the points at which the approximation order increases. It is shown that the jump (the ratio of the magnitude of the discontinuity to the mesh size) of the second derivative of both splines approximates the third derivative with fourth-order accuracy.
- 30 July 2026
- Published by Pleiades Publishing Ltd in Siberian Mathematical Journal
- Vol. 67 (4) , 774-784
Formulas for Quasi-Interpolation by Integral Quadratic Splines
We consider the problem of approximating a function by integral quadratic splines, also known as integro quadratic splines, from the known integral averages over the mesh intervals. It is shown that, in the mean interpolation problem, an integral quadratic spline can be defined in terms of an interpolating cubic spline. Since interpolating cubic splines have been studied quite well, some of their properties can be transferred to integral quadratic splines. We propose formulas for quasi-interpolation by integral quadratic splines. The problem of local approximation by integral splines is considered for the first time on an arbitrary nonuniform mesh. On a uniform mesh, we find all superconvergence points for mean interpolation and quasi-interpolation, i.e., the points at which the approximation order increases. It is shown that the jump (the ratio of the magnitude of the discontinuity to the mesh size) of the second derivative of both splines approximates the third derivative with fourth-order accuracy.
- Open Access
- 9 July 2026
- Published by Springer Nature in Soft Computing
- Vol. 30 (7) , 4765-4782
A third-order-convergence improved Newton method and its numerical performance
- 9 July 2026
- Published by Springer Nature in Soft Computing
- Vol. 30 (7) , 4765-4782
Open AccessA third-order-convergence improved Newton method and its numerical performance
- Open Access
- 30 April 2026
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 34 (1)
Derivative-free iterations in $R^n$ with point-wise operations for solving systems of nonlinear equationsIn this paper, we develop a new family of high-order derivative-free iterative methods for solving systems of nonlinear equations. Specifically, we propose four two-step derivative-free schemes with convergence orders four and five, together with twelve three-step derivative-free schemes achieving convergence orders six, seven, and eight. The main specific of these iterations is that they include a vector or even a scalar iteration parameter instead of the matrix parameter inherent to other existing iterative methods. This structural simplification significantly reduces computational cost, storage requirements, and matrix operations, thereby improving overall computational efficiency. A convergence analysis is presented, establishing the theoretical order of convergence of the proposed methods. The efficiency indices of the proposed schemes are derived and compared with those of several well-known derivative-free iterative methods. The numerical experiments on standard academic problems confirm the theoretical results and demonstrate that the proposed methods are competitive and, in many cases, superior in terms of efficiency and robustness.
- 30 April 2026
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 34 (1)
Open AccessDerivative-free iterations in $R^n$ with point-wise operations for solving systems of nonlinear equationsIn this paper, we develop a new family of high-order derivative-free iterative methods for solving systems of nonlinear equations. Specifically, we propose four two-step derivative-free schemes with convergence orders four and five, together with twelve three-step derivative-free schemes achieving convergence orders six, seven, and eight. The main specific of these iterations is that they include a vector or even a scalar iteration parameter instead of the matrix parameter inherent to other existing iterative methods. This structural simplification significantly reduces computational cost, storage requirements, and matrix operations, thereby improving overall computational efficiency. A convergence analysis is presented, establishing the theoretical order of convergence of the proposed methods. The efficiency indices of the proposed schemes are derived and compared with those of several well-known derivative-free iterative methods. The numerical experiments on standard academic problems confirm the theoretical results and demonstrate that the proposed methods are competitive and, in many cases, superior in terms of efficiency and robustness.
- 1 March 2026
- Published by Springer Nature in Computational Mathematics and Modeling
- Vol. 37 (1) , 163-174
Approximation of solutions to nonlinear two-point boundary value problems using quintic splines
- 1 March 2026
- Published by Springer Nature in Computational Mathematics and Modeling
- Vol. 37 (1) , 163-174
Approximation of solutions to nonlinear two-point boundary value problems using quintic splines
- 2 January 2026
- Published by Springer Nature
- p. 158-175
A Family of Multi-step Derivative-Free Iterations for Solving Nonlinear Systems
- 2 January 2026
- Published by Springer Nature
- p. 158-175
A Family of Multi-step Derivative-Free Iterations for Solving Nonlinear Systems
- Open Access
- 25 December 2025
- Published by Mongolian Journals Online in Mongolian Mathematical Journal
- Vol. 26, 42-55
Fully explicit and super-efficient iterative methods for solving systems of nonlinear equations
In this paper, we propose novel fully explicit and super-efficient iterative methods for solving systems of nonlinear equations. The proposed methods are matrix-free and do not require expensive operations such as matrix inversion or matrix multiplication; instead, they involve only vector operations. As a result, they are easy to implement with O(n2) computational complexity, whereas other existing iterative methods typically have O(n3) complexity. Numerical experiments are presented to demonstrate the effectiveness, robustness, and superior performance of the proposed iterative methods.
- 25 December 2025
- Published by Mongolian Journals Online in Mongolian Mathematical Journal
- Vol. 26, 42-55
Open AccessFully explicit and super-efficient iterative methods for solving systems of nonlinear equations
In this paper, we propose novel fully explicit and super-efficient iterative methods for solving systems of nonlinear equations. The proposed methods are matrix-free and do not require expensive operations such as matrix inversion or matrix multiplication; instead, they involve only vector operations. As a result, they are easy to implement with O(n2) computational complexity, whereas other existing iterative methods typically have O(n3) complexity. Numerical experiments are presented to demonstrate the effectiveness, robustness, and superior performance of the proposed iterative methods.
- Open Access
- 22 December 2025
- Published by Mongolian Journals Online in Mongolian Mathematical Journal
- Vol. 26, 20-41
Design and extension of higher-Order derivative-free iterative methods for nonlinear systems
In this paper, we propose derivative-free two- and three-step iterative methods with easy implementation. Moreover, we suggest suitable parameter choices that guarantee a local convergence order ρ from four to eight. They require only one matrix inversion at each iteration step and belong to the class of best iterations with high efficiency indices. Several of the proposed algorithms are multidimensional extensions of well-known scalar iterative methods. Numerical experiments are presented to verify the theoretical orders of convergence and to demonstrate the computational efficiency of the proposed methods.
- 22 December 2025
- Published by Mongolian Journals Online in Mongolian Mathematical Journal
- Vol. 26, 20-41
Open AccessDesign and extension of higher-Order derivative-free iterative methods for nonlinear systems
In this paper, we propose derivative-free two- and three-step iterative methods with easy implementation. Moreover, we suggest suitable parameter choices that guarantee a local convergence order ρ from four to eight. They require only one matrix inversion at each iteration step and belong to the class of best iterations with high efficiency indices. Several of the proposed algorithms are multidimensional extensions of well-known scalar iterative methods. Numerical experiments are presented to verify the theoretical orders of convergence and to demonstrate the computational efficiency of the proposed methods.
- Open Access
- 16 December 2025
- Published by Mongolian Journals Online in Mongolian Mathematical Journal
- Vol. 26, 1-19
A family of the best iterative methods for systems of nonlinear equations
In this paper, we develop an iterative method with scalar and vector coefficients, exhibiting convergence orders (4 ≤ ρ ≤ 8) for solving nonlinear systems and further extend it to m-step formulations. All of these methods require only a single inversion of the Jacobian matrix per iteration. We define concepts such as best iterative methods, which require a minimum total cost, allowing us to classify both new and existing methods in terms of their effectiveness. The computational efficiency of the proposed techniques is discussed and compared with existing methods. Moreover, the basin of attraction method is studied for nonlinear systems to validate our findings and identify the most effective methods, while a dynamical analysis confirms the scheme’s superior stability and extensive convergence regions. Finally, numerical experiments confirm and validate the theoretical results and demonstrate their effectiveness. Mathematics Subject Classification: 65H05,65D05.
- 16 December 2025
- Published by Mongolian Journals Online in Mongolian Mathematical Journal
- Vol. 26, 1-19
Open AccessA family of the best iterative methods for systems of nonlinear equations
In this paper, we develop an iterative method with scalar and vector coefficients, exhibiting convergence orders (4 ≤ ρ ≤ 8) for solving nonlinear systems and further extend it to m-step formulations. All of these methods require only a single inversion of the Jacobian matrix per iteration. We define concepts such as best iterative methods, which require a minimum total cost, allowing us to classify both new and existing methods in terms of their effectiveness. The computational efficiency of the proposed techniques is discussed and compared with existing methods. Moreover, the basin of attraction method is studied for nonlinear systems to validate our findings and identify the most effective methods, while a dynamical analysis confirms the scheme’s superior stability and extensive convergence regions. Finally, numerical experiments confirm and validate the theoretical results and demonstrate their effectiveness. Mathematics Subject Classification: 65H05,65D05.
- Open Access
- 7 December 2025
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 33 (4)
Optimal eight-order three-step iterative methods for solving systems of nonlinear equations
In this paper, we for the first time propose the extension of optimal eighth-order methods to multidimensional case. It is shown that these extensions maintained the optimality properties of the original methods. The computational efficiency of the proposed methods is compared with that of known methods. Numerical experiments are included to confirm the theoretical results and to demonstrate the efficiency of the methods.
- 7 December 2025
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 33 (4)
Open AccessOptimal eight-order three-step iterative methods for solving systems of nonlinear equations
In this paper, we for the first time propose the extension of optimal eighth-order methods to multidimensional case. It is shown that these extensions maintained the optimality properties of the original methods. The computational efficiency of the proposed methods is compared with that of known methods. Numerical experiments are included to confirm the theoretical results and to demonstrate the efficiency of the methods.
- 1 December 2025
- Published by Krasovskii Institute of Mathematics and Mechanics UB RAS in Trudy Instituta Matematiki i Mekhaniki UrO RAN
- Vol. 31 (4)
О краевых условиях для интегральных квадратических сплайнов при интерполяции в среднем
УДК 519.65 MSC: 41A15 DOI: 10.21538/0134-4889-2025-31-4-95-105 Исследование первого автора проведено в рамках государственного задания ИМ СО РАН (проект FWNF–2022–0015). Исследуется задача восстановления функции, где вместо значений функции в определенных точках отрезка известны интегрально усредненные значения по промежуткам. Ю. Н. Субботин предложил называть такую задачу
- 1 December 2025
- Published by Krasovskii Institute of Mathematics and Mechanics UB RAS in Trudy Instituta Matematiki i Mekhaniki UrO RAN
- Vol. 31 (4)
О краевых условиях для интегральных квадратических сплайнов при интерполяции в среднем
УДК 519.65 MSC: 41A15 DOI: 10.21538/0134-4889-2025-31-4-95-105 Исследование первого автора проведено в рамках государственного задания ИМ СО РАН (проект FWNF–2022–0015). Исследуется задача восстановления функции, где вместо значений функции в определенных точках отрезка известны интегрально усредненные значения по промежуткам. Ю. Н. Субботин предложил называть такую задачу