A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
From MaRDI portal
Publication:2533492
DOI10.1007/BF02163334zbMath0176.13701OpenAlexW2005485993MaRDI QIDQ2533492
Publication date: 1970
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131948
Related Items
Diagnosis of Machinery Fault Status using Transient Vibration Signal Parameters, Basic singular spectrum analysis and forecasting with R, Sequential and parallel complexity of approximate evaluation of polynomial zeros, Computing all solutions to polynomial systems using homotopy continuation, Polynomial roots: The ultimate answer?, Polynomial root computation by means of the LR algorithm, Effective asymptotics of linear recurrences with rational coefficients, An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros, Enclosing clusters of zeros of polynomials, The computation of multiple roots of a polynomial, Fourth Order Difference Methods for the Initial Boundary-Value Problem for Hyperbolic Equations, A root-finding algorithm based on Newton's method, Algorithms for quaternion polynomial root-finding, An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli, The equivalence of the constrained Rayleigh quotient and Newton methods for matrix polynomials expressed in different polynomial bases along with the confluent case, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., Numerical computation of polynomial zeros by means of Aberth's method, A combined method for polynomial roots using modified Newton-Raphson with minimum searching, Root finding with threshold circuits, A matrix approach to the computation of quadrature formulas on the unit circle, Structured matrix methods for the computation of multiple roots of a polynomial, Polynomial zerofinders based on Szegő polynomials, Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence, Generalization and acceleration of an algorithm of Sebastiao e Silva and its duals, On the geometry of Graeffe iteration, Minimum variance time of arrival estimation for positioning, Adams-type methods with increased ranges of stability, A general high order two-dimensional panel method, On the stability of computing polynomial roots via confederate linearizations, Some iterations for factoring polynomials, Linear construction of companion matrices, On a companion operator for analytic functions, On a companion operator for analytic functions, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm, The shifted QR algorithm for Hermitian matrices, A parallel algorithm for simple roots of polynomials, An analysis of the shifted LR algorithm, Some iterations for factoring a polynomial. II: A generalization of the secant method, A Generalization of the Jenkins-Traub Method, Improvement of convergence of an iterative method for finding polynomial factors of analytic functions, A constructive algorithm for finding the exact roots of polynomials with computable real coefficients.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomkerne und Iterationsverfahren
- On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. III: Generalized Rayleigh quotient and characteristic roots with linear elementary divisors. IV: Generalized Rayleigh quotient for nonlinear elementary divisors
- A Class of Globally Convergent Iteration Functions for the Solution of Polynomial Equations
- A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
