A new family of Schröder's method and its variants based on power means for multiple roots of nonlinear equations

In this article, we derive one-parameter family of Schröder's method based on Gupta et al.'s (K.C. Gupta, V. Kanwar, and S. Kumar, A family of ellipse methods for solving non-linear equations, Int. J. Math. Educ. Sci. Technol. 40 (2009), pp. 571–575) family of ellipse methods for the solution of nonlinear equations. Further, we introduce new families of Schröder-type methods for multiple roots with cubic convergence. Proposed families are derived from modified Newton's method for multiple roots and one-parameter family of Schröder's method. Numerical examples are also provided to show that these new methods are competitive to other known methods for multiple roots.     

不动点迭代法的一点注记

对于迭代函数不满足收敛定理假定条件的情况 ,提出了一种简单方法 .此方法对于迭代函数满足收敛定理假定条件的情况 ,可以加速序列收敛 .最后给出了实例和程序 .     

Analysis of the GIX/M/c model

In this paper, the GI^X/M/c queueing model is analyzed. An explicit expression of the generating function of equilibrium probabilities of customer numbers in the system for the model is derived. Based on the generating function, it is proved that the equilibrium probabilities are given by a linear combination of some geometric terms. Due to this result, other interesting measures are also considered without difficulty. Examples and numerical results are given.     

A Fourier Companion Matrix (Multiplication Matrix) with Real-Valued Elements: Finding the Roots of a Trigonometric Polynomial by Matrix Eigensolving

We show that the zeros of a trigonometric polynomial of degree $N$ with the usual $(2N +1)$ terms can be calculated by computing the eigenvalues of a matrix of dimension $2N$ with real-valued elements $M_{jk}$. This matrix $\vec{\vec{M}}$ is a multiplication matrix in the sense that, after first defining a vector $\vec{\phi}$ whose elements are the first $2N$ basis functions, $\vec{\vec{M}}\vec{\phi}$ = 2cos($t$)$\vec{\phi}$. This relationship is the eigenproblem; the zeros $t_{k}$ are the arccosine function of $\lambda_{k}/2$ where the $\lambda_{k}$ are the eigenvalues of $\vec{\vec {M}}$. We dub this the "Fourier Division Companion Matrix'', or FDCM for short, because it is derived using trigonometric polynomial division. We show through examples that the algorithm computes both real and complex-valued roots, even double roots, to near machine precision accuracy.     

一个四阶收敛的牛顿类方法

A fourth-order convergence method of solving roots for nonlinear equation,which is a variant of Newton's method given.Its convergence properties is proved.It is at least fourth-order convergence near simple roots and one order convergence near multiple roots. In the end,numerical tests are given and compared with other known Newton and Newtontype methods.The results show that the proposed method has some more advantages than others.It enriches the methods to find the roots of non-linear equations and it ...     

几类改进的新的两步六阶Chebyshev-Halley方法

利用权函数法,给出非线性方程求根的Chebyshev-Halley方法的几类改进方法,证明方法六阶收敛到单根.Chebyshev-Halley方法的效率指数为1.442,改进后的两步方法的效率指数为1.565.最后给出数值试验,且与牛顿法,Chebyshev-Halley 方法及其它已知的方程求根方法做了比较.结果表明方法具有一定的优越性.     

On Extraneous Fixed-Points of the Basic Family of Iteration Functions

Let K denote either the reals or the complex numbers. Consider the root-finding problem for an analytic function f from K into itself via an iteration function F. An extraneous fixed-point of F is a fixed-point different than a root of f. We prove that all extraneous fixed-points of any member of an infinite family of iteration functions, called the Basic Family in Kalantari et al. (1997). are repulsive. This generalizes a result of Vrscay and Gilbert (1988) who prove the property only for the second member of the family which coincides with the well-known Halley's method. Our result implies that a convergent orbit corresponding to any specific member of the Basic Family will necessarily converge to a zero of f. The Basic Family is a fundamental family with several different representations. It has been rediscovered by several authors using various techniques. The earliest derivation of this family is from an analysis of Schröder (1870). But in fact the Basic Family and its multipoint versions are all derivable from a determinantal generalization of Taylor's theorem (Kalantari (1997)).     

A variant of Chebyshev’s method with sixth-order convergence

In this paper, we present a new variant of Chebyshev’s method for solving non-linear equations. Analysis of convergence shows that the new method has sixth-order convergence. Per iteration the new method requires two evaluations of the function, one of its first derivative and one of its second derivative. Thus the efficiency, in term of function evaluations, of the new method is better than that of Chebyshev’s method. Numerical examples verifying the theory are given.