Rigid continuation paths II. structured polynomial systems
This work studies the average complexity of solving structured polynomial systems that are characterised by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that computes, with high probability, an approximate zero of a polynomi...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Cambridge University Press
2023-01-01
|
| Series: | Forum of Mathematics, Pi |
| Subjects: | |
| Online Access: | https://www.cambridge.org/core/product/identifier/S2050508623000070/type/journal_article |