ss_algorithms

wield.control.algorithms.statespace.dense.ss_algorithms

Classes

TupleABCDE

alias of ABCDE

Functions

chain(SSs[, orientation])	Construct a sequential product of state spaces.
chainE(SSs[, orientation])
controllable_staircase(ABCDE[, tol, ...])	Implementation of COMPUTATION OF IRREDUCIBLE GENERALIZED STATE-SPACE REALIZATIONS ANDRAS VARGA using givens rotations.
inverse_DSS(A, B, C, D, E)
reduce_modal(A, B, C, D, E[, mode, tol, use_svd])	TODO simplify a bunch!

Details

chain(SSs, orientation='lower')

Construct a sequential product of state spaces. Each state space must be a tuple of ABCD or ABCDE

chainE(SSs, orientation='lower')

controllable_staircase(ABCDE, tol=1e-14, zero_test=<function <lambda>>, reciprocal_system=False, do_reduce=False, debug_path=None)

Implementation of COMPUTATION OF IRREDUCIBLE GENERALIZED STATE-SPACE REALIZATIONS ANDRAS VARGA using givens rotations.

it is very slow, but numerically stable

TODO, add pivoting, TODO, make it use the U-T property on E better for speed TODO, make it output Q and Z to apply to aux matrices, perhaps use them on C

inverse_DSS(A, B, C, D, E)

reduce_modal(A, B, C, D, E, mode='C', tol=1e-07, use_svd=False)

TODO simplify a bunch!