This paper presents a new nonstationary iterative method for solving non linear algebraic equations that does not require the use of any derivative. The study uses only the Newton’s divided differences of first and s...This paper presents a new nonstationary iterative method for solving non linear algebraic equations that does not require the use of any derivative. The study uses only the Newton’s divided differences of first and second orders instead of the derivatives of (1).展开更多
Contrary to the opinion about approximation nature of a simple-iteration method, the exact solution of a system of linear algebraic equations (SLAE) in a finite number of iterations with a stationary matrix is demonst...Contrary to the opinion about approximation nature of a simple-iteration method, the exact solution of a system of linear algebraic equations (SLAE) in a finite number of iterations with a stationary matrix is demonstrated. We present a theorem and its proof that confirms the possibility to obtain the finite process and imposes the requirement for the matrix of SLAE. This matrix must be unipotent, i.e. all its eigenvalues to be equal to 1. An example of transformation of SLAE given analytically to the form with a unipotent matrix is presented. It is shown that splitting the unipotent matrix into identity and nilpotent ones results in Cramer’s analytical formulas in a finite number of iterations.展开更多
The recent result of an orbit continuation algorithm has provided a rigorous method for long-term numerical integration of an orbit on the unstable manifold of a periodic solution.This algorithm is matrix-free and emp...The recent result of an orbit continuation algorithm has provided a rigorous method for long-term numerical integration of an orbit on the unstable manifold of a periodic solution.This algorithm is matrix-free and employs a combination of the Newton-Raphson method and the Krylov subspace method.Moreover,the algorithm adopts a multiple shooting method to address the problem of orbital instability due to long-term numerical integration.The algorithm is described through computing the extension of unstable manifold of a recomputed Nagata′s lowerbranch steady solution of plane Couette flow,which is an example of an exact coherent state that has recently been studied in subcritical transition to turbulence.展开更多
For a specific combustion problem involving calculations of several species at the equilibrium state, it is simpler to write a general computer program and calculate the combustion concentration. Original work describ...For a specific combustion problem involving calculations of several species at the equilibrium state, it is simpler to write a general computer program and calculate the combustion concentration. Original work describes, an adaptation of Newton-Raphson method was used for solving the highly nonlinear system of equations describing the formation of equilibrium products in reacting of fuel-additive-air mixtures. This study also shows what possible of the results. In this paper, to be present the efficient numerical algorithms for. solving the combustion problem, to be used nonlinear equations based on the iteration method and high order of the Taylor series. The modified Adomian decomposition method was applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms. Comparisons of results by the new Matlab routines and previous routines, the result data indicate that the new Matlab routines are reliable, typical deviations from previous results are less than 0.05%.展开更多
This paper presents an explicit formula based on reparameterization technique for progressively computing a simple root of a smooth function,which may have wide applications in robotics,geomagnetic navigation,geometri...This paper presents an explicit formula based on reparameterization technique for progressively computing a simple root of a smooth function,which may have wide applications in robotics,geomagnetic navigation,geometric processing and computer graphics.Comparing with Newton-like method,it can achieve convergence rate 2 by adding one more functional evaluation,improve the computational stability and ensure the convergence,and also obtain higher convergence rate and higher efficiency index.Compared with clipping methods for polynomials,it doesn't need to bound the polynomials,directly bound the roots and can also work well for non-polynomial functions with much higher computational efficiency.Comparing with previous progressive methods,it achieves a much higher computational efficiency and is extended to solve bivariate equation system.Numerical examples show its much better performance on approximation error,computational efficiency and computational stability.展开更多
Let f ∈ C[0,1] , and Bn(f,x) be the n-th Bernstein polynomial associated with function f. In 1967, the limit of iterates for Bn(f,x) was given by Kelisky and Rivlin. After this, Many mathematicians studied and genera...Let f ∈ C[0,1] , and Bn(f,x) be the n-th Bernstein polynomial associated with function f. In 1967, the limit of iterates for Bn(f,x) was given by Kelisky and Rivlin. After this, Many mathematicians studied and generalized this result. But anyway, all these discussions are only for univariate case. In this paper, the main contribution is that the limit of iterates for Bernstein polynomial defined on a triangle is given completely.展开更多
In this paper we propose two original iterated maps to numerically approximate the nth root of a real number. Comparisons between the new maps and the famous Newton-Raphson method are carried out, including fixed poin...In this paper we propose two original iterated maps to numerically approximate the nth root of a real number. Comparisons between the new maps and the famous Newton-Raphson method are carried out, including fixed point determination, stability analysis and measure of the mean convergence time, which is confirmed by our analytical convergence time model. Stability of solutions is confirmed by measuring the Lyapunov exponent over the parameter space of each map. A generalization of the second map is proposed, giving rise to a family of new maps to address the same problem. This work is developed within the language of discrete dynamical systems.展开更多
In 1673, Yoshimasu Murase made a cubic equation to obtain the thickness of a hearth. He introduced two kinds of recurrence formulas of square and the deformation (Ref.[1]). We find that the three formulas lead to the ...In 1673, Yoshimasu Murase made a cubic equation to obtain the thickness of a hearth. He introduced two kinds of recurrence formulas of square and the deformation (Ref.[1]). We find that the three formulas lead to the extension of Newton-Raphson’s method and Horner’s method at the same time. This shows originality of Japanese native mathematics (Wasan) in the Edo era (1600- 1867). Suzuki (Ref.[2]) estimates Murase to be a rare mathematician in not only the history of Wasan but also the history of mathematics in the world. Section 1 introduces Murase’s three solutions of the cubic equation of the hearth. Section 2 explains the Horner’s method. We give the generalization of three formulas and the relation between these formulas and Horner’s method. Section 3 gives definitions of Murase-Newton’s method (Tsuchikura-Horiguchi’s method), general recurrence formula of Murase-Newton’s method (Tsuchikura-Horiguchi’s method), and general recurrence formula of the extension of Murase-Newton’s method (the extension of Tsuchikura-Horiguchi’s method) concerning n-degree polynomial equation. Section 4 is contents of the title of this paper.展开更多
In this paper, a group of Gauss-Legendre iterative methods with cubic convergence for solving nonlinear systems are proposed. We construct the iterative schemes based on Gauss-Legendre quadrature formula. The cubic co...In this paper, a group of Gauss-Legendre iterative methods with cubic convergence for solving nonlinear systems are proposed. We construct the iterative schemes based on Gauss-Legendre quadrature formula. The cubic convergence and error equation are proved theoretically, and demonstrated numerically. Several numerical examples for solving the system of nonlinear equations and boundary-value problems of nonlinear ordinary differential equations (ODEs) are provided to illustrate the efficiency and performance of the suggested iterative methods.展开更多
This paper gives the extension of Newton’s method, and a variety of formulas to compare the convergences for the extension of Newton’s method (Section 4). Section 5 gives the numerical calculations. Section 1 introd...This paper gives the extension of Newton’s method, and a variety of formulas to compare the convergences for the extension of Newton’s method (Section 4). Section 5 gives the numerical calculations. Section 1 introduces the three formulas obtained from the cubic equation of a hearth by Murase (Ref. [1]). We find that Murase’s three formulas lead to a Horner’s method (Ref. [2]) and extension of a Newton’s method (2009) at the same time. This shows originality of Wasan (mathematics developed in Japan) in the Edo era (1603-1868). Suzuki (Ref. [3]) estimates Murase to be a rare mathematician in not only the history of Wasan but also the history of mathematics in the world. Section 2 gives the relations between Newton’s method, Horner’s method and Murase’s three formulas. Section 3 gives a new function defined such as .展开更多
The authors prove a splitting formula for the Maslov-type indices of symplectic paths induced by the splitting of the nullity in weak symplectic Hilbert space.Then a direct proof of the iteration formulae for the Masl...The authors prove a splitting formula for the Maslov-type indices of symplectic paths induced by the splitting of the nullity in weak symplectic Hilbert space.Then a direct proof of the iteration formulae for the Maslov-type indices of symplectic paths is given.展开更多
文摘This paper presents a new nonstationary iterative method for solving non linear algebraic equations that does not require the use of any derivative. The study uses only the Newton’s divided differences of first and second orders instead of the derivatives of (1).
文摘Contrary to the opinion about approximation nature of a simple-iteration method, the exact solution of a system of linear algebraic equations (SLAE) in a finite number of iterations with a stationary matrix is demonstrated. We present a theorem and its proof that confirms the possibility to obtain the finite process and imposes the requirement for the matrix of SLAE. This matrix must be unipotent, i.e. all its eigenvalues to be equal to 1. An example of transformation of SLAE given analytically to the form with a unipotent matrix is presented. It is shown that splitting the unipotent matrix into identity and nilpotent ones results in Cramer’s analytical formulas in a finite number of iterations.
文摘The recent result of an orbit continuation algorithm has provided a rigorous method for long-term numerical integration of an orbit on the unstable manifold of a periodic solution.This algorithm is matrix-free and employs a combination of the Newton-Raphson method and the Krylov subspace method.Moreover,the algorithm adopts a multiple shooting method to address the problem of orbital instability due to long-term numerical integration.The algorithm is described through computing the extension of unstable manifold of a recomputed Nagata′s lowerbranch steady solution of plane Couette flow,which is an example of an exact coherent state that has recently been studied in subcritical transition to turbulence.
文摘For a specific combustion problem involving calculations of several species at the equilibrium state, it is simpler to write a general computer program and calculate the combustion concentration. Original work describes, an adaptation of Newton-Raphson method was used for solving the highly nonlinear system of equations describing the formation of equilibrium products in reacting of fuel-additive-air mixtures. This study also shows what possible of the results. In this paper, to be present the efficient numerical algorithms for. solving the combustion problem, to be used nonlinear equations based on the iteration method and high order of the Taylor series. The modified Adomian decomposition method was applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms. Comparisons of results by the new Matlab routines and previous routines, the result data indicate that the new Matlab routines are reliable, typical deviations from previous results are less than 0.05%.
基金Supported by the National Natural Science Foundation of China (61972120)。
文摘This paper presents an explicit formula based on reparameterization technique for progressively computing a simple root of a smooth function,which may have wide applications in robotics,geomagnetic navigation,geometric processing and computer graphics.Comparing with Newton-like method,it can achieve convergence rate 2 by adding one more functional evaluation,improve the computational stability and ensure the convergence,and also obtain higher convergence rate and higher efficiency index.Compared with clipping methods for polynomials,it doesn't need to bound the polynomials,directly bound the roots and can also work well for non-polynomial functions with much higher computational efficiency.Comparing with previous progressive methods,it achieves a much higher computational efficiency and is extended to solve bivariate equation system.Numerical examples show its much better performance on approximation error,computational efficiency and computational stability.
基金Supported by National Education Committee Foundation and NSF
文摘Let f ∈ C[0,1] , and Bn(f,x) be the n-th Bernstein polynomial associated with function f. In 1967, the limit of iterates for Bn(f,x) was given by Kelisky and Rivlin. After this, Many mathematicians studied and generalized this result. But anyway, all these discussions are only for univariate case. In this paper, the main contribution is that the limit of iterates for Bernstein polynomial defined on a triangle is given completely.
文摘In this paper we propose two original iterated maps to numerically approximate the nth root of a real number. Comparisons between the new maps and the famous Newton-Raphson method are carried out, including fixed point determination, stability analysis and measure of the mean convergence time, which is confirmed by our analytical convergence time model. Stability of solutions is confirmed by measuring the Lyapunov exponent over the parameter space of each map. A generalization of the second map is proposed, giving rise to a family of new maps to address the same problem. This work is developed within the language of discrete dynamical systems.
文摘In 1673, Yoshimasu Murase made a cubic equation to obtain the thickness of a hearth. He introduced two kinds of recurrence formulas of square and the deformation (Ref.[1]). We find that the three formulas lead to the extension of Newton-Raphson’s method and Horner’s method at the same time. This shows originality of Japanese native mathematics (Wasan) in the Edo era (1600- 1867). Suzuki (Ref.[2]) estimates Murase to be a rare mathematician in not only the history of Wasan but also the history of mathematics in the world. Section 1 introduces Murase’s three solutions of the cubic equation of the hearth. Section 2 explains the Horner’s method. We give the generalization of three formulas and the relation between these formulas and Horner’s method. Section 3 gives definitions of Murase-Newton’s method (Tsuchikura-Horiguchi’s method), general recurrence formula of Murase-Newton’s method (Tsuchikura-Horiguchi’s method), and general recurrence formula of the extension of Murase-Newton’s method (the extension of Tsuchikura-Horiguchi’s method) concerning n-degree polynomial equation. Section 4 is contents of the title of this paper.
文摘In this paper, a group of Gauss-Legendre iterative methods with cubic convergence for solving nonlinear systems are proposed. We construct the iterative schemes based on Gauss-Legendre quadrature formula. The cubic convergence and error equation are proved theoretically, and demonstrated numerically. Several numerical examples for solving the system of nonlinear equations and boundary-value problems of nonlinear ordinary differential equations (ODEs) are provided to illustrate the efficiency and performance of the suggested iterative methods.
文摘This paper gives the extension of Newton’s method, and a variety of formulas to compare the convergences for the extension of Newton’s method (Section 4). Section 5 gives the numerical calculations. Section 1 introduces the three formulas obtained from the cubic equation of a hearth by Murase (Ref. [1]). We find that Murase’s three formulas lead to a Horner’s method (Ref. [2]) and extension of a Newton’s method (2009) at the same time. This shows originality of Wasan (mathematics developed in Japan) in the Edo era (1603-1868). Suzuki (Ref. [3]) estimates Murase to be a rare mathematician in not only the history of Wasan but also the history of mathematics in the world. Section 2 gives the relations between Newton’s method, Horner’s method and Murase’s three formulas. Section 3 gives a new function defined such as .
基金supported by the National Natural Science Foundation of China(Nos.11221091,11471169)the Key Laboratory of Pure Mathematics and Combinatorics,the Ministry of Education of China
文摘The authors prove a splitting formula for the Maslov-type indices of symplectic paths induced by the splitting of the nullity in weak symplectic Hilbert space.Then a direct proof of the iteration formulae for the Maslov-type indices of symplectic paths is given.
