(Enter summary)
Abstract: We study the complexity of approximating the Stieltjes integral
R
1
0
f(x) dg(x) for functions f having r continuous derivatives and functions
g whose sth derivative has bounded variation. Let r(n) denote
the nth minimal error attainable by approximations using at most n
evaluations of f and g, and let comp(") denote the "-complexity (the
minimal cost of computing an "-approximation). We show that r(n) i
n
\Gamma minfr;s+1g
and that comp(") i "
\Gamma1= minfr;s+1g
. We also present
... (Update)
Similar documents (at the sentence level):
50.0%: What is the Complexity of Stieltjes Integration? - Werschulz (1999)
(Correct)
Active bibliography (related documents): More All
0.1: Where Does Smoothness Count the Most for Two-Point.. - Werschulz (1997)
(Correct)
0.1: What is the Complexity of Surface Integration? - Werschulz, Wozniakowski (2001)
(Correct)
0.1: On the Average Case Complexity of Solving Poisson Equations - Ritter, Wasilkowski (1996)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Surface Approximation is Sometimes Easier Than Surface.. - Arthur Werschulz.. (2001)
(Correct)
0.3: An Overview of Information-Based Complexity - Werschulz (2002)
(Correct)
0.1: The impact of Stieltjes' work on continued fractions and.. - Valent, VAN ASSCHE (1995)
(Correct)
BibTeX entry: (Update)
@article{ werschulz00what,
author = "Werschulz",
title = "What Is the Complexity of Stieltjes Integration?",
journal = "COMPLEXITY: Journal of Complexity",
volume = "16",
year = "2000",
url = "citeseer.ist.psu.edu/article/werschulz98what.html" }
Citations (may not include all citations):
234
Continuous Martingales and Brownian Motion (context) - Revuz, Yor - 1994
134
Information-Based Complexity (context) - Traub, Wasilkowski et al. - 1988 ACM
127
Constructive Approximation (context) - DeVore, Lorentz - 1993
78
Dynamic Asset Pricing Theory (context) - Duffie - 1996
74
Functional Analysis (context) - Riesz, Sz-Nagy - 1955 ACM
27
Complexity and Information (context) - Traub, Werschulz - 1998 ACM
20
The Computational Complexity of Differential and Integral Eq.. (context) - Werschulz - 1991
16
On approximate calculation of integrals (context) - Bakhvalov - 1959
10
Numerical Methods (context) - Bakhvalov - 1977 ACM
2
An Introduction to the Theory of Finite Elements (context) - Oden, Reddy - 1976
2
Hydrogen sulfide photoabsorption and photoionization cross s.. (context) - Cacelli, Carrravetta et al. - 1988
2
Applications of almost-everywhere singular distributions in .. (context) - Giona, Patierno - 1997
2
Direct analysis method for probabilistic fracture mechanics (context) - Akiba, Yoshimura et al. - 1996
2
Complexity of multilinear problems in the worst case setting (context) - Jackowski - 1990 ACM
2
Stieltjes integral representation of effective diffusivities.. (context) - Avellaneda, Vergassola - 1995
2
Stieltjes integration and differential geometry: a model for.. (context) - Louie, Somorjai - 1984
Documents on the same site (http://www.cs.columbia.edu/~library/1998.html): More
Optimizing Selections over Data Cubes - Ross, Zaman (1998)
(Correct)
Usenetfs: A Stackable File System for Large Article Directories - Erez Zadok (1998)
(Correct)
Synthesis for Logical Initializability of Synchronous Finite.. - Singh, Nowick (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC