A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
From MaRDI portal
Publication:5647807
DOI10.1137/0707045zbMath0237.65034OpenAlexW2030755808MaRDI QIDQ5647807
Publication date: 1970
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f8e7fd3663f7d0b4a2d01754ac6ad29745cf600f
Related Items
Eigenvalue condition numbers and pseudospectra of Fiedler matrices, On the hyperbolicity of one-dimensional models for transient two-phase flow in a pipeline, Initial approximations in Durand-Kerner's root finding method, Polynomial root computation by means of the LR algorithm, On the stability of the one-step exact collocation methods for the numerical solution of the second kind Volterra integral equation, Fast parallel algorithms for Graeffe's root squaring technique, Objective Bayesian Nets for Integrating Consistent Datasets, Scaling and fine structure of superstable periodic orbits in the logistic map, Characterizations of the maximum likelihood estimator of the Cauchy distribution, Families of algebraic test equations, A root-finding algorithm based on Newton's method, Simple, exact inference for 2 × 2 tables, Nonlinear one-parametric minimal cost network flow problems, Algorithm 954, A combined method for polynomial roots using modified Newton-Raphson with minimum searching, A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis, Approximate Calculation of Sums II: Gaussian Type Quadrature, Generalization and acceleration of an algorithm of Sebastiao e Silva and its duals, Minimum variance time of arrival estimation for positioning, Calculating the Discrete Spectrum of the Transport Operator with Arbitrary Order Anisotropic Scattering, Determination of zeros of polynomials by synthetic division †, An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial, A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration, A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm, A parallel algorithm for simple roots of polynomials, Computational mimicking of surgical leaflet suturing for virtual aortic valve neocuspidization, A globally convergent method for finding zeros of smooth functions, A Generalization of the Jenkins-Traub Method, A constructive algorithm for finding the exact roots of polynomials with computable real coefficients.
