Some comments on DAE theory for IRK methods and trajectory optimization

Neil Biehn; Stephen L Campbell; Laurent Jay; Tracey Westbrook

doi:10.1016/s0377-0427(00)00306-x

Back

Some comments on DAE theory for IRK methods and trajectory optimization

Journal article

Open access

Some comments on DAE theory for IRK methods and trajectory optimization

Neil Biehn, Stephen L Campbell, Laurent Jay and Tracey Westbrook

Journal of Computational and Applied Mathematics, Vol.120(1-2), pp.109-131

08/01/2000

DOI: 10.1016/s0377-0427(00)00306-x

Files and links (1)

url

https://doi.org/10.1016/s0377-0427(00)00306-xView

Published (Version of record) Open Access

Abstract

It has been observed elsewhere in the literature that the activation of constraints in a trajectory optimization problem can lead to higher index DAEs. Several existing codes can handle a number of these constrained problems. In this note we will discuss why the situation is more complex than just saying a higher index DAE occurs. The discussion is in the context of a specific industrial code SOCS but the observations made here have relevance for a number of methods and have implications for what types of test problems a code should be tested on.

Computational Mathematics

Applied Mathematics

Details

Title: Subtitle: Some comments on DAE theory for IRK methods and trajectory optimization
Creators: Neil Biehn
Stephen L Campbell
Laurent Jay
Tracey Westbrook
Resource Type: Journal article
Publication Details: Journal of Computational and Applied Mathematics, Vol.120(1-2), pp.109-131
DOI: 10.1016/s0377-0427(00)00306-x
ISSN: 0377-0427
Publisher: Elsevier BV
Language: English
Date published: 08/01/2000
Academic Unit: Mathematics
Record Identifier: 9983986095902771

Metrics

21 Record Views