Computing the Homology of Real Projective Sets
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties. Here numerical means that the algorithm is numerically stable (in a sense to be made precise). Its cost depends on the condition of the input as well as on...
Guardado en:
Publicado: |
2018
|
---|---|
Materias: | |
Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_16153375_v18_n4_p929_Cucker http://hdl.handle.net/20.500.12110/paper_16153375_v18_n4_p929_Cucker |
Aporte de: |
id |
paper:paper_16153375_v18_n4_p929_Cucker |
---|---|
record_format |
dspace |
spelling |
paper:paper_16153375_v18_n4_p929_Cucker2023-06-08T16:25:22Z Computing the Homology of Real Projective Sets Complexity Condition Exponential time Homology groups Real projective varieties Computational methods Complexity Condition Exponential time Homology groups Real projective varieties Mathematical techniques We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties. Here numerical means that the algorithm is numerically stable (in a sense to be made precise). Its cost depends on the condition of the input as well as on its size and is singly exponential in the number of variables (the dimension of the ambient space) and polynomial in the condition and the degrees of the defining polynomials. In addition, we show that outside of an exceptional set of measure exponentially small in the size of the data, the algorithm takes exponential time. © 2017, SFoCM. 2018 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_16153375_v18_n4_p929_Cucker http://hdl.handle.net/20.500.12110/paper_16153375_v18_n4_p929_Cucker |
institution |
Universidad de Buenos Aires |
institution_str |
I-28 |
repository_str |
R-134 |
collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
topic |
Complexity Condition Exponential time Homology groups Real projective varieties Computational methods Complexity Condition Exponential time Homology groups Real projective varieties Mathematical techniques |
spellingShingle |
Complexity Condition Exponential time Homology groups Real projective varieties Computational methods Complexity Condition Exponential time Homology groups Real projective varieties Mathematical techniques Computing the Homology of Real Projective Sets |
topic_facet |
Complexity Condition Exponential time Homology groups Real projective varieties Computational methods Complexity Condition Exponential time Homology groups Real projective varieties Mathematical techniques |
description |
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties. Here numerical means that the algorithm is numerically stable (in a sense to be made precise). Its cost depends on the condition of the input as well as on its size and is singly exponential in the number of variables (the dimension of the ambient space) and polynomial in the condition and the degrees of the defining polynomials. In addition, we show that outside of an exceptional set of measure exponentially small in the size of the data, the algorithm takes exponential time. © 2017, SFoCM. |
title |
Computing the Homology of Real Projective Sets |
title_short |
Computing the Homology of Real Projective Sets |
title_full |
Computing the Homology of Real Projective Sets |
title_fullStr |
Computing the Homology of Real Projective Sets |
title_full_unstemmed |
Computing the Homology of Real Projective Sets |
title_sort |
computing the homology of real projective sets |
publishDate |
2018 |
url |
https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_16153375_v18_n4_p929_Cucker http://hdl.handle.net/20.500.12110/paper_16153375_v18_n4_p929_Cucker |
_version_ |
1768543391762612224 |