Renchin-Ochir Mijiddorj
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
Renchin-Ochir Mijiddorj has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Tugal Zhanlav
Institute of Mathematics and Digital Technology, Mongolian Academy of Sciences, Ulaanbaatar, Mongolia
8 shared publications T. Zhanlav
National University of Mongolia
6 shared publications- Tugal Zhanlav
Mongolian Academy of Sciences, Bayanzurkh District, Mongolia
3 shared publications - Yuriy Stepanovich Volkov
Sobolev Institute of Mathematics, Novosibirsk, Russia
3 shared publications - Khuder Otgondorj
Mongolian University of Science and Technology
2 shared publications - Khuder Otgondorj
Mongolian University of Science and Technology, Sukhbaatar District Mongolia
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.
- 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
- 1 June 2025
- Published by Pleiades Publishing Ltd in Siberian Advances in Mathematics
- Vol. 35 (2) , 167-178
Applications of the Steklov Smoothing Method to Numerical Differentiation and Construction of Local Quasi-Interpolating Splines
We consider questions on approximation of a function and its derivatives by smoothing Steklov functions. We obtain formulas for numerical differentiation and show that they can be used for construction of integro splines on a uniform mesh. We illustrate efficiency of our method with numerical examples.
- 1 June 2025
- Published by Pleiades Publishing Ltd in Siberian Advances in Mathematics
- Vol. 35 (2) , 167-178
Applications of the Steklov Smoothing Method to Numerical Differentiation and Construction of Local Quasi-Interpolating Splines
We consider questions on approximation of a function and its derivatives by smoothing Steklov functions. We obtain formulas for numerical differentiation and show that they can be used for construction of integro splines on a uniform mesh. We illustrate efficiency of our method with numerical examples.
- Open Access
- 28 October 2024
- Published by Mongolian Journals Online in Proceedings of the Mongolian Academy of Sciences
- p. 24-35
A unified approach to the construction of higher-order derivative-free iterative methods for solving systems of nonlinear equations
In this article, we introduce a unified approach to constructing a higher-order derivative-free scheme based on the approximations of F'(zk)-1. A family of order p=6,7 derivative-free method is proposed and compared to some well-known methods. The necessary and sufficient condition for p-th order of convergence are given in terms of parameter matrices τ(k) and α(k) . Some good choices of and are offered. Numerical experiments were carried out to confirm the theoretical results.
- 28 October 2024
- Published by Mongolian Journals Online in Proceedings of the Mongolian Academy of Sciences
- p. 24-35
Open AccessA unified approach to the construction of higher-order derivative-free iterative methods for solving systems of nonlinear equations
In this article, we introduce a unified approach to constructing a higher-order derivative-free scheme based on the approximations of F'(zk)-1. A family of order p=6,7 derivative-free method is proposed and compared to some well-known methods. The necessary and sufficient condition for p-th order of convergence are given in terms of parameter matrices τ(k) and α(k) . Some good choices of and are offered. Numerical experiments were carried out to confirm the theoretical results.
- 1 March 2024
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 279 (6) , 850-865
Higher-Order Finite-Difference Schemes for Nonlinear Two-Point Boundary Value Problems
- 1 March 2024
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 279 (6) , 850-865
Higher-Order Finite-Difference Schemes for Nonlinear Two-Point Boundary Value Problems
- 21 October 2023
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 48 (7) , 8260-8273
A novel families of higher‐order multistep iterative methods for solving nonlinear systems
In this paper, we propose the first time fifth‐ and sixth‐order two‐step schemes. Based on the proposed two‐step methods, we develop three‐step iterative methods with the ninth‐ and tenth‐order of convergence. We also suggest two parametric families of these schemes. The obtained results are extended to ‐step iterations. The main advantages of the proposed methods are that they are higher order of convergence and utilize only one matrix inversion per iteration which makes these methods computationally more efficient. Numerical experiments are performed to confirm the theoretical results concerning the order of convergence and computational efficiency.
- 21 October 2023
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 48 (7) , 8260-8273
A novel families of higher‐order multistep iterative methods for solving nonlinear systems
In this paper, we propose the first time fifth‐ and sixth‐order two‐step schemes. Based on the proposed two‐step methods, we develop three‐step iterative methods with the ninth‐ and tenth‐order of convergence. We also suggest two parametric families of these schemes. The obtained results are extended to ‐step iterations. The main advantages of the proposed methods are that they are higher order of convergence and utilize only one matrix inversion per iteration which makes these methods computationally more efficient. Numerical experiments are performed to confirm the theoretical results concerning the order of convergence and computational efficiency.
- 1 August 2023
- Published by Springer Nature
- p. 165-185
Optimal Choice of Parameters in Higher-Order Derivative-Free Iterative Methods for Systems of Nonlinear Equations
- 1 August 2023
- Published by Springer Nature
- p. 165-185
Optimal Choice of Parameters in Higher-Order Derivative-Free Iterative Methods for Systems of Nonlinear Equations
- 16 November 2021
- Published by Australian Mathematical Publishing Association, Inc. in The ANZIAM Journal
- Vol. 63, 359-375
Algorithm to construct integro splines
We study some properties of integro splines. Using these properties, we design an algorithm to construct splines \(S_{m+1}(x)\) of neighbouring degrees to the given spline \(S_{m}(x)\) with degree \(m\). A local integro-sextic spline is constructed with the proposed algorithm. The local integro splines work efficiently, that is, they have low computational complexity, and they are effective for use in real time. The construction of nonlocal integro splines usually leads to solving a system of linear equations with band matrices, which yields high computational costs. doi:10.1017/S1446181121000316- 16 November 2021
- Published by Australian Mathematical Publishing Association, Inc. in The ANZIAM Journal
- Vol. 63, 359-375
Algorithm to construct integro splines
We study some properties of integro splines. Using these properties, we design an algorithm to construct splines \(S_{m+1}(x)\) of neighbouring degrees to the given spline \(S_{m}(x)\) with degree \(m\). A local integro-sextic spline is constructed with the proposed algorithm. The local integro splines work efficiently, that is, they have low computational complexity, and they are effective for use in real time. The construction of nonlocal integro splines usually leads to solving a system of linear equations with band matrices, which yields high computational costs. doi:10.1017/S1446181121000316