搜索结果: 1-5 共查到“代数学 Computing”相关记录5条 . 查询时间(0.117 秒)
A bisection method for computing the H_infinity-norm of a transfer matrix and related problems
Transfer matrix singular value assessment the Hamiltonian matrix characteristic values of linear algebra
2015/8/13
Inspired by recent work of Byers we establish a simple connection between the singular values of a transfer matrix evaluated along the imaginary axis and the imaginary eigenvalues of a related Hamilto...
Branch-and-bound algorithm for computing the minimum stability degree of parameter-dependent linear systems
Branch and bound algorithm linear systems a robust nonlinear and linear system stability the parameters of linear system
2015/8/12
We consider linear systems with unspecified parameters that lie between given upper and lower bounds. Except for a few special cases, the computation of many quantities of interest for such systems ca...
On computing the worst-case peak gain of linear systems
SISO discrete-time LTI systems computation of `1-gain discrete-time systems with diagonal perturbations worst-case `1-gain.
2015/8/12
Based on the bounds in the paper by Boyd and Doyle (Comparison of peak and RMS gains for discrete-time systems, Systems and Control Letters, 9:1-6), we present simple upper and lower bounds for the el...
Computing the topological entropy of unimodal maps
Topological entropy interval maps symbolic dynamics
2011/3/2
We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm
is obtained by t...
Computing invariants via slicing groupoids: Gel'fand MacPherson, Gale and positive characteristic stable maps
Computing invariants via slicing groupoids Gel'fand MacPherson
2010/11/22
We offer a groupoid-theoretic approach to computing invariants. We illustrate this approach by describing the Gel'fand-MacPherson correspondence and the Gale transform as well as giving Zariski-local...