Numeric vs. symbolic homotopy algorithms in polynomial system solving: A case study
We consider a family of polynomial systems which arises in the analysis of the stationary solutions of a standard discretization of certain semi-linear second-order parabolic partial differential equations. We prove that this family is well-conditioned from the numeric point of view, and ill-conditi...
Guardado en:
Autores principales: | De Leo, M., Dratman, E., Matera, G. |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_0885064X_v21_n4_p502_DeLeo |
Aporte de: |
Ejemplares similares
-
Numeric vs. symbolic homotopy algorithms in polynomial system solving: A case study
por: De Leo, M., et al.
Publicado: (2005) -
Numeric vs. symbolic homotopy algorithms in polynomial system solving: A case study
por: De Leo, M., et al.
Publicado: (2005) -
Numeric vs. symbolic homotopy algorithms in polynomial system solving: A case study
por: De Leo, Mariano Fernando, et al.
Publicado: (2005) -
Degeneracy Loci and Polynomial Equation Solving
por: Bank, B., et al. -
Degeneracy Loci and Polynomial Equation Solving
Publicado: (2014)