搜索结果: 1-15 共查到“知识库 理学 computing”相关记录113条 . 查询时间(0.063 秒)
Computing Global Characters
Global Characters
font style='font-size:12px;'>
2015/9/28
Let π be an irreducible representation of a real reductive group G. The global character θπ of π may be considered as a function on the regular semisimple elements of G. The global character determine...
COMPUTING HOPF BIFURCATIONS II: THREE EXAMPLES FROM NEUROPHYSIOLOGY
Hopf bifurcation resultant bialternate product neuron model
font style='font-size:12px;'>
2015/8/25
In a previous paper [11] we presented algorithms for detecting Hopf bifurcations in
two-parameter families of vector elds based on classical algebraic constructions. In addition to their
utility as...
Simulation and Beyond: Computing in the 21st Century
Simulation and Beyond Computing
font style='font-size:12px;'>
2015/8/25
Computers have a remarkable ability to simulate natural and arti cial
phenomena. Industry, science, economic a airs and national security have
come to rely upon simulation as an essential technology...
Computing Periodic Orbits and their Bifurcations with Automatic Differentiation
Automatic Differentiation Computing Periodic Orbits
font style='font-size:12px;'>
2015/8/25
This paper examines algorithms for computing periodic orbits of dynamical systems. Our
goal is to explore the limits of accuracy that are attainable for these calculations within
the pragmatic conte...
Computing Periodic Orbits
Computing Periodic Orbits freedom
font style='font-size:12px;'>
2015/8/25
The dynamics of
uids are often studied through the reduction of partial di erential
equations to systems with only a few degrees of freedom. Analysis of these low dimensional
vector elds remains ...
Computing the threshold shift for general channels
Threshold the probability curve noise the binary
font style='font-size:12px;'>
2015/8/21
The ‘threshold’ of a code ensemble can be defined as the noise level at which the block error probability curve crosses 1/2. For ensembles of low-density parity check codes used over the binary erasur...
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
font style='font-size:12px;'>
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...
A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its L_infinity-norm
Matrix and singular value differentiable function frequency singular value lipschitz second derivative
font style='font-size:12px;'>
2015/8/12
The ith singular value of a transfer matrix need not be a differentiable function of frequency where its multiplicity is greater than one. We show that near a local maximum, however, the largest singu...
Computing the minimum stability degree of parameter-dependent linear systems
Parameters related to linear system program control system the branch and bound algorithm is calculated
font style='font-size:12px;'>
2015/8/12
For linear systems with unspecified parameters that lie between given upper and lower bounds, we present a branch and bound algorithm that computes the minimum stability degree.
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
font style='font-size:12px;'>
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...
Computing bounds for the structured singular value via an interior point algorithm
Calculation structure singular value the interior point algorithm
font style='font-size:12px;'>
2015/8/12
We describe an interior point algorithm for computing the upper bound for the structured singular value described in the paper by Fan, Tits and Doyle, IEEE Trans AC, Jan. 1991. We demonstrate the perf...
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.
font style='font-size:12px;'>
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 optimal uncertainty models from frequency domain data
Uncertainty model robust control multivariate nonparametric linear matrix inequality the noise
font style='font-size:12px;'>
2015/8/11
Uncertainty models are an essential ingredient in robust control design. In addition, because of the tradeoff between uncertainty and performance, the uncertainty model should be as ‘tight’ as possibl...
Experiences with distributed computing for meteorological applications:grid computing and cloud computing
distributed computing meteorological applications grid computing cloud computing
font style='font-size:12px;'>
2015/8/6
Experiences with three practical meteorological applications with different characteristics are used to highlight the core computer science aspects and applicability of distributed computing to meteor...
THREE EXAMPLES OF MONTE-CARLO MARKOV CHAINS:AT THE INTERFACE BETWEEN STATOSTICAL COMPUTING,COMPUTER SCIENCE,AND STATISTICAL MECHANICS
Monte carlo markov chain the interface between computing computer science statistical mechanics
font style='font-size:12px;'>
2015/7/14
THREE EXAMPLES OF MONTE-CARLO MARKOV CHAINS:AT THE INTERFACE BETWEEN STATOSTICAL COMPUTING,COMPUTER SCIENCE,AND STATISTICAL MECHANICS。