English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We present a parallelizable algorithm for computing the persistent homologyof a filtered chain complex. Our approach differs from the commonly usedreduction algorithm by first computing persistence pairs within local chunks,then simplifying the unpaired columns, and finally applying standard reductionon the simplified matrix. The approach generalizes a technique by G\"unther etal., which uses discrete Morse Theory to compute persistence; we derive thesame worst-case complexity bound in a more general context. The algorithmemploys several practical optimization techniques which are of independentinterest. Our sequential implementation of the algorithm is competitive withstate-of-the-art methods, and we improve the performance through parallelizedcomputation.

Clear and Compress: Computing Persistent Homology in Chunks