Parallel computation of nearly recurrent components of piecewise constant vector fields

DOI10.1007/978-3-319-04099-8_8MaRDI QIDQ3454950zbMATH OpenOpenAlexFDO

Authors Nicholas Brunhart-Lupo, Andrzej Szymczak

Publication date 3 December 2015

Published in Mathematics and Visualization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04099-8_8

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Vector fields, frame fields in differential topology (57R25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Morse connection graphs for piecewise constant vector fields on surfaces
• Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
• Efficient computation of Lyapunov functions for Morse decompositions
• A parallel algorithm for computing the flow complex
• scientific article; zbMATH DE number 195129

Cites work

• Depth-First Search and Linear Graph Algorithms
• Deterministic Nonperiodic Flow

Cited in

(2)

• Morse connection graphs for piecewise constant vector fields on surfaces
• scientific article; zbMATH DE number 6378042 (Why is no real title available?)

Describes a project that uses

Uses Software

• CUDA

This page was built for publication: Parallel computation of nearly recurrent components of piecewise constant vector fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454950)