#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1951

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Frank Deutsch, Hein Hundal
- Journal of Approximation Theory
- 2006

- Hein Hundal, Frank Deutsch
- Math. Program.
- 1997

- Frank Deutsch, Hein Hundal
- Journal of Approximation Theory
- 2006

- Frank Deutsch, Wu Li, Joseph D. Ward
- SIAM Journal on Optimization
- 1999

- Frank Deutsch, Hein Hundal
- Journal of Approximation Theory
- 2008

- Heinz H. Bauschke, Frank Deutsch, Hein Hundal
- ITOR
- 2009

Bauschke, Borwein, and Lewis have stated a trichotomy theorem [4, Theorem 5.7.16] that characterizes when the convergence of the method of alternating projections can be arbitrarily slow. However, there are two errors in their proof of this theorem. In this note, we show that although one of the errors is critical, the theorem itself is correct. We give a… (More)

- F DEUTSCH
- The Psychoanalytic quarterly
- 1952

- F DEUTSCH
- The Psychoanalytic quarterly
- 1957

An elementary proof of the Stone-Weierstrass theorem is given. In this note we give an elementary proof of the Stone-Weierstrass theorem. The proof depends only on the definitions of compactness ("each open cover has a finite subcover") and continuity ("the inVerse images of open sets are open"), two simple consequences of these definitions (i.e. "a closed… (More)

- Frank Deutsch
- 2012

Many algorithms in analysis, numerical analysis , and approximation theory are of the following general form. A sequence of bounded linear operators (L n) on a Banach space X converges pointwise to a bounded linear operator L: L n (x) − L(x) → 0 for each x ∈ X. Examples: (1) Bernstein polynomial operators (B n) on C[0, 1] converge pointwise to the identity… (More)