Pages that link to "Item:Q1581129"

The following pages link to Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129):

Displaying 13 items.

• Modular composition modulo triangular sets and applications (Q371190) (← links)
• Fast arithmetics in Artin-Schreier towers over finite fields (Q420745) (← links)
• The numerical factorization of polynomials (Q525605) (← links)
• Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
• Numerical factorization of multivariate complex polynomials (Q598228) (← links)
• Computing monodromy via continuation methods on random Riemann surfaces (Q633630) (← links)
• On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
• Efficient matrix preconditioners for black box linear algebra (Q1348088) (← links)
• An explicit radical parametrization of Zolotarev polynomials of degree 7 in terms of nested square roots (Q2139470) (← links)
• Polynomial evaluation and interpolation on special sets of points (Q2387413) (← links)
• Fast computation of special resultants (Q2457312) (← links)
• Approximate factorization of multivariate polynomials using singular value decomposition (Q2482630) (← links)
• Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)