On the verification of polynomial system solvers |
| |
Authors: | Changbo CHEN Marc MORENO MAZA Wei PAN Yuzhen XI |
| |
Affiliation: | (1) The University of Western Ontario, London, ON N6A 5B7, Canada |
| |
Abstract: | We discuss the verification of mathematical software solving polynomial systems symbolically by way of triangular decomposition.
Standard verification techniques are highly resource consuming and apply only to polynomial systems which are easy to solve.
We exhibit a new approach which manipulates constructible sets represented by regular systems. We provide comparative benchmarks
of different verification procedures applied to four solvers on a large set of well-known polynomial systems. Our experimental
results illustrate the high efficiency of our new approach. In particular, we are able to verify triangular decompositions
of polynomial systems which are not easy to solve. |
| |
Keywords: | software verification polynomial system solver triangular decomposition |
本文献已被 万方数据 SpringerLink 等数据库收录! |