Pages that link to "Item:Q2541096"
From MaRDI portal
The following pages link to Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen (Q2541096):
Displaying 50 items.
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- On some methods for the simultaneous determination of polynomial zeros (Q1922231) (← links)
- On some simultaneous methods based on Weierstrass' correction (Q1923458) (← links)
- Solvable models of layered neural networks based on their differential structure (Q1923889) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem (Q2068644) (← links)
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods (Q2191569) (← links)
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
- Eigenvalue condition numbers and pseudospectra of Fiedler matrices (Q2363685) (← links)
- On iteration methods without derivatives for the simultaneous determination of polynomial zeros (Q2366429) (← links)
- A one parameter square root family of two-step root-finders (Q2371439) (← links)
- A note on the improved derivative free root-solvers (Q2378230) (← links)
- A posteriori error bound methods for the inclusion of polynomial zeros (Q2381619) (← links)
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials (Q2402410) (← links)
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously (Q2442867) (← links)
- A family of root-finding methods with accelerated convergence (Q2475888) (← links)
- High order Euler-like method for the inclusion of polynomial zeros (Q2479144) (← links)
- An efficient higher order family of root finders (Q2483336) (← links)
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation (Q2535361) (← links)
- Über die Nullstellenbestimmung bei näherungsweise berechneten Funktionen (Q2557101) (← links)
- Simultaneous inclusion of the zeros of a polynomial (Q2562684) (← links)
- On the convergent condition of Durand-Kerner method in parallel circular iteration of multi-step (Q2572333) (← links)
- The Durand-Kerner polynomials roots-finding method in case of multiple roots (Q2640316) (← links)
- The simultaneous determination of all zeros of a polynomial (Q2641078) (← links)
- A locally convergent continuous-time algorithm to find all the roots of a time-varying polynomial (Q2665356) (← links)
- On the stability of computing polynomial roots via confederate linearizations (Q2814445) (← links)
- Numerical Calabi–Yau metrics (Q3544656) (← links)
- Real arithmetic versions of simultaneous iteration methods for polynomial root finding (Q3831939) (← links)
- A method for computing all the zeros of a polynomial with real coefficients (Q3900917) (← links)
- A family of simultaneous methods for the determination of polynomial complex zeros (Q3942315) (← 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)
- On the fourth order methods of Weierstrass' type (Q4378438) (← links)
- A<i>MAP</i>/<i>G</i>/1 Queue with an Underlying Birth–Death Process (Q4431304) (← links)
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously (Q4768561) (← links)
- Diverging orbits for the Ehrlich–Aberth and the Weierstrass root finders (Q5027172) (← links)
- Scaled parallel iterative method for finding real roots of nonlinear equations (Q5038158) (← links)
- The Weierstrass–Durand–Kerner root finder is not generally convergent (Q5058658) (← links)
- On using symmetric polynomials for constructing root finding methods (Q5113669) (← links)
- An Efficient Algorithm for the Classical Least Squares Approximation (Q5132013) (← links)
- On a cubically convergent derivative-free root finding method (Q5297941) (← links)
- A Spectral Method for a Nonpreemptive Priority<i>BMAP</i>/<i>G</i>/1 QUEUE (Q5462804) (← links)
- Approximate Calculation of Sums II: Gaussian Type Quadrature (Q5741064) (← links)
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
- A new simultaneous method of fourth order for finding complex zeros in circular interval arithmetic (Q5937194) (← links)
- Point estimation of simultaneous methods for solving polynomial equations: A survey (Q5948584) (← links)
- Durand-Kerner method for the real roots (Q5960870) (← links)
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method (Q5963455) (← links)
- \texttt{reskit}: a toolkit to determine the poles of an S-matrix (Q6100292) (← links)
- Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis (Q6572622) (← links)
