Solving schubert problems with Littlewood-Richardson homotopies
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Parallel homotopy algorithms to solve polynomial systems
ICMS'06 Proceedings of the Second international conference on Mathematical Software
| Hi-index | 0.00 |
Based on Pieri's formula on Schubert varieties, the Pieri homotopy algorithm was first proposed by Huber, Sottile, and Sturmfels [J. Symbolic Comput., 26 (1998), pp. 767--788] for numerical Schubert calculus to enumerate all p-planes in ${\mathbb C}^{m+p}$ that meet n given planes in general position. The algorithm has been improved by Huber and Verschelde [SIAM J. Control Optim., 38 (2000), pp. 1265--1287] to be more intuitive and more suitable for computer implementations.A different approach of employing the Pieri homotopy algorithm for numerical Schubert calculus is presented in this paper. A major advantage of our method is that the polynomial equations in the process are all square systems admitting the same number of equations and unknowns. Moreover, the degree of each polynomial equation is always 2, which warrants much better numerical stability when the solutions are being solved. Numerical results for a big variety of examples illustrate that a considerable advance in speed as well as much smaller storage requirements have been achieved by the resulting algorithm.