A Family of Fifth-order Iterative Methods for Solving Nonlinear Equations

In this paper, we present and analyze a family of fifth-order iterative methods free from second derivative for solving nonlinear equations. It is established that the family of iterative methods has convergence order five. Numerical examples show that the new methods are comparable with the well known existing methods and give better results in many aspects.

Modified Efficient Families of Two and Three-Step Predictor-Corrector Iterative Methods for Solving Nonlinear Equations

In this paper, we present and analyze modified families of predictor-corrector iterative methods for finding simple zeros of univariate nonlinear equations, permitting near the root. The main advantage of our methods is that they perform better and moreover, have the same efficiency indices as that of existing multipoint iterative methods. Furthermore, the convergence analysis of the new methods is discussed and several examples are given to illustrate their efficiency.

The Continuous Analogy of Newton’s Method for Solving a System of Linear Algebraic Equations

We propose a continuous analogy of Newton’s method with inner iteration for solving a system of linear algebraic equations. Implementation of inner iterations is carried out in two ways. The former is to fix the number of inner iterations in advance. The latter is to use the inexact Newton method for solution of the linear system of equations that arises at each stage of outer iterations. We give some new choices of iteration parameter and of forcing term, that ensure the convergence of iterations. The performance and efficiency of the proposed iteration is illustrated by numerical examples that represent a wide range of typical systems.

New Fourth Order Iterative Methods Second Derivative Free

In a recent paper, Noor and Khan [M. Aslam Noor, & W. A. Khan, (2012) New Iterative Methods for Solving Nonlinear Equation by Using Homotopy Perturbation Method, Applied Mathematics and Computation, 219, 3565-3574], suggested a fourth-order method for solving nonlinear equations. Per iteration in this method requires two evaluations of the function and two of its first derivatives;therefore, the efficiency index is 1.41421 as Newton’s method. In this paper, we modified this method and obtained a family of iterative methods for appropriate and suitable choice of the parameter. It should be noted that per iteration for the new methods requires two evaluations of the function and one evaluation of its first derivatives, so its efficiency index equals to 1.5874. Analysis of convergence shows that the methods are fourth-order. Several numerical examples are given to illustrate the performance of the presented methods.

Solving Large Scale Nonlinear Equations by a New ODE Numerical Integration Method

In this paper a new ODE numerical integration method was successfully applied to solving nonlinear equations. The method is of same simplicity as fixed point iteration, but the efficiency has been significantly improved, so it is especially suitable for large scale systems. For Brown’s equations, an existing article reported that when the dimension of the equation N = 40, the subroutines they used could not give a solution, as compared with our method, we can easily solve this equation even when N = 100. Other two large equations have the dimension of N = 1000, all the existing available methods have great difficulties to handle them, however, our method proposed in this paper can deal with those tough equations without any difficulties. The sigularity and choosing initial values problems were also mentioned in this paper.

Hybrid Steffensen’s Method for Solving Nonlinear Equation

In this paper, we are going to present a class of nonlinear equation solving methods. Steffensen’s method is a simple method for solving a nonlinear equation. By using Steffensen’s method and by combining this method with it, we obtain a new method. It can be said that this method, due to not using the function derivative, would be a good method for solving the nonlinear equation compared to Newton’s method. Finally, we will see that Newton’s method and Steffensen’s hybrid method both have a two-order convergence.

A New Modification of Newton Method with Cubic Convergence

Newton’s method is used to find the roots of a system of equations f (x) = 0. It is one of the most important procedures in numerical analysis, and its applicability extends to differential equations and integral equations. Analysis of the method shows a quadratic convergence under certain assumptions. For several years, researchers have improved the method by proposing modified Newton methods with salutary efforts. A modification of the Newton’s method was proposed by McDougall and Wotherspoon [1] with an order of convergence of 1+ √2. On a new type of methods with cubic convergence was proposed by H. H. H. Homeier [2]. In this article, we present a new modification of Newton method based on secant method. Analysis of convergence shows that the new method is cubically convergent. Our method requires an evaluation of the function and one of its derivatives.

Stability Control of Stretch-Twist-Fold Flow by Using Numerical Methods

In this study, the multistep method is applied to the STF system. This method has been tested on the STF system, which is a three-dimensional system of ODE with quadratic nonlinearities. A computer based Matlab program has been developed in order to solve the STF system. Stable and unstable position of the system has been analyzed graphically and finally a comparison as well as accuracy between two-step sizes with detail. Newton’s method has been applied to show the best convergence of this system.

A New Family of Nonlinear Fifth-Order Solvers for Finding Simple Roots

In this paper, we present a new family of iterative methods for solving nonlinear equations. It is proved that the order of convergence of this family is five. Two functions and two derivative evaluations should be computed per iteration. To demonstrate convergence properties of the proposed family of methods, some numerical examples are given. Further numerical comparisons are made with several other existing fifth-order methods.

MODIFIED BERNOULLI ITERATION METHODS FOR QUADRATIC MATRIX EQUATION

We construct a modified Bernoulli iteration method for solving the quadratic matrix equation AX^2 ＋ BX ＋ C = 0, where A, B and C are square matrices. This method is motivated from the Gauss-Seidel iteration for solving linear systems and the ShermanMorrison-Woodbury formula for updating matrices. Under suitable conditions, we prove the local linear convergence of the new method. An algorithm is presented to find the solution of the quadratic matrix equation and some numerical results are given to show the feasibility and the effectiveness of the algorithm. In addition, we also describe and analyze the block version of the modified Bernoulli iteration method.

NURBS插补中的速度规划与参数计算

为满足数控机床高速度、高质量加工的需求,提出一种新的非均匀有理B样条曲线插补算法。该算法包括速度规划和参数计算两部分。速度规划部分采用五段S曲线加减速控制方法,能够保证高速运行过程中加速度的连续,使机床运行平稳,避免产生激烈的震颤;参数计算部分应用抛物线插值结合牛顿迭代的方法计算插补参数,将实时插补时产生的进给速度波动控制到理想水平,从而进一步减小机床震颤。仿真实验表明,该算法能够减小机床振动,实现高质量加工。

基于NURBS插补算法的汽轮机叶片数控加工

为了提高汽轮机叶片的加工精度,文章通过分析汽轮机叶片的结构特点,采用一种NURBS曲线插补算法对其进行插补仿真。文章所采用算法由两部分组成:速度规划和参数计算。首先速度规划采用简化的五段S曲线加减速控制方法,保证了叶片在高速加工过程中加速度的连续,使机床运行平稳,然后利用牛顿迭代法来计算插补参数,得到更精确的插补参数,进一步提高了叶片的加工精度和加工速度。汽轮机叶片的插补仿真表明,该算法有高的稳定性和运算精度,并且使机床振动减小,速度波动小,保证了叶片的高质量加工。

关于牛顿迭代法中导数离散格式的探讨

基于导数的不同形式对牛顿迭代法中的导数进行离散,分别推导出弦截法和Steffensen迭代法,从而揭示了三种迭代法之间的关系.然后通过比较这两种方法中对导数值的近似精度,发现Steffensen方法对导数的近似结果更好,从而能保证该方法比弦截法收敛更快.

基于Thiele连分式重建Newton迭代公式

文章基于Thiele连分式逼近,重新建立了求解非线性方程的经典的Newton迭代公式。采用差商可以近似代替导数的办法,将Newton迭代公式化为割线法迭代公式,从而避免了求导数运算。

Simpson牛顿公式的一种改进

文章基于牛顿公理给出非线性方程求根的一种三阶方法,证明了该迭代格式三阶收敛到单根,计算效能高于其他同类迭代法;在方程根的重数m已知和未知的情形下,分别给出了该方法的改进公式,并指出了它们的收敛阶;最后给出数值试验并与其他方法进行比较,结果显示该方法非常有效,具有一定的理论价值和应用价值。

一族带有两参数的修正型Chebyshev-Halley迭代方法（英文）

应用(2,1)阶Padé逼近方法,得到不需要计算二阶导数求解非线性方程的修正型Chebyshev-Halley方法的新两参数族,证明该族方法是至少三阶收敛。该族方法的每步迭代需要计算两个函数和一个一阶导数,数值实验表明,该族迭代方法与其它方法相比,在许多方面得到了更好的数值结果。

A High-Order Newton-Like Method

This paper gives a new iterative method to solve the non-linear equation. We prove that this method has the asymptotic convergent order. When the iterative times exceed 2,only one evaluation of the function and one of its first derivative is required by each iteration of the method.Therefore the new method is better than Newton＇s method.

Efficient Fast Independent Component Analysis Algorithm with Fifth-Order Convergence

Independent component analysis （ICA） is the primary statistical method for solving the problems of blind source separation. The fast ICA is a famous and excellent algorithm and its contrast function is optimized by the quadratic convergence of Newton iteration method. In order to improve the convergence speed and the separation precision of the fast ICA, an improved fast ICA algorithm is presented. The algorithm introduces an efficient Newton＇s iterative method with fifth-order convergence for optimizing the contrast function and gives the detail derivation process and the corresponding condition. The experimental results demonstrate that the convergence speed and the separation precision of the improved algorithm are better than that of the fast ICA.

Computational Solutions of Two Dimensional Convection Diffusion Equation Using Crank-Nicolson and Time Efficient ADI

To develop an efficient numerical scheme for two-dimensional convection diffusion equation using Crank-Nicholson and ADI, time-dependent nonlinear system is discussed. These schemes are of second order accurate in apace and time solved at each time level. The procedure was combined with Iterative methods to solve non-linear systems. Efficiency and accuracy are studied in term of L2, L∞ norms confirmed by numerical results by choosing two test examples. Numerical results show that proposed alternating direction implicit scheme was very efficient and reliable for solving two dimensional nonlinear convection diffusion equation. The proposed methods can be implemented for solving non-linear problems arising in engineering and physics.

基于复数矢量法的游梁式抽油机位置精度分析

油田上普遍采用的游梁式抽油机其主机构为典型的曲柄滑块机构,利用复数矢量法建立了平面连杆机构位置精度分析的数学模型,并对抽油机的冲程精度进行了详细地分析,得出了计算冲程误差的解析式,并采用牛顿-辛普森非线性迭代法进行了数值求解,编写了MATLAB计算程序并对某厂生产的C-456D-305-120抽油机冲程误差进行了实例计算,找到了抽油机的冲程误差随曲柄转角变化的规律,该规律性对于设计抽油机及准确估算抽油机的日采油量具有重要的参考价值。