搜索结果: 1-15 共查到“理学 Bounds”相关记录178条 . 查询时间(0.133 秒)
BOUNDS FOR SERRE’S OPEN IMAGE THEOREM
SERRE’S OPEN IMAGE THEOREM
font style='font-size:12px;'>
2015/8/26
Consider an elliptic curve E without complex multiplication defined over the rationals.The absolute Galois group of Q acts on the group of torsion points of E, and this action can be expressed in term...
BOUNDS FOR THE LANG-TROTTER CONJECTURES
LANG-TROTTER CONJECTURES
font style='font-size:12px;'>
2015/8/26
For a non-CM elliptic curve E/Q, Lang and Trotter made very deep conjectures concerning the number of primes p ≤ x for which ap(E) is a fixed integer (and for which the Frobeniusfield at p is a fixed ...
HYBRID SUP-NORM BOUNDS FOR HECKE-MAASS CUSP FORMS
Cutting-edge characteristic value hyperbolic measure
font style='font-size:12px;'>
2015/8/25
Let f be a Hecke–Maass cusp form of eigenvalue λ and square-free level N. Normalize the hyperbolic measure such that vol(Y0(N)) = 1 and the form f such that kfk2 = 1. It is shown that kfk1 ≪1...
Tight bounds for LDPC and LDGM codes under MAP decoding
Conditional entropy Low Density Parity Check Codes Maximum A Posteriori probability decoding Spin glasses Statistical physics
font style='font-size:12px;'>
2015/8/21
A new method for analyzing low density parity check (LDPC) codes and low density generator matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is introduced. The method is ba...
Nonlinear Estimators and Tail Bounds for Dimension Reduction in l1 Using Cauchy Random Projections
dimension reduction l1 norm Johnson-Lindenstrauss (JL) lemma Cauchy random projections
font style='font-size:12px;'>
2015/8/21
For1 dimension reduction in the l1 norm, the method of Cauchy random projections multiplies the original data matrix A ∈ Rn×D with a random matrix R ∈ RD×k (k D) whose entries are i.i.d. samples of ...
Subharmonic functions and performance bounds on linear time-invariant feedback systems
Harmonic function linear the performance of the single output system a linear control system the harmonic function
font style='font-size:12px;'>
2015/8/13
In this paper we study multi-input multi-output (MIMO) linear time-invariant (LTI) control systems. We show that some well known constraints on the performance of single-input single-output (SISO) lin...
Perturbation bounds for structured robust stability
Robustness, stability function
font style='font-size:12px;'>
2015/8/13
Robust stability of a linear multivariable system, in the sense of robustness under multiplicative transfer function perturbation, is necessarily preserved under sufficiently small perturbations in th...
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...
Upper bounds on algebraic connectivity via convex optimization
Laplace operator matrix algebra connection Laplacian invariant subset matrix convex function
font style='font-size:12px;'>
2015/8/10
The second smallest eigenvalue of the Laplacian matrix L of a graph is called its algebraic connectivity. We describe a method for obtaining an upper bound on the algebraic connectivity of a family of...
Generalized Chebyshev bounds via semidefinite programming
Quadratic inequality convex optimization computation single variable and random variable chebyshev inequality
font style='font-size:12px;'>
2015/8/10
A sharp lower bound on the probability of a set defined by quadratic inequalities, given the first two moments of the distribution, can be efficiently computed using convex optimization. This result g...
Performance bounds for linear stochastic control
Stochastic control Model predictive control Linear matrix inequality Convex optimization
font style='font-size:12px;'>
2015/8/10
We develop computational bounds on performance for causal state feedback stochastic control with linear dynamics, arbitrary noise distribution, and arbitrary input constraint set. This can be very use...
Performance bounds and suboptimal policies for linear stochastic control via LMIs
dynamic programming stochastic control convex optimization
font style='font-size:12px;'>
2015/8/7
In a recent paper, the authors showed how to compute performance bounds for infinite horizon stochastic control problems with linear system dynamics and arbitrary constraints, objective, and noise dis...
Bounds on the speed of propagation of the KPP fronts in a cellular flow
propagation KPP fronts cellular flow
font style='font-size:12px;'>
2015/7/14
We consider a reaction-diffusion-advection equation with a nonlinearity of the KPP type in a cellular flow. We show that the minimal pulsating traveling front speed c∗(A) in a flow ofamplitude A...
Geometric Bounds for Eigenvalues of Markov Chains
Reversible markov chain geometry
font style='font-size:12px;'>
2015/7/14
We develop bounds for the second largest eigenvalue and spectral gap
of a reversible Markov chain. The bounds depend on geometric quantities
such as the maximum degree, diameter and covering numbe...
On the nonlocal Fisher-KPP equation:steady states,spreading speed and global bounds
nonlocal Fisher-KPP equation steady states spreading speed global bounds
font style='font-size:12px;'>
2015/7/14
We consider the Fisher-KPP equation with a non-local interaction term. We establish a condition on the interaction that allows for existence of non-constant periodic solutions,and prove uniform upper ...