Dynamic programming for the stochastic burgers equation

14Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We solve a control problem for the stochastic Burgers equation using the dynamic programming approach. The cost functional involves exponentially growing functions and the analog of the kinetic 'energy; the case of a distributed parameter control is considered. The Hamilton-Jacobi equation is solved by a compactness method and a-priori estimates are obtained thanks to the regularizing properties of the transition semigroup associated to the stochastic Burgers equation; a fixed point argument does not seem to apply here.

Cite

CITATION STYLE

APA

Prato, G. D. A., & Debussche, A. (2000). Dynamic programming for the stochastic burgers equation. Annali Di Matematica Pura Ed Applicata, 178(1), 143–174. https://doi.org/10.1007/bf02505893

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free