Symbolic computation approach for absolute stability

Computational Approach to Control Laws of Strict-Feedback Nonlinear Systems

“…if n=6 then break fi;sx [7]:=t->rhs(s [7](t) [2]): sxi1 [7]:=t->rhs(s [7](t) [3]): if n=7 then break fi;sx [8]:=t->rhs(s [8](t) [2]):sxi1 [8]:=t->rhs(s [8](t) [3]): if n=8 then break fi;sx [9]:=t->rhs(s [9](t) [2]):sxi1 [9]:=t->rhs(s [9](t) [3]): if n=9 then break fi;sx [10]:=t->rhs(s [10](t) [2]):sxi1 [10]:=t->rhs(s [10](t) [3] …”

“…The first argument of the procedure is ( ) if n=5 then break fi;sx [6]:=t->rhs(s [6](t) [2]): sxi1 [6]:=t->rhs(s [6](t) [3]):…”

“…a [1] a [2] a [3] Figure 2. a [1], a [2]), and a [3] are phase portraits of the nonlinear control system (5) in two levels using back-stepping algorithm. We use functions f and g from the system (7) to be used for Equation (1) …”

Symbolic computation of Hurwitz criterion

“…[l], [3], [6] Due to its accuracy, ability to deal with symbols, and hybrid symbolic-numerical computations, it is suitable for solving many control problems.…”