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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Also arXiv:1301.4777International audienceMax-plus based methods have been recently explored for solution of first-order Hamilton--Jacobi--Bellman equations by several authors. Among several max-plus numerical methods, McEneaney's curse-of-dimensionality--free method applies to the equations where the Hamiltonian takes the form of a (pointwise) maximum of linear/quadratic forms. In previous works of McEneaney and Kluberg, the approximation error of the method was shown to be $O(1/(N\tau))$+$O(\sqrt{\tau})$, where $\tau$ is the time discretization step and $N$ is the number of iterations. Here we use a recently established contraction result for the indefinite Riccati flow in Thompson's part metric to show that under different technical assumptions, still covering an important class of problems, the error is only of order $O(e^{-\alpha N\tau})+O(\tau)$ for some $\alpha>0$. This also allows us to obtain improved estimates of the execution time and to tune the precision of the pruning procedure, which in practice is a critical element of the method

Contraction of Riccati Flows Applied to the Convergence Analysis of a Max-Plus Curse-of-Dimensionality--Free Method