Sciweavers

188 search results - page 7 / 38
» Solving Rational Eigenvalue Problems via Linearization
Sort
View
MOC
2010
13 years 4 months ago
Sharpness in rates of convergence for the symmetric Lanczos method
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
Ren-Cang Li
CDC
2010
IEEE
228views Control Systems» more  CDC 2010»
13 years 4 months ago
Fundamental performance limitations with Kullback-Leibler control cost
This research concerns fundamental performance limitations in control of discrete time nonlinear systems. The fundamental limitations are expressed in terms of the average cost of ...
Sun Yu, Prashant G. Mehta
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
13 years 10 months ago
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 4 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
13 years 11 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin