Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Analysis
Reference39 articles.
1. Allgower, Eugene L. and Kurt Georg. 1993. Continuation and path following, Acta numerica, 1993, Acta Numer., Cambridge Univ. Press, Cambridge, pp. 1–64.
2. Armentano, Diego, Carlos Beltrán, Peter Bürgisser, Felipe Cucker, and Michael Shub. 2016. Condition Length and Complexity for the Solution of Polynomial Systems, Found. Comput. Math., 16, no. 6, 1401–1422, https://doi.org/10.1007/s10208-016-9309-9 .
3. Beltrán, Carlos. 2011. A continuation method to solve polynomial systems and its complexity, Numer. Math. 117, no. 1, 89–113, https://doi.org/10.1007/s00211-010-0334-3 .
4. Beltrán, Carlos, Jean-Pierre Dedieu, Gregorio Malajovich, and Mike Shub. 2009 Convexity properties of the condition number, SIAM J. Matrix Anal. Appl. 31,no. 3, 1491–1506, https://doi.org/10.1137/080718681 .
5. Beltrán, Carlos, Jean-Pierre Dedieu, Gregorio Malajovich, and Mike Shub. 2012. Convexity properties of the condition number II, SIAM J. Matrix Anal. Appl. 33, no. 3, 905–939, https://doi.org/10.1137/100808885 .
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Condition numbers for the cube. I: Univariate polynomials and hypersurfaces;Journal of Symbolic Computation;2023-03
2. Polyhedral homotopies in Cox coordinates;Journal of Algebra and Its Applications;2023-01-13
3. A Polyhedral Homotopy Algorithm for Real Zeros;Arnold Mathematical Journal;2022-10-27
4. Complexity of sparse polynomial solving 2: renormalization;IMA Journal of Numerical Analysis;2022-10-01
5. Solving Sparse Polynomial Systems using Gröbner Bases and Resultants;Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation;2022-07-04