Sparse tensors and subdivision methods for finding the zero set of polynomial equations

DOI10.1007/978-3-031-69070-9_14MaRDI QIDQ6660334

Guillaume Moroz

Publication date: 10 January 2025

zbMATH Keywords

polynomialssubdivisionroot findingsparse tensor

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractor programming
• Comparison of the Hansen-Sengupta and the Frommer-Lang-Schnurr existence tests
• Simple multivariate polynomial multiplication
• Rigorous global search: continuous problems
• Amortized multi-point evaluation of multivariate polynomials
• Fast amortized multi-point evaluation
• Fast multivariate multi-point evaluation revisited
• Fast Polynomial Factorization and Modular Composition
• Interval Methods for Systems of Equations
• Algorithms – ESA 2004
• Fast evaluation and root finding for polynomials with floating-point coefficients
• Fast, algebraic multivariate multipoint evaluation in small characteristic and applications

This page was built for publication: Sparse tensors and subdivision methods for finding the zero set of polynomial equations