A longstanding problem related to floating-point implementation of numerical programs is to provide efficient yet precise analysis of output errors. We present a framework to compute lower bounds of absolute roundoff errors for numerical programs implementing polynomial functions with box constrained input variables. Our study relies on semidefinite programming (SDP) relaxations and is compleme...

Naively, one would expect longer papers to have larger impact (i.e., to be cited more). I tested this expectation by selecting all (∼ 30, 000) refereed papers from A&A, AJ, ApJ and MNRAS published between 2000 and 2004. These particular years were chosen so papers analyzed would not be too “fresh”, but at the same time length of each article could be obtained via ADS. I find that indeed longer ...