Arthur G. Werschulz  Home/Search
Context Related
| columbia.edu/report...cucs02697.ps.gz columbia.edu/~libra...cucs02697.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: columbia.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We are concerned with the complexity of 2mth order elliptic two-point boundary-value problems Lu = f . Previous work on the complexity of these problems has generally assumed that we had partial information about the right-hand side f and complete information about the coefficients of L, often making unrealistic assumptions about the smoothness of the coefficients of L. In this paper, we study problems in which f has r derivatives in the Lp -sense and for L having the usual divergence form ... (Update)
Context of citations to this paper: More
...assumptions There are two issues to deal with. First, we want to know where smoothness counts the most for Fredholm problems, as we did in [16] for two point boundary value problems. That is, we would like to know which is more important the smoothness of the kernel or of...
Cited by: More
Where Does Smoothness Count the Most for Fredholm Equations of.. - Werschulz (2002) (Correct)
Active bibliography (related documents): More All
0.2: The Complexity of Definite Elliptic Problems With Noisy Data - Arthur Werschulz (1996) (Correct)
0.1: The Complexity of Indefinite Elliptic Problems With Noisy Data - Arthur Werschulz (1997) (Correct)
0.1: What is the complexity of Stieltjes integration? - Werschulz (1998) (Correct)
Similar documents based on text: More All
0.2: An Overview of Information-Based Complexity - Werschulz (2002) (Correct)
0.1: What is the Complexity of Solution-Restricted Operator Equations? - Werschulz (1995) (Correct)
0.1: What is the Complexity of Surface Integration? - Werschulz, Wozniakowski (2001) (Correct)
BibTeX entry: (Update)
A. G. Werschulz. Where does smoothness count the most for two-point boundary-value problems? J. Complexity, 15:360--384, 1999. 43 http://citeseer.ist.psu.edu/werschulz97where.html More
@article{ werschulz99where,
author = "Werschulz",
title = "Where Does Smoothness Count the Most for Two-Point Boundary-Value Problems?",
journal = "COMPLEXITY: Journal of Complexity",
volume = "15",
year = "1999",
url = "citeseer.ist.psu.edu/werschulz97where.html" }
Citations (may not include all citations):134 Information-Based Complexity (context) - Traub, Wasilkowski et al. - 1988
50 to appear - of, problems et al. - 1996
35 Survey lectures on the mathematical foundations of the finit.. (context) - Babuska, Aziz - 1972
27 Partial Differential Equations (context) - Friedman - 1976
20 The Computational Complexity of Differential and Integral Eq.. (context) - Werschulz - 1991
14 Finite Elements: Mathematical Aspects (context) - Oden, Carey - 1983
10 Numerical Methods (context) - Bakhvalov - 1977
8 Grundlehren der mathematischen Wissenschaften (context) - Lorentz, von Golitschek et al. - 1996
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.columbia.edu.html): More
Interfacing Oz with the PCTE OMS - Lee, Kaiser (1996) (Correct)
An Architecture for WWW-based Hypercode Environments - Kaiser, Dossick, Jiang, Yang (1996) (Correct)
Incremental Process Support for Code Reengineering: An .. - Kaiser, Heineman.. (1996) (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