Abstract:We introduce the concept of "stabilization by rotation" for deterministic linear systems with negative trace. This concept encompasses the well-known concept of "vibrational stabilization" introduced by Meerkov in the 1970s and is a deterministic version of 'stabilization by noise' for stochastic systems as introduced by Arnold and coworkers in the 1980s. It is shown that a linear system with negative trace can be stabilized by adding a skew-symmetric matrix, multiplied by a suitable scalar so-called "gain fun… Show more
“…The case b < 0 is slightly more subtle. We first derive a lower bound for s in (9). To this end note that the norm A 4 2 = ∆ is invariant under orthogonal transformations and a ≤ ∆.…”
Section: Symplectic Transformation Of a Matrixmentioning
confidence: 99%
“…Vice versa, one can ask, whether for any matrix A with trace A < 0, there exists a zero trace matrix M of a certain type, such that σ(A + M) ⊂ C − . In [9] it has been shown, that such a matrix M can always be chosen to be skew-symmetric. Then we say that M stabilizes A or by rotation, see e.g.…”
Section: Hamiltonian Stabilization By Rotationmentioning
confidence: 99%
“…Hence for µ > 3.7 the system ẋ = (A + µ M0 )x is asymptotically stable. In [9] a servo-mechanism was described, which chooses a suitable gain µ adaptively via the feedback equation…”
We consider orthogonal transformations of arbitrary square matrices to a form where all diagonal entries are equal. In our main results we treat the simultaneous transformation of two matrices and the symplectic orthogonal transformation of one matrix. A relation to the joint real numerical range is worked out, efficient numerical algorithms are developped and applications to stabilization by rotation and by noise are presented.
“…The case b < 0 is slightly more subtle. We first derive a lower bound for s in (9). To this end note that the norm A 4 2 = ∆ is invariant under orthogonal transformations and a ≤ ∆.…”
Section: Symplectic Transformation Of a Matrixmentioning
confidence: 99%
“…Vice versa, one can ask, whether for any matrix A with trace A < 0, there exists a zero trace matrix M of a certain type, such that σ(A + M) ⊂ C − . In [9] it has been shown, that such a matrix M can always be chosen to be skew-symmetric. Then we say that M stabilizes A or by rotation, see e.g.…”
Section: Hamiltonian Stabilization By Rotationmentioning
confidence: 99%
“…Hence for µ > 3.7 the system ẋ = (A + µ M0 )x is asymptotically stable. In [9] a servo-mechanism was described, which chooses a suitable gain µ adaptively via the feedback equation…”
We consider orthogonal transformations of arbitrary square matrices to a form where all diagonal entries are equal. In our main results we treat the simultaneous transformation of two matrices and the symplectic orthogonal transformation of one matrix. A relation to the joint real numerical range is worked out, efficient numerical algorithms are developped and applications to stabilization by rotation and by noise are presented.
“…A celebrated example is Kapiza's problem of the inverted pendulum [13]. This averaging is also effective in case of deterministic rotation of the system [10]. But there are very few examples due to additive noise.…”
Section: Stabilization Due To Additive Noise Dirk Blömkermentioning
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.