Conference Paper

Quadratically Convergent Algorithm for Computing Real Root of Non-Linear Transcendental Functions

November 2014

Conference: National Conference on Applications of Mathematical and Engineering Sciences

Authors:

International Institute of Information Technology Bangalore

Vivek Srivastav

http://www.united.ac.in/Our-Institutions/United-Institute-of-Technology-Allahabad

Srinivasarao Thota

Amrita Vishwa Vidyapeetham

The present paper describes a new algorithm to find a root of non-linear transcendental equations. It is found that the Regula-Falsi method always gives guaranteed results but slow convergence. However, the Newton–Raphson method does not give guaranteed result but faster than Regula-Falsi method. Therefore, the present paper used these two ideas and developed a new algorithm which has better convergence than Regula-Falsi and guaranteed result. One of the major issue in Newton–Raphson method is, it fails when first derivative is zero or approximately zero.

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Article

Roots of Lambda Matrices

December 1978 · Journal of Applied Mechanics

G. A. Thurston

A numerical method is outlined for computing roots of determinants of lambda matrices. Convergence of the method is quadratic as long as the derivative of the determinant does not vanish at the root. When the derivative is zero, the method may still converge in special cases. Three examples of mechanics problems giving rise to lambda matrices are included.

Article

On new higher order families of simultaneous methods for finding polynomial zeros

November 2008 · Linear Algebra and its Applications

Miodrag S. Petković

Two one parameter families of iterative methods for the simultaneous determination of simple zeros of algebraic polynomials are presented. The construction of these families are based on a one parameter family of the third order for finding a single root of nonlinear equation f(x)=0. Some previously derived simultaneous methods can be obtained from the presented families as special cases. We ... [Show full abstract] prove that the local convergence of the proposed families is of the order four. Numerical results are included to demonstrate the convergence properties of considered methods.

Article

Effective Fast Algorithms for Polynomial Spectral Factorization

December 2003 · Numerical Algorithms

Let p(z) be a polynomial of degree n having zeros |1|| m | m+1|| n |. This paper is concerned with the problem of efficiently computing the coefficients of the factors u(z)= i=1 m (z– i ) and l(z)= i=m+1 n (z– i ) of p(z) such that a(z)=z –m p(z)=(z –m u(z))l(z) is the spectral factorization of a(z). To perform this task the following two-stage approach is considered: first we approximate the ... [Show full abstract] central coefficients x –n+1,. . .x n–1 of the Laurent series x(z)= i=– + x i z i satisfying x(z)a(z)=1; then we determine the entries in the first column and in the first row of the inverse of the Toeplitz matrix T=(x i–j ) i,j=–n+1,n–1 which provide the sought coefficients of u(z) and l(z). Two different algorithms are analyzed for the reciprocation of Laurent polynomials. One algorithm makes use of Graeffe's iteration which is quadratically convergent. Differently, the second algorithm directly employs evaluation/interpolation techniques at the roots of 1 and it is linearly convergent only. Algorithmic issues and numerical experiments are discussed.

Article

A Globally Convergent Interval Method for Computing and Bounding Real Roots

December 1978 · BIT. Numerical mathematics

Eldon Hansen

In this paper, we extend the interval Newton method to the case where the interval derivative may contain zero. This extended method will isolate and bound all the real roots of a continuously differentiable function in a given interval. In particular, it will bound multiple roots. We prove that the method never fails to converge.

Article

On the zeros of certain confluent hypergeometric functions

January 1973 · Proceedings of the American Mathematical Society

P. Wynn

The theory of continued fractions is used to derive the following results which hold for − 1 2 > α > ∞ - \tfrac {1}{2} > \alpha > \infty : (1) If \[ 1 F 1 ( α ; 2 α + 1 ; z ) = 0 [ 1 F 1 ( α + 1 ; 2 α + 1 ; z ) = 0 ] _1{F_1}(\alpha ;2\alpha + 1;z) = 0\quad [{}_1{F_1}(\alpha + 1;2\alpha + 1;z) = 0] \] then Re ⁡ ( z ) > 0 [ > 0 ] \operatorname {Re} (z) > 0[ > 0] . (It is deduced from this result ... [Show full abstract] that if I α − 1 / 2 ( z ) + I α + 1 / 2 ( z ) = 0 {I_{{\alpha ^{ - 1/2}}}}(z) + {I_{{\alpha ^{ + 1/2}}}}(z) = 0 then Re ⁡ ( z ) > 0 \operatorname {Re} (z) > 0 , and it is shown that if α \alpha is an integer, an unbounded number of roots of this equation exists.) (2) The roots of the equ tions \[ 1 F 1 ( α ; 2 α ; z ) = 1 F 1 ( α ; 2 α + 1 ; z ) _1{F_1}(\alpha ;2\alpha ;z){ = _1}{F_1}(\alpha ;2\alpha + 1;z) \] and \[ 1 F 1 ( α ; 2 α ; z ) = 1 F 1 ( α + 1 ; 2 α + 1 ; z ) _1{F_1}(\alpha ;2\alpha ;z){ = _1}{F_1}(\alpha + 1;2\alpha + 1;z) \] are identical, pure imaginary, symmetrically distributed about the origin and unbounded in number. (3) Let C n ( z ) ( n = 0 , 1 , ⋯ ) {C_n}(z)(n = 0,1, \cdots ) be the successive convergents of the continued fraction associated with g ( z ) = 1 F 1 ( α ; 2 α ; z ) / 1 F 1 ( α ; 2 α + 1 ; z ) g(z){ = _1}{F_1}(\alpha ;2\alpha ;z){/_1}{F_1}(\alpha ;2\alpha + 1;z) . Te oots z = i y v ( n ) ( v = 1 , 2 , ⋯ ) z = iy_v^{(n)}(v = 1,2, \cdots ) of the eqation g ( z ) = C n ( z ) g(z) = {C_n}(z) have the same properties as those described in (2). Furthermore, they interlace: subject to a suitable ordering, y v ( n ) > y v ( n + 1 ) > y v + 1 ( n ) ( v = 1 , 2 , ⋯ ) y_v^{(n)} > y_v^{(n + 1)} > y_{v + 1}^{(n)}(v = 1,2, \cdots ) . (A special case of this result concerns the function e z {e^z} and the convergents of its continued fraction expansion, and is an extension of the forula e 2 i v π = 1 ( v = 1 , 2 , ⋯ ) {e^{2iv\pi }} = 1(v = 1,2, \cdots ) .)

Article

Full-text available

An Efficient Class of Traub–Steffensen-Type Methods for Computing Multiple Zeros

May 2019 · Axioms

Numerous higher-order methods with derivative evaluations are accessible in the literature for computing multiple zeros. However, higher-order methods without derivatives are very rare for multiple zeros. Encouraged by this fact, we present a family of third-order derivative-free iterative methods for multiple zeros that require only evaluations of three functions per iteration. Convergence of ... [Show full abstract] the proposed class is demonstrated by means of using a graphical tool, namely basins of attraction. Applicability of the methods is demonstrated through numerical experimentation on different functions that illustrates the efficient behavior. Comparison of numerical results shows that the presented iterative methods are good competitors to the existing techniques.