Pages that link to "Item:Q1091081"

The following pages link to On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems (Q1091081):

Displayed 3 items.

• A fast and stable algorithm for splitting polynomials (Q679271) ‎ (← links)
• Algebraic complexity of computing polynomial zeros (Q1095599) ‎ (← links)
• Certified approximate univariate GCDs (Q1358910) ‎ (← links)