2001 Industrial Mathematics Institute Research Reports

• 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 
  

01:01  S.C. Brenner and Q. He

Lower bounds for three-dimensional nonoverlapping domain decomposition algorithms

(Numerische Mathematik 93 (2003), 445-470)

01:02  M. Nielsen and D.-X. Zhou

Mean size of wavelet packets

01:03  S.C. Brenner

A new look at FETI

(Proceedings of the Thirteenth International Conference on Domain Decomposition Methods, N. Debit, M. Garbey, R. Hoppe, J. Périaux, D. Keyes and Y. Kuznetsov, ed., DDM.org, 2001, pp. 41-51)

01:04  S.J. Dilworth, R. Howard and J.W. Roberts

A general theory of almost convex functions

01:05  M. Skopina

Polynomial expansions of continuous functions on the sphere and on the disk

01:06  M. Filaseta and D.B. Meade

Irreducible testing of lacunary 0,1-polynomials (pdf file)

01:07  V.N. Temlyakov

Two lower estimates in greedy approximation

01:08  O. Trifonov

Lattice points close to a smooth curve and squarefull numbers in short intervals

01:09  V.N. Temlyakov

Nonlinear methods of approximation

01:10  M.A. Steel and L.A. Székely

Inverting random functions II: explicit bounds for parametric and non-parametric MLE, with applications

01:11  H. Wang and M. Al-Lawatia

An Eulerian-Lagrangian substruturing domain decomposition method for unsteady-state advection-diffusion equations

01:12  P. Petrushev

Multivariate n-term rational and piecewise polynomail approximation

01:13  B. Karaivanov and P. Petrushev

Nonlinear piecewise polynomial approximation beyond Besov spaces

01:14  S.J. Dilworth, D. Kutzarova and V.N. Temlyakov

Convergence of some greedy algorithms in Banach spaces

01:15  S.C. Brenner

Convergence of nonconforming V-cycle and F-cycle multigrid algorithms for second order elliptic boundary value problems

(Mathematcis of Computation 73 (2004), 1041-1066, electronically posted August 19, 2003, PII: S0025-5718(03)01578-3)

01:16  R. Anstee, R. Ferguson and J. Griggs

Permutations with low discrepancy consecutive k-sums

01:17  E. Matouskova

Almost isometries of balls

01:18  M. Fischermann, A. Hoffmann, D. Rautenbach, L. Székely and L. Volkmann

Wiener index versus maximum degree in trees

01:19  H. Wang and J. Liu

Development of CFL-free, explicit schemes for multidimensional advection-reaction equations

01:20  H. Wang

An optimal-order error estimate for MMOC and MMOCAA schemes for multidimensional advection-reaction equations

01:21  S.C. Brenner

Smoothers, mesh dependent norms, interpolation and multigrid

(Appl. Numer. Math. 43 (2002), 45-56.)

01:22  J.R. Griggs

Intersecting families with minimum volume

01:23  S.J. Dilworth, N.J. Kalton, D. Kutzarova and V.N. Temlyakov

The thresholding greedy algorithm, greedy bases and duality

01:24  R. DeVore and I. Daubechies

Reconstructing a bandlimited function from very coarsely quantized data: A family of stable sigma-delta modulators of arbitrary order

01:25  I. Daubechies, R. DeVore, C.S. Güntürk and V. Vaishampayan

Exponential precision in A/D conversion with an imperfect quantizer

01:26 : R. DeVore, G. Petrova and V. Temlyakov

Best basis selection for approximation in L_p

[ IMI Research Reports | IMI Home Page]

---

Last modified April 26, 2004 by Susanne C. Brenner

Send comments to imip@math.sc.edu