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/

Global: Zendy Tools annual

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

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Geometric computing with chain complexes allows for the computation of thewhole chain of linear spaces and (co)boundary operators generated by a spacedecomposition into a cell complex. The space decomposition is stored andhandled with LAR (Linear Algebraic Representation), i.e. with sparse integerarrays, and allows for using cells of a very general type, even non convex andwith internal holes. In this paper we discuss the features and the merits ofthis approach, and describe the goals and the implementation of a softwarepackage aiming at providing for simple and efficient computational support ofgeometric computing with any kind of meshes, using linear algebra tools withsparse matrices. The library is being written in Julia, the novel efficient andparallel language for scientific computing. This software, that is being portedon hybrid architectures (CPU+GPU) of last generation, is yet under development.

Geometric Computing with Chain Complexes: Design and Features of a Julia Package