2001
DOI: 10.1016/s0898-1221(00)00334-5
|View full text |Cite
|
Sign up to set email alerts
|

The finite element approximation of Hamilton-Jacobi-Bellman equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
64
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 54 publications
(65 citation statements)
references
References 7 publications
1
64
0
Order By: Relevance
“…The sequences ( ) k h Û well defined in K and converge to the unique solution of system of inequalities (8). where…”
Section: Theorem 2: [1]mentioning
confidence: 99%
See 3 more Smart Citations
“…The sequences ( ) k h Û well defined in K and converge to the unique solution of system of inequalities (8). where…”
Section: Theorem 2: [1]mentioning
confidence: 99%
“…At each iteration, a linear complementary subproblem or a linear equation system subproblem is solved. Boulbrachene and Haiour [8], by means of a subsolution method, conducted a finite element approximation study for the first time, for the stationary of the problem (1) and by using Bensoussan-Lions algorithm [4], a quasi-optimal error estimate in the ∞ L -norm has been derived according the following result…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Finite element method is one of the ways of applied Mathematics. And we put it in space, using the principles inherited from the transformative formulation or weak wording, separate mathematical algorithm to find approximate solution to the problem of free boundary (see [3], [4] and [14]). It is said Dirichlet conditions or Neumann data.…”
Section: Introductionmentioning
confidence: 99%