Results 21 to 30 of about 212,635 (266)
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 +2 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
The computation of multiple roots of a polynomial
Journal of Computational and Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joab R. Winkler, Xin Lao, Madina Hasan
openaire +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
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
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
Bifurcation of the roots of the characteristic polynomial and the destabilization paradox in friction induced oscillations [PDF]
Theoretical and Applied Mechanics, 2007 Paradoxical effect of small dissipative and gyroscopic forces on the stability of a linear non-conservative system, which manifests itself through the unpredictable at first sight behavior of the critical non-conservative load, is studied.
Kirillov O.N.
doaj +1 more source
On generalized one-step derivative-free iterative family for evaluating multiple roots [PDF]
Iranian Journal of Numerical Analysis and OptimizationIn this study, we propose a family of iterative procedures with no deriva-tives for calculating multiple roots of one-variable nonlinear equations. We also present an iterative technique to approximate the multiplicity of the roots.
H. Arora, A. Cordero, J. R. Torregrosa
doaj +1 more source
An Efficient Class of Traub–Steffensen-Type Methods for Computing Multiple Zeros
Axioms, 2019 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.
Deepak Kumar +2 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