Search Results - "Biehn, N."

Compensating for order variation in mesh refinement for direct transcription methods II: computational experience by Betts, J.T., Biehn, N., Campbell, S.L., Huffman, W.P.

“…The numerical theory for Implicit Runge Kutta methods shows that there can be order reduction when these methods are applied to either stiff or differential…”
Get full text

Observer design for linear time varying descriptor systems: numerical algorithms by Biehn, N., Campbell, S.L., Delebecque, F., Nikoukhah, R.

“…Examines the design of observers for linear time varying descriptor systems for which the observer estimates are also physically correct in that they satisfy…”
Get full text

Compensating for order variation in mesh refinement for direct transcription methods by Betts, John T., Biehn, Neil, Campbell, Stephen L., Huffman, William P.

“…The numerical theory for Implicit Runge–Kutta methods shows that there can be order reduction when these methods are applied to either stiff or differential…”
Get full text

Numerically constructible observers for linear time-varying descriptor systems by Biehn, Neil, Campbell, Stephen L., Nikoukhah, Ramine, Delebecque, Francois

“…This paper examines the design of observers for linear time-varying descriptor systems. An observer is designed for which the observer estimates are also…”
Get full text

Some comments on DAE theory for IRK methods and trajectory optimization by Biehn, Neil, Campbell, Stephen L., Jay, Laurent, Westbrook, Tracey

“…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…”
Get full text

Some comments on DAE theory for irk methods and trajectory optimization: SQP-based direct discretization methods for practical optimal control problems by BIEHN, N, CAMPBELL, S. L, JAY, L, WESTBROOK, T

Get full text