Sciweavers

1469 search results - page 26 / 294
» Approximate polynomial decomposition
Sort
View
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
14 years 11 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...
AUTOMATICA
2011
14 years 1 months ago
A hierarchy of LMI inner approximations of the set of stable polynomials
Exploiting spectral properties of symmetric banded Toeplitz matrices, we describe simple sufficient conditions for positivity of a trigonometric polynomial formulated as linear ma...
Mustapha Ait Rami, Didier Henrion
SIAMSC
2011
177views more  SIAMSC 2011»
14 years 4 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad
WSCG
2003
136views more  WSCG 2003»
14 years 11 months ago
Piecewise Circular Approximation of Spirals and Polar Polynomials
Spirals are surprisingly common in science, nature, physics, astronomy, flora and fauna, and the arts. In Cartesian coordinates they are typically transcendental functions, which ...
Francesca Taponecco, Marc Alexa
ECCC
2006
71views more  ECCC 2006»
14 years 9 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...