Result 1 to 16 of 16 total
Principles of verified numerical integration. (English)
J. Comput. Appl. Math. 199, No. 2, 317-328 (2007).
1
Special issue: Invited papers based on the presentations at the seminar ‘Algorithms and complexity for continuous problems’, Schloss Dagstuhl, Germany, September 2004. (English)
J. Complexity 22, No. 1, 3-145 (2006).
2
On the complexity of parabolic initial-value problems with variable drift. (English)
J. Complexity 22, No. 1, 118-145 (2006).
3
Algorithms and complexity for continuous problems, 26. September - 1. October 2004 (English)
Dagstuhl Seminar Proceedings: Algorithms and Complexity for Continuous Problems 04401 (2005).
4
Multiple precision interval packages: comparing different approaches. (English)
Alt, René (ed.) et al., Numerical software with result verification. International Dagstuhl seminar, Dagstuhl Castle, Germany, January 19‒24, 2003. Revised papers. Berlin: Springer (ISBN 3-540-21260-4/pbk). Lecture Notes in Computer Science 2991, 64-90 (2004).
5
Numerical computation of an integral representation for arithmetic-average Asian options. (English)
Computing 73, No. 1, 25-39 (2004).
6
On the complexity of parabolic initial value problems with variable drift (English)
Algorithms and Complexity for Continuous Problems (2004).
7
04401 abstracts collection - algorithms and complexity for continuous (English)
Algorithms and Complexity for Continuous Problems (2004).
8
04401 summary - algorithms and complexity for continuous problems (English)
Algorithms and Complexity for Continuous Problems (2004).
9
Selected papers from the seminar on numerical integration and its complexity, Oberwolfach, Germany, November 18‒24, 2001. (English)
J. Complexity 19, No. 3, 211-453 (2003).
10
Multiple precision interval packages: comparing different approaches (English)
Numerical Software with Result Verification, 64-90 (2003).
11
Self-validating integration and approximation of piecewise analytic functions. (English)
J. Comput. Appl. Math. 145, No.2, 345-359 (2002).
12
Fast calculation of coefficients in the Smolyak algorithm. (English)
Numer. Algorithms 26, No.2, 93-109 (2001).
13
On the complexity of self-validating numerical integration and approximation of functions with singularities. (English)
J. Complexity 14, No.3, 302-318 (1998).
14
Quadrature formulas for multivariate convex functions. (English)
J. Complexity 12, No.1, 5-16 (1996).
15
Optimal stochastic quadrature formulas for convex functions. (English)
BIT 34, No.2, 288-294 (1994).
16
Result 1 to 16 of 16 total
Start
Contact
Print
General Help
