Author: Werschulz, Arthur G. / Series: Columbia University Computer Science Technical Reports | Search Results | Academic Commons

You searched for: Author Werschulz, Arthur G. Series Columbia University Computer Science Technical Reports Start Over

1. Does Increased Regularity Lower Complexity?

: Werschulz, Arthur G.
: 1982
: Reports
: Computer science

2. Measuring Uncertainty Without a Norm

: Werschulz, Arthur G.
: 1982
: Reports
: Computer science

3. Complexity of Indefinite Elliptic Problems

: Werschulz, Arthur G.
: 1983
: Reports
: Computer scienceMathematics

4. Counterexamples in Optimal Quadrature

: Werschulz, Arthur G.
: 1983
: Reports
: Computer scienceMathematics

5. Is Gauss quadrature optimal for analytic functions?

: Kowalski, M. A.; Werschulz, Arthur G.; Wozniakowski, Henryk
: 1983
: Reports
: Computer scienceMathematics

6. What Is the Complexity of Related Elliptic, Parabolic, and Hyperbolic Problems?

: Werschulz, Arthur G.
: 1983
: Reports
: Computer scienceMathematics

7. Finite Element Methods Are Not Always Optimal

: Werschulz, Arthur G.
: 1984
: Reports
: Computer science

8. What Is the Complexity of Elliptic Systems?

: Werschulz, Arthur G.
: 1984
: Reports
: Computer science

9. What is the Complexity of the Fredholm Problem of the Second Kind?

: Werschulz, Arthur G.
: 1984
: Reports
: Computer science

10. Complexity or Differential and Integral Equations

: Werschulz, Arthur G.
: 1985
: Reports
: Computer scienceMathematics