Results 21 to 30 of about 5,306,015 (308)
Mathematics, 2023 The methods that use memory using accelerating parameters for computing multiple roots are almost non-existent in the literature. Furthermore, the only paper available in this direction showed an increase in the order of convergence of 0.5 from the ...
G Thangkhenpau +3 more
doaj +1 more source
Multiple unit roots in periodic autoregression [PDF]
Journal of Econometrics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boswijk, H.P. +2 more
openaire +5 more sources
Mathematical Modelling and Analysis, 2019 In this paper, we present many new one-parameter families of classical Rall’s method (modified Newton’s method), Schröder’s method, Halley’s method and super-Halley method for the first time which will converge even though the guess is far away from the ...
Ramandeep Behl +2 more
doaj +1 more source
Multiplicative Square Root Algorithms for FPGAs [PDF]
2010 International Conference on Field Programmable Logic and Applications, 2010 Most current square root implementations for FPGAs use a digit recurrence algorithm which is well suited to their LUT structure. However, recent computing-oriented FPGAs include embedded multipliers and RAM blocks which can also be used to implement quadratic convergence algorithms, very high radix digit recurrences, or polynomial approximation ...
de Dinechin, Florent +3 more
openaire +3 more sources
Mathematics, 2021 The aim of this paper is to study, from a topological and geometrical point of view, the iteration map obtained by the application of iterative methods (Newton or relaxed Newton’s method) to a polynomial equation.
José Ignacio Extreminana-Aldana +3 more
doaj +1 more source
On Hyperbolic Polynomials with Multiple Roots [PDF]
Proceedings of the American Mathematical Society, 1969 Let Q(z) Q(z, **, zn) be a polynomial of degree m > 1 in Z(Zl, , * Zn) with complex coefficients. Let P(z) be the principal part, homogeneous of degree m. Q is defined to be hyperbolic with respect to the real vector t-(4, , n) $0, in the sense of Garding [1], if P(t)z0 and if there exists a real number to such that for Re r> to, and all real vectors 7,
openaire +2 more sources
Power comparison among tests for fractional unit roots [PDF]
, 2008 This article compares the asymptotic power properties of the Wald, the Lagrange Multiplier and the Likelihood Ratio test for fractional unit roots. The paper shows that there is an asymptotic inequality between the three tests that holds under fixed ...
Velasco Gómez, Carlos +2 more
core +1 more source
A New Third-Order Family of Multiple Root-Findings Based on Exponential Fitted Curve
Algorithms, 2023 In this paper, we present a new third-order family of iterative methods in order to compute the multiple roots of nonlinear equations when the multiplicity (m≥1) is known in advance. There is a plethora of third-order point-to-point methods, available in
Vinay Kanwar +4 more
doaj +1 more source
Mathematics, 2019 We present a new optimal class of Ostrowski’s method for obtaining multiple zeros of univariate nonlinear functions. Several researchers tried to construct an optimal family of Ostrowski’s method for multiple zeros, but they did not have ...
Ramandeep Behl, Waleed M. Al-Hamdan
doaj +1 more source
Approximating Multiple Roots of Applied Mathematical Problems Using Iterative Techniques
Axioms, 2023 In this study, we suggest a new iterative family of iterative methods for approximating the roots with multiplicity in nonlinear equations. We found a lack in the approximation of multiple roots in the case that the nonlinear operator be non ...
Ramandeep Behl +3 more
doaj +1 more source