搜索结果: 1-15 共查到“知识库 数值代数”相关记录80条 . 查询时间(3.265 秒)
数值模式的模拟和预测仍然存在较大的不确定性，其中物理参数的不确定性是导致该类不确定性的重要来源之一。由于模式中包含大量的物理参数，减少所有物理参数的不确定性以提高模式的模拟能力和预测技巧将耗费大量的人力和物力。因此，识别敏感的物理参数或参数组合至关重要。
On the Behavior of the Total Variation in CWENO Methods for Conservation Laws
Hyperbolic conservation laws Central difference schemes High-order accuracy Non-oscillatory schemes CWENO reconstruction TVB
2015/10/8
We consider a family of high-order, weighted essentially non-oscillatory central schemes (CWENO) for approximating solutions of one-dimensional hyperbolic systems of conservation laws. We are interest...
Non-Oscillatory Central Schemes for the Incompressible 2D Euler Equations
Hyperbolic conservation laws second-order accuracy central difference schemes non-oscillatory schemes Incompressible Euler equations
2015/10/8
We adopt a non-oscillatory central scheme, first presented in the context of Hyperbolic conservation laws in [nessyahu-tadmor] followed by [jiang-tadmor], to the framework of the incompressible Eule...
We derive an asymptotic for the rst moment of Hecke L-series associated to canonical qua- dratic characters. This provides another proof and slightly generalizes recent results by Masri and Kim-Masri...
Computing the threshold shift for general channels
Threshold the probability curve noise the binary
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...
Computing bounds for the structured singular value via an interior point algorithm
Calculation structure singular value the interior point algorithm
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...
Numerical methods for H_2 related problems
Numerical convex programming quantity convex programming application
2015/8/12
Recent results have shown that several H_2 and H_2-related problems can be formulated as convex programs with a finite number of variables. We present an interior point algorithm for the solution of t...
Closed-loop convex formulation of classical and singular value loop shaping
Singular value circulation formation control dynamic systems digital technology application control system design
2015/8/12
We show that control system design via classical loop shaping and singular value loop shaping can be formulated as a closed-loop convex problem. Consequently, loop shaping problems can be solved by ef...
Antenna array pattern synthesis via convex optimization
Antenna array model numerical geometric shape elements value
2015/8/11
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great efficiency by recently developed inter...
Dynamic emission tomography - regularization and inversion
Emission tomography subtracting the poison radon pathology emission source static pathological inverse
2015/8/11
The problem of emission tomography, inverting the attenuated Radon transform, is moderately ill-posed if the unknown emission source is static. Here we consider the case where the emission source is d...
Robust efficient frontier analysis with a separable uncertainty model
The mean - variance model effective portfolio construction model parameters return on assets uncertainty analysis and numerical examples
2015/8/10
Mean-variance (MV) analysis is often sensitive to model mis-specification or uncertainty, meaning that the MV efficient portfolios constructed with an estimate of the model parameters (i.e., the expec...
Filter design with low complexity coefficients
Heuristic design low complexity coefficient filters with nonzero number the filter coefficients
2015/8/10
We introduce a heuristic for designing filters that have low complexity coefficients, as measured by the total number of nonzeros digits in the binary or canonic signed digit (CSD) representations of ...
Fastest mixing Markov chain on graphs with symmetries
Markov chains fast mixing eigenvalue optimization semidefi nite programming graph automorphism group representation
2015/8/10
We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest ei...
Moving horizon estimation for staged QP problems
Moving horizon estimation quadratic programming the structure the kalman filter linear system numerical values
2015/8/7
This paper considers moving horizon estimation (MHE) approach to solution of staged quadratic programming (QP) problems. Using an insight into the constrained solution structure for the growing horizo...
Monotonicity and restart in fast gradient methods
flat gradient algorithm oscillation values
2015/8/7
Fast gradient methods are known to be non-monotone algorithms, and oscillations typically occur around the solution. To avoid this behavior, we propose in this paper a fast gradient method with restar...
