Pages that link to "Item:Q1097004"

The following pages link to Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004):

Displaying 18 items.

• 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)
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
• Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
• Parallel evaluation of the determinant and of the inverse of a matrix (Q1115596) (← links)
• On the evaluation of the eigenvalues of a banded Toeplitz block matrix (Q1186509) (← links)
• Improving the solution of the symmetric eigenvalue problem and an extension (Q1206210) (← links)
• Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
• Optimum placement of guards (Q1328566) (← links)
• Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros (Q1824354) (← links)
• Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
• Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant (Q1903781) (← links)
• Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
• List decoding of number field codes (Q2249795) (← links)
• Symbolic differentiation of factorized polynomials with repeated roots and the identification of their loci (Q2511096) (← links)
• Efficient Algorithms for the Evaluation of the Eigenvalues of (Block) Banded Toeplitz Matrices (Q3790545) (← links)
• Solving matrix polynomial equations arising in queueing problems (Q5956252) (← links)