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 Plus annual

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

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Sweeping is a commonly used procedure to explicitly solve the discreteordinates equation, which itself is a common approximation of the neutrontransport equation. To sweep through the computational domain, an ordering ofthe spatial cells is required that obeys the flow of information. We show thatthis ordering can always be found, assuming a discretization of the spatialdomain with regular triangles with no hanging nodes.

A short proof that sweeping is always possible for a spatial discretization with regular triangles and no hanging nodes