Numeric vs. symbolic homotopy algorithms in polynomial system solving: A case study

Mostrar todas las versiones(3)

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: De Leo, M., Dratman, E., Matera, G.
Formato: Artículo publishedVersion
Publicado: 2005
Materias:
Complexity
Conditioning
Homotopy algorithms
Polynomial system solving
Semi-linear parabolic problems
Stationary solutions
Algorithms
Boundary value problems
Mathematical models
Matrix algebra
Partial differential equations
Polynomials
Set theory
Semi linear parabolic problems
Computational complexity
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0885064X_v21_n4_p502_DeLeo
https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0885064X_v21_n4_p502_DeLeo_oai
Aporte de:
Repositorio Digital de la Universidad de Buenos Aires (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares