University of Cambridge > > Applied and Computational Analysis > Computing the homology of basic semialgebraic sets

Computing the homology of basic semialgebraic sets

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Hamza Fawzi.

We describe a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of a basic semialgebraic set. The algorithm is numerically stable in the sense that the precision required to guarantee a correct output depends on the condition number of the data and it is polynomially small. Its running time also depends on this condition but it is bounded by a singly exponential bound on the size of the input out of a vanishingly small set of data. All algorithms previously proposed for this problem have a complexity which is doubly exponential (and this is so for almost all data).

This is joint work with Felipe Cucker and Pierre Lairez.

This talk is part of the Applied and Computational Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity