Pages that link to "Item:Q2959015"
From MaRDI portal
The following pages link to Computing nearest Gcd with certification (Q2959015):
Displaying 3 items.
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers (Q533873) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
