1998 Industrial Mathematics Initiative 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).)

Request through email
Request by FAX: (803) 777-6527

Request by regular mail:

Ms. Janice Long 
Attn:  IMI Reports 
Department of Mathematics 
University of South Carolina 
Columbia, SC 29208

98:01 S.C. Brenner: Lower bounds for two-level additive Schwarz preconditioners with small overlap; (SIAM J. Sci. Comp. 21 (2000), 1657-1669.)
98:02 R. DeVore: Nonlinear approximation
98:03 K.I. Oskolkov: Ridge approximation and Kolmogorov-Nikol'skii problem
98:04 S.C. Brenner and L.-Y. Sung: Lower bounds for nonoverlapping domain decomposition preconditioners in two dimensions; (Math. Comp. 69 (2000), 1319-1339)
98:05 S.C. Brenner and L.-Y. Sung: Lower bounds for two-level additive Schwarz preconditioners for nonconforming finite elements; (Advances in Computational Mathematics (Proceedings of the Guangzhou International Symposium 1997); Lecture Notes in Pure and Appl. Math. 202, pp. 585-604, Dekker, New York, 1999)
98:06 K.I. Oskolkov: Non-linearity versus linearity in ridge approximation
98:07 S.C. Brenner: A nonstandard finite element interpolation estimate; (Numer. Funct. Anal. Optim. 20 (1999), 245-250)
98:08 F. Chudak and J. Griggs: A new extension of Lubell's inequality to the lattice of divisors
98:09 J.R. Griggs and K.B. Reid: Landau's theorem revisited
98:10 J.R. Griggs and G. Rote: On the distribution of sums of vectors in general position
98:11 J.R. Griggs and C.-C. Ho: On the half-half case of the Zarankiewicz problem
98:12 J.R. Griggs and C.-C. Ho: The cycling of partitions and compositions under repeated shifts
98:13 J.R. Griggs, M. Simonovits, G.R. Thomas: Extremal graphs with bounded densities of small subgraphs
98:14 J.R. Griggs: Database security and the distribution of subset sums in R^m
98:15 A. Cohen, W. Dahmen and R. DeVore: Adaptive wavelet methods for elliptic operator equations - convergence rates
98:16 P.L. Erdös, M.A. Steel, L.A. Székely and T.J. Warnow: A few logs suffice to build (almost) all trees (I)
98:17 P.L. Erdös, M.A. Steel, L.A. Székely and T.J. Warnow: A few logs suffice to build (almost) all trees (II)
98:18 F. Shahrokhi and L.A. Székely: Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem
98:19 F. Shahrokhi, O. Sýkora, L.A. Székely and I. Vrt'o: On bipartite drawings and the linear arrangement problem
98:20 F. Shahrokhi, O. Sýkora, L.A. Székely and I. Vrt'o: A new lower bound for the bipartite crossing number with applications
98:21 P.L. Erdös, K. Rice, M.A. Steel, L.A. Székely and T.J. Warnow: The short quartet method
98:22 V.N. Temlyakov: On two problems in the multivariate approximation
98:23 V.N. Temlyakov: Greedy algorithms with regard to multivariate systems with special structure
98:24 R. Getsadze: On Riemann-Lebesgue theorem for the systems of Chebyshev ridge polynomials
98:25 P. Petrushev: Bases consisting of rational functions of uniformly bounded degrees or more general functions

[ IMI Research Reports | IMI Home Page]

Last modified November 20, 2000 by Susanne Brenner

Send comments to imip@math.sc.edu