1999 Industrial Mathematics Institute Research Reports

You can acquire a hard-copy of a report by downloading the postscript file (if available) or by sending your request via one of the following options. (Be sure to include your complete mailing address and the report number(s).)
99:01  R. Getsadze
On Lebesgue functions of uniformly bounded orthonormal systems

99:02  M.A. Steel and L.A. Székely
Inverting random functions

99:03  V.N. Temlyakov
Weak greedy algorithms

99:04  A. Cohen, R. DeVore, G. Kerkyacharian and D. Picard
Maximal spaces with given rate of convergence for thresholding algorithms

99:05  E. Czabarka, G. Konjevod, M.V. Marathe, A.G. Percus and D.C. Torney
Algorithms for optimizing production DNA sequencing

99:06  G. Kyriazis and P. Petrushev
New bases for Triebel-Lizorkin and Besov spaces

99:07  S.C. Brenner
Convergence of the multigrid V-cycle algorithm for second order boundary value problems without full elliptic regularity
(Math. Comp. 71 (2002), 507-525)

99:08  V.N. Temlyakov
Universal bases and greedy algorithms

99:09  A. Cohen, W. Dahmen, I. Daubechies and R. DeVore
Tree Approximation and Optimal Encoding

99:10  R. DeVore and G. Petrova
The Averaging Lemma

99:11  A.S. Fokas and L.-Y. Sung
Initial-boundary value problems for linear dispersive evolution equations on the half-line

99:12  S.J. Dilworth, R. Howard and J.W. Roberts
On the size of approximately convex sets in normed spaces

99:13  R. Howard, G. Károlyi and L.A. Székely
Towards a Katona type proof for the 2-intersecting Erdös-Ko-Rado theorem

99:14  V.I. Buslaev
Remarks on Poincare and Van Vleck Theorems
[ IMI Research Reports | IMI Home Page]

Last modified January 11, 2003 by Susanne Brenner

Send comments to imip@math.sc.edu