Practical Problems Arising in the Solution of Polynomial Equations
From MaRDI portal
Cited in
(22)- Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
- Practical problems arising for finding roots of nonlinear equations
- On the numerical condition of polynomials in Bernstein form
- Algorithms for polynomials in Bernstein form
- A comparison of methods for terminating polynomial iterations
- On Newton's method with a class of rational functions
- Determination of the zeros of a linear combination of generalised polynomials
- Subroutine library for partial differential approximants
- A further analysis of backward error in polynomial deflation
- A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm
- Rounding error analysis of Horner's scheme
- Identification and ``reverse engineering of Pythagorean-hodograph curves
- Über die Nullstellenbestimmung bei näherungsweise berechneten Funktionen
- Algorithm 954: An accurate and efficient cubic and quartic equation solver for physical applications
- Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
- Notes on linear factor polynomial deflation in polynomial bases
- A Generalization of the Jenkins-Traub Method
- How to be sure of finding a root of a complex polynomial using Newton's method
- Deflation techniques for finding distinct solutions of nonlinear partial differential equations
- A root-finding algorithm based on Newton's method
- Solving nonlinear equations by a new derivative free iterative method
- Numerical computation of polynomial zeros by means of Aberth's method
This page was built for publication: Practical Problems Arising in the Solution of Polynomial Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5640659)
