Pages that link to "Item:Q2253077"

The following pages link to Solving secular and polynomial equations: a multiprecision algorithm (Q2253077):

Displaying 29 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)
• Cylinder partition function of the 6-vertex model from algebraic geometry (Q783974) (← links)
• Root radii and subdivision for polynomial root-finding (Q831975) (← links)
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
• An adaptive subdivision method for root finding of univariate polynomials (Q1736361) (← links)
• Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions (Q2002783) (← links)
• Accelerated subdivision for clustering roots of polynomials given by evaluation oracles (Q2109981) (← links)
• Characterization of local optima of polynomial modulus over a disc (Q2138407) (← links)
• Symbolic-numeric integration of rational functions (Q2173331) (← links)
• A bound on the spectral radius of graphs in terms of their Zagreb indices (Q2174091) (← links)
• Rational Krylov methods for functions of matrices with applications to fractional partial differential equations (Q2222430) (← links)
• An effective implementation of a modified Laguerre method for the roots of a polynomial (Q2334816) (← links)
• Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
• Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
• Newton's method in practice: finding all roots of polynomials of degree one million efficiently (Q2357369) (← links)
• Torus partition function of the six-vertex model from algebraic geometry (Q2421149) (← links)
• On the stability of computing polynomial roots via confederate linearizations (Q2814445) (← links)
• Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil (Q4584920) (← links)
• New Practical Advances in Polynomial Root Clustering (Q5014669) (← links)
• SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS (Q5076167) (← links)
• A Fractal Eigenvector (Q5082412) (← links)
• A Framework for Structured Linearizations of Matrix Polynomials in Various Bases (Q5346749) (← links)
• On the efficient global dynamics of Newton’s method for complex polynomials (Q5872372) (← links)
• Nearly optimal computations with structured matrices (Q5919809) (← links)
• Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees (Q6073133) (← links)
• Note on a rank-one modification of the singular value decomposition (Q6096270) (← links)
• Transmission operators for the non-overlapping Schwarz method for solving Helmholtz problems in rectangular cavities (Q6161522) (← links)
• Fast optimization of viscosities for frequency‐weighted damping of second‐order systems (Q6202643) (← links)