2018
DOI: 10.14736/kyb-2018-4-0629
|View full text |Cite
|
Sign up to set email alerts
|

Solving a class of Hamilton-Jacobi-Bellman equations using pseudospectral methods

Abstract: Institute of Mathematics of the Czech Academy of Sciences provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 33 publications
0
6
0
Order By: Relevance
“…As an optimal control problem Mehrali-Varjani et al 18 solved a class of Hamilton Jacobi-bellman equations using pseudospectral methods in the year 2018. Abbasi and Malek 19 presented hyperthermia cancer therapy by domain decomposition methods using strongly continuous semigroups in the year 2019.…”
Section: Introductionmentioning
confidence: 99%
“…As an optimal control problem Mehrali-Varjani et al 18 solved a class of Hamilton Jacobi-bellman equations using pseudospectral methods in the year 2018. Abbasi and Malek 19 presented hyperthermia cancer therapy by domain decomposition methods using strongly continuous semigroups in the year 2019.…”
Section: Introductionmentioning
confidence: 99%
“…In 2018, Malek and Varjani solved a class of Hamilton Jacobi-bellman equations using pseudospectral methods [14]. In 2019, Malek and Abbasi introduced hyperthermia cancer therapy by domain decomposition methods using strongly continuous semigroups [15].…”
Section: Introductionmentioning
confidence: 99%
“…ðnÀ 1Þ�1: ð16ÞI is identity matrix, b j is a column vector of zeros and known boundary values which are added with a fixed value of c m .2.1.3 Solution of the linear-quadratic regulator.The minimization of the performance index J will be done using Pontryagin's minimum principle[14,29]. The Hamiltonian is HðmðtÞ; UðtÞ; λðtÞ; tÞ ¼ mðtÞ T mðtÞ þ UðtÞ T UðtÞ þλ T ðtÞðAmðtÞ þ BUðtÞ þ bÞ;…”
mentioning
confidence: 99%
“…Thus, we proposed a hybrid method based on first discretize, and then optimize (direct method). In section ''Numerical method,'' pseudospectral method (see, for example, Betts et al (2016); Ma et al (2017); Malek and Momeni-Masuleh (2008); Mehrali-Varjani et al (2018)) is chosen for discretization of the problem. Using pseudospectral discretization and domain decomposition in nine regions yields a quadratic programming problem.…”
Section: Introductionmentioning
confidence: 99%