Sciweavers

32 search results - page 1 / 7
» Minimizing the sum of many rational functions
Sort
View
CORR
2011
Springer
133views Education» more  CORR 2011»
12 years 8 months ago
Minimizing the sum of many rational functions
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree ...
Florian Bugarin, Didier Henrion, Jean B. Lasserre
JGO
2008
83views more  JGO 2008»
13 years 4 months ago
Global minimization of rational functions and the nearest GCDs
This paper discusses the global minimization of rational functions with or without constraints. We studied the sum of squares (SOS) relaxations and their properties to solve this ...
Jiawang Nie, James Demmel, Ming Gu
SIAMNUM
2010
131views more  SIAMNUM 2010»
12 years 11 months ago
A Rational Interpolation Scheme with Superpolynomial Rate of Convergence
The purpose of this study is to construct a high-order interpolation scheme for arbitrary scattered datasets. The resulting function approximation is an interpolation function when...
Qiqi Wang, Parviz Moin, Gianluca Iaccarino
TCS
2008
13 years 4 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
DM
2008
101views more  DM 2008»
13 years 4 months ago
Congruences involving Bernoulli polynomials
Let {Bn(x)} be the Bernoulli polynomials. In the paper we establish some congruences for Bj(x) (mod pn), where p is an odd prime and x is a rational p-integer. Such congruences are...
Zhi-Hong Sun