Pages that link to "Item:Q2533492"
From MaRDI portal
The following pages link to A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration (Q2533492):
Displayed 36 items.
- The computation of multiple roots of a polynomial (Q425345) (← links)
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- Linear construction of companion matrices (Q753896) (← links)
- A parallel algorithm for simple roots of polynomials (Q762886) (← links)
- Minimum variance time of arrival estimation for positioning (Q985637) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- Computing all solutions to polynomial systems using homotopy continuation (Q1097645) (← links)
- A combined method for polynomial roots using modified Newton-Raphson with minimum searching (Q1200179) (← links)
- Generalization and acceleration of an algorithm of Sebastiao e Silva and its duals (Q1219145) (← links)
- Adams-type methods with increased ranges of stability (Q1250694) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Polynomial root computation by means of the LR algorithm (Q1359970) (← links)
- Enclosing clusters of zeros of polynomials (Q1398713) (← links)
- Improvement of convergence of an iterative method for finding polynomial factors of analytic functions (Q1602809) (← links)
- A constructive algorithm for finding the exact roots of polynomials with computable real coefficients. (Q1603892) (← links)
- Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence (Q1760574) (← links)
- A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm (Q1819535) (← links)
- Polynomial roots: The ultimate answer? (Q1899387) (← links)
- Effective asymptotics of linear recurrences with rational coefficients (Q1917520) (← links)
- An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros (Q1917920) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- A matrix approach to the computation of quadrature formulas on the unit circle (Q2479423) (← links)
- Some iterations for factoring polynomials (Q2534803) (← links)
- The shifted QR algorithm for Hermitian matrices (Q2545456) (← links)
- An analysis of the shifted LR algorithm (Q2556197) (← links)
- Some iterations for factoring a polynomial. II: A generalization of the secant method (Q2560705) (← links)
- The equivalence of the constrained Rayleigh quotient and Newton methods for matrix polynomials expressed in different polynomial bases along with the confluent case (Q2995507) (← links)
- A Generalization of the Jenkins-Traub Method (Q4118735) (← links)
- Fourth Order Difference Methods for the Initial Boundary-Value Problem for Hyperbolic Equations (Q4772122) (← links)
- Diagnosis of Machinery Fault Status using Transient Vibration Signal Parameters (Q4787719) (← links)
- A root-finding algorithm based on Newton's method (Q5663315) (← links)
- On a companion operator for analytic functions (Q5921143) (← links)
- On a companion operator for analytic functions (Q5921315) (← links)
- Polynomial zerofinders based on Szegő polynomials (Q5929291) (← links)
- On the geometry of Graeffe iteration (Q5949383) (← links)