The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2018
DOI: 10.1016/j.apm.2017.05.015
|View full text |Cite
|
Sign up to set email alerts
|

A sequential computational approach to optimal control problems for differential-algebraic systems based on efficient implicit Runge–Kutta integration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
43
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 13 publications
(43 citation statements)
references
References 10 publications
0
43
0
Order By: Relevance
“…It is known that integral computations could be time-consuming, especially for complicated mathematical functions. Thus, in this case numerical approximations provide acceptable solutions within a short execution time 29 …”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…It is known that integral computations could be time-consuming, especially for complicated mathematical functions. Thus, in this case numerical approximations provide acceptable solutions within a short execution time 29 …”
Section: Methodsmentioning
confidence: 99%
“…Thus, in this case numerical approximations provide acceptable solutions within a short execution time. 29 We used MATLAB software (MathWorks, Inc., Natick, MA, USA) to compute the integrals. The MATLAB/C + + platform was established by linking required MATLAB libraries to our program.…”
Section: The Mucpmentioning
confidence: 99%
“…Before the iterative solution, the original boundary conditions Equation (11) need to be considered. To impose the boundary conditions, the equations and Jacobian matrix need to be modified.…”
Section: Iterative Solution Methods Of Discrete Equationsmentioning
confidence: 99%
“…For the initial boundary conditions x (0) = x 0 in Equation ( 11), substituting x 0 in the equations Equation (47) by x 0 , that is, the subvector of F is modified as F [1∶nx] = F 1 1 − x 0 . For the terminal boundary conditions in Equation (11), two cases need to be considered respectively:…”
Section: Iterative Solution Methods Of Discrete Equationsmentioning
confidence: 99%
See 1 more Smart Citation