Pages that link to "Item:Q5618200"

The following pages link to Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems (Q5618200):

Displaying 37 items.

• Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications (Q281973) (← links)
• On a class of matrix pencils and \(\ell\)-ifications equivalent to a given matrix polynomial (Q281981) (← links)
• Nonexistence results for tight block designs (Q356745) (← links)
• Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method (Q389577) (← links)
• A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
• Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
• An iterated eigenvalue algorithm for approximating roots of univariate polynomials (Q697487) (← links)
• Linear construction of companion matrices (Q753896) (← links)
• Inclusion of the roots of a polynomial based on Gerschgorin's theorem (Q804231) (← links)
• On the convergence of the sequences of Gerschgorin-like disks (Q857652) (← links)
• An existence and nonexistence theorem for solutions of nonlinear systems and its application to algebraic equations (Q910158) (← links)
• A generalized companion matrix of a polynomial and some applications (Q1055849) (← links)
• Some parallel methods for polynomial root-finding (Q1091080) (← links)
• Error-bounds for zeroes of polynomials using complex circular arithmetic (Q1094096) (← links)
• A comparison of methods for terminating polynomial iterations (Q1113616) (← links)
• Generalizzazione del metodo di Laguerre (Q1240524) (← links)
• Improvement of a convergence condition for Durand-Kerner iteration (Q1298639) (← links)
• A precise estimation method for locations in an inverse logarithmic potential problem for point mass models (Q1337234) (← links)
• Determination of locations of point-like masses in an inverse source problem of the Poisson equation (Q1347153) (← links)
• Enclosing clusters of zeros of polynomials (Q1398713) (← links)
• Ten methods to bound multiple roots of polynomials (Q1398714) (← links)
• A method for finding the zeros of polynomials using a companion matrix. (Q1421154) (← links)
• The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros (Q1568729) (← links)
• Analytic continuation and Riemann surface determination of algebraic functions by computer (Q1922269) (← links)
• On some simultaneous methods based on Weierstrass' correction (Q1923458) (← links)
• A numerical realization of the conditions of Max Nöther's residual intersection theorem (Q2352104) (← links)
• Tighter bounds of errors of numerical roots (Q2467047) (← links)
• Perturbation bounds for polynomials (Q2480887) (← links)
• A posteriori error bounds for the zeros of a polynomial (Q2552011) (← links)
• Simultaneous inclusion of the zeros of a polynomial (Q2562684) (← links)
• A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem (Q2562685) (← links)
• A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial (Q4652860) (← links)
• Some higher-order methods for the simultaneous approximation of multiple polynomial zeros (Q4728106) (← links)
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously (Q4768561) (← links)
• A Spectral Method for a Nonpreemptive Priority<i>BMAP</i>/<i>G</i>/1 QUEUE (Q5462804) (← links)
• A new simultaneous method of fourth order for finding complex zeros in circular interval arithmetic (Q5937194) (← links)
• Durand-Kerner method for the real roots (Q5960870) (← links)