Pages that link to "Item:Q3291834"
From MaRDI portal
The following pages link to A Machine Method for Solving Polynomial Equations (Q3291834):
Displayed 24 items.
- Electromagnetic field generated by a modulated moving point source in a planarly layered waveguide (Q327081) (← links)
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- Exhaustive search methods for CNS polynomials (Q1022357) (← links)
- Locating multiple zeros interactively (Q1067359) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- Solutions of infinite polynomial systems by iteration (Q1130607) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Improving a method of search for solving polynomial equations (Q1361293) (← links)
- Modified Newton method in circular interval arithmetic (Q1904962) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- Ein konvergentes Iterationsverfahren zur Bestimmung der Nullstellen eines Polynoms (Q2540940) (← links)
- Fehlerschranken zu Näherungswerten von Polynomwurzeln (Q2544512) (← links)
- Circular arithmetic and the determination of polynomial zeros (Q2549925) (← links)
- Generalized Fibonacci and Lucas Sequences and Rootfinding Methods (Q3137475) (← links)
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial (Q4069691) (← links)
- An algorithm for the total, or partial, factorization of a polynomial (Q4151651) (← links)
- Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038) (← links)
- The multivariate bisection algorithm (Q5227502) (← links)
- Effective numerical method of spectral analysis of quantum graphs (Q5272605) (← links)
- A Numerical Method for Locating the Zeros of an Analytic Function (Q5533836) (← links)
- Polynomial zerofinders based on Szegő polynomials (Q5929291) (← links)
- On Salem numbers, expansive polynomials and Stieltjes continued fractions (Q5963344) (← links)
- A fast and simple modification of Newton's method avoiding saddle points (Q6086150) (← links)