Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2006
DOI: 10.1016/j.mcm.2006.03.002
|View full text |Cite
|
Sign up to set email alerts
|

An efficient computational method for the optimal control problem for the Burgers equation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(10 citation statements)
references
References 16 publications
0
10
0
Order By: Relevance
“…Their eventual purpose is to extend this technique to the control problems of viscous fluid flows [54]. As far as we know, other papers were also devoted to its study of [55][56][57][58][59][60] and the citations therein were also devoted its study. Apart for the case of the Burgers equation, there are plenty of researches concerned with other optimal control problem.…”
Section: Introductionmentioning
confidence: 99%
“…Their eventual purpose is to extend this technique to the control problems of viscous fluid flows [54]. As far as we know, other papers were also devoted to its study of [55][56][57][58][59][60] and the citations therein were also devoted its study. Apart for the case of the Burgers equation, there are plenty of researches concerned with other optimal control problem.…”
Section: Introductionmentioning
confidence: 99%
“…This method generalizes an approach studied in the mid-1980s to solve optimal control problems for systems described by ordinary differential equations [18] to partial differential equations, in a similar manner as has been done for sheet and film processes (e.g., see [6], and citations therein) as well as nonlinear PDEs such as Burgers equation [9]. To apply this method, start with the analytical solution to the PDE (4)-(7)…”
Section: Basis Function Expansionmentioning
confidence: 99%
“…For example, in the case where a single control variable is spatially distributed throughout the domain, 100 discretization points in each spatial dimension and in time results in 100 4 = 10 8 degrees of freedom in the algebraic optimization. This large dimensionality problem is well recognized in the optimal control literature (e.g., [9], [18]). While many approaches have been proposed, no single algorithm dominates either the literature or applications and it is generally accepted that the best approach depends on the details on the optimal control problem being solved.…”
Section: Problem Setupmentioning
confidence: 99%
“…Pugh [149] determined that the Galerkin/conservation method are more accurate and compute more quickly than the Galerkin method for the Burgers equation with neumann boundary conditions. Kucuk and Sadek [150] presented an efficient numerical scheme for the optimal control of the Burgers equation by means of point-wise actuators in the spatial domain. The study also pointed that the location of actuators can play a crucial role if they are not calculated optimally.…”
Section: Survey Of Different Techniquesmentioning
confidence: 99%