The evaluation of the zeros of ill-conditioned polynomials. I, II

DOI10.1007/BF01386381zbMath0202.43701OpenAlexW2010761584MaRDI QIDQ2541097

Publication date: 1959

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131428

Related Items (48)

Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form ⋮ Componentwise inclusion and exclusion sets for solutions of quadratic equations in finite dimensional spaces ⋮ Practical problems arising for finding roots of nonlinear equations ⋮ Revisiting the problem of zeros of univariate scalar Béziers ⋮ On the numerical condition of polynomials in Bernstein form ⋮ Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety ⋮ The Durand-Kerner polynomials roots-finding method in case of multiple roots ⋮ Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form ⋮ A posteriori error bounds for the zeros of polynomials ⋮ Running error for the evaluation of rational Bézier surfaces ⋮ On the roots of all-terminal reliability polynomials ⋮ Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes ⋮ Eine zur Programmierung geeignete Modifikation des Graeffe‐Verfahrens ⋮ Algebraic pruning: a fast technique for curve and surface intersection ⋮ An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases ⋮ Unnamed Item ⋮ A statistical analysis of the numerical condition of multiple roots of polynomials. ⋮ On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis ⋮ The Bernstein polynomial basis: a centennial retrospective ⋮ A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial ⋮ Stability of rootfinding for barycentric Lagrange interpolants ⋮ Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm ⋮ Error analysis of efficient evaluation algorithms for tensor product surfaces ⋮ Computing with barycentric polynomials ⋮ Generalized Heine–Stieltjes and Van Vleck polynomials associated with two-level, integrable BCS models ⋮ A note on upper bounds for ideal-theoretic problems ⋮ Bound the number of limit cycles bifurcating from center of polynomial Hamiltonian system via interval analysis ⋮ A comparison of the average case numerical condition of the power and bernstein polynomial bases ⋮ A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis ⋮ Hermite's method of separation of solutions of systems of algebraic equations and its applications ⋮ Incorporating the Havriliak-Negami dielectric model in the FD-TD method ⋮ Polynomial factorization and the Q-D algorithm ⋮ On the generalized Ball bases ⋮ Accurate evaluation of a polynomial in Chebyshev form ⋮ Numerical solution of two-point boundary value problems ⋮ Iteration functions re-visited ⋮ Exact line and plane search for tensor optimization ⋮ On the trade-off between number of examples and precision of supervision in machine learning problems ⋮ Direkte Verfahren zur Berechnung der Nullstellen von Polynomen ⋮ On the optimal stability of the Bernstein basis ⋮ A class of iterative methods for holomorphic functions ⋮ A posteriori error bounds for the zeros of a polynomial ⋮ Numerical methods for spectral theory ⋮ Error analysis of floating-point computation ⋮ Some extensions of Bairstow's method ⋮ Evaluation of the derivative of a polynomial in Bernstein form ⋮ On time-optimal trajectories in non-uniform mediums ⋮ A general method of finding new symplectic schemes for Hamiltonian mechanics

This page was built for publication: The evaluation of the zeros of ill-conditioned polynomials. I, II