東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Implicit Runge-Kutta methods for sti...

Biehn, Neil David.

FindBook

Google Book

Amazon

博客來

Implicit Runge-Kutta methods for stiff and constrained optimal control problems.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Implicit Runge-Kutta methods for stiff and constrained optimal control problems./
作者:	Biehn, Neil David.
面頁冊數:	132 p.
附註:	Adviser: Stephen L. Campbell.
Contained By:	Dissertation Abstracts International62-12B.
標題:	Engineering, System Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3033633
ISBN:	0493465472

Implicit Runge-Kutta methods for stiff and constrained optimal control problems.
Biehn, Neil David.

Implicit Runge-Kutta methods for stiff and constrained optimal control problems. - 132 p.

Adviser: Stephen L. Campbell.

Thesis (Ph.D.)--North Carolina State University, 2001.

The purpose of the research presented in this thesis is to better understand and improve direct transcription methods for stiff and state constrained optimal control problems. When some implicit Runge-Kutta methods are implemented as approximations to the dynamics of an optimal control problem, a loss of accuracy occurs when the dynamics become stiff or constrained. A new grid refinement strategy which exploits the variation of accuracy is discussed. In addition, the use of a residual function in place of classical error estimation techniques is proven to work well for stiff systems. Computational experience reveals the improvement in efficiency and reliability when the new strategies are incorporated as part of a direct transcription algorithm. For index three differential-algebraic equations, the solutions of some implicit Runge-Kutta methods may not converge. However, computational experience reveals apparent convergence for the same methods used when index three state inequality constraints become active. It is shown that the solution <italic>chatters</italic> along the constraint boundary allowing for better approximations. Moreover, the consistency of the nonlinear programming problem formed by a direct transcription algorithm using an implicit Runge-Kutta approximation is proven for state constraints of arbitrary index.

ISBN: 0493465472Subjects--Topical Terms:

1018128
Engineering, System Science.

Implicit Runge-Kutta methods for stiff and constrained optimal control problems.
LDR:02247nam 2200277 a 45 001 934614
005 20110509
008 110509s2001 eng d
020 $a 0493465472
035 $a (UnM)AAI3033633
035 $a AAI3033633
040 $a UnM $c UnM
100 1 $a Biehn, Neil David. $3 1258314
245 1 0 $a Implicit Runge-Kutta methods for stiff and constrained optimal control problems.
300 $a 132 p.
500 $a Adviser: Stephen L. Campbell.
500 $a Source: Dissertation Abstracts International, Volume: 62-12, Section: B, page: 5942.
502 $a Thesis (Ph.D.)--North Carolina State University, 2001.
520 $a The purpose of the research presented in this thesis is to better understand and improve direct transcription methods for stiff and state constrained optimal control problems. When some implicit Runge-Kutta methods are implemented as approximations to the dynamics of an optimal control problem, a loss of accuracy occurs when the dynamics become stiff or constrained. A new grid refinement strategy which exploits the variation of accuracy is discussed. In addition, the use of a residual function in place of classical error estimation techniques is proven to work well for stiff systems. Computational experience reveals the improvement in efficiency and reliability when the new strategies are incorporated as part of a direct transcription algorithm. For index three differential-algebraic equations, the solutions of some implicit Runge-Kutta methods may not converge. However, computational experience reveals apparent convergence for the same methods used when index three state inequality constraints become active. It is shown that the solution <italic>chatters</italic> along the constraint boundary allowing for better approximations. Moreover, the consistency of the nonlinear programming problem formed by a direct transcription algorithm using an implicit Runge-Kutta approximation is proven for state constraints of arbitrary index.
590 $a School code: 0155.
650 4 $a Engineering, System Science. $3 1018128
650 4 $a Operations Research. $3 626629
690 $a 0790
690 $a 0796
710 2 0 $a North Carolina State University. $3 1018772
773 0 $t Dissertation Abstracts International $g 62-12B.
790 $a 0155
790 1 0 $a Campbell, Stephen L., $e advisor
791 $a Ph.D.
792 $a 2001
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3033633