Sciweavers

8824 search results - page 72 / 1765
» On the Complexity of Real Functions
Sort
View
TCS
2008
14 years 11 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
ISSAC
2007
Springer
149views Mathematics» more  ISSAC 2007»
15 years 6 months ago
Computing numerically with functions instead of numbers
Symbolic computation with functions of a real variable suffers from combinatorial explosion of memory and computation time. The alternative chebfun system for such computations is...
Lloyd N. Trefethen
SIAMCO
2000
67views more  SIAMCO 2000»
14 years 11 months ago
On the Duality between Filtering and Nevanlinna--Pick Interpolation
Positive real rational functions play a central role in both deterministic and stochastic linear systems theory, as well as in circuit synthesis, spectral analysis, and speech proc...
Christopher I. Byrnes, Anders Lindquist
DAGSTUHL
2008
15 years 1 months ago
A Modified Staggered Correction Arithmetic with Enhanced Accuracy and Very Wide Exponent Range
Abstract. A so called staggered precision arithmetic is a special kind of a multiple precision arithmetic based on the underlying floating point data format (typically IEEE double ...
Frithjof Blomquist, Werner Hofschuster, Walter Kr&...
HCI
2007
15 years 1 months ago
Measuring the Screen Complexity of Web Pages
An increasing, degree of rich and dynamic content and abundant links are making Web pages visually cluttered. This paper presents a numerical tool to evaluate the screen complexity...
Fong-Ling Fu, Shao-Yuan Chiu, Chiu Hung Su