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

In the first part of this paper we introduced an algorithm that usesreachable set approximation to approximate the minimum time function of linearcontrol problems. To illustrate the error estimates and to demonstratedifferences to other numerical approaches we provide a collection of numericalexamples which either allow higher order of convergence with respect to timediscretization or where the continuity of the minimum time function cannot besufficiently granted, i.e. we study cases in which the minimum time function isH\"older continuous or even discontinuous.

Construction of the Minimum Time Function Via Reachable Sets of Linear Control Systems. Part 2: Numerical Computations