Abstract
The topic of Partial Differential Equations (PDEs) is an interesting area where the techniques of discrete mathematics and numerical algorithms can be brought together to solve problems that would normally be considered more properly in the domain of continuous mathematics. We investigate the bit-complexity of discrete solutions to linear PDEs, which is a realistic measure for parallel computers such as the CONNECTION MACHINE (CM1) and MASPAR. We show that for a large class of linear PDEs satisfying some routine assumptions of the multigrid methods, the N point discretization of their solution can be compressed to only a constant number of bits per discretization point, without loss of information or introducing errors beyond the order of the discretization error. More specifically, we show that the bit-complexity of the compressed solution is O(N) for both storage space and the total number of operations. We also compute the compressed solution by a parallel algorithm using O(logN) time and N/logN bit-serial processors. The best previous bounds on the bit-complexity (for both sequential time and storage space) were at least NlogN; furthermore, the order of NlogN bit-serial processors were required to support the O(logN) parallel time in the known algorithms. We believe this is the first case where a linear or algebraic system can be provably compressed (i.e. the bit-complexity of storage of the compressed solution is less than the solution size) and also the first case where the use of data compression provably speeds up the time to solve the system (in the compressed form).
This work was supported by NSF Grant CCR-8805782 and by PSC-CUNY Awards #668541 and #669290
This work was supported by Air Force Contract AFOSR-87-0386, ONR Contract N00014-87-K-0310, DARPA/ISTO Contract N00014-88-K-0458, ONR Contract DAAL03-88-K-0195, and NASA/CESDIS Subcontract 550-63 NAS 5-30428 URSA.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
W.F. Ames, Numerical Methods for Partial Differential Equations, Academic Press, N.Y., 1977.
G.P. Astrakhantzev, An Iterative Method of Solving Elliptic Net Problem, Z. Vycisl. Mat.i Mat. Fiz., (in Russian), Vol. 11, pp. 439–448, 1971.
N.S. Bakhvalov, On the Convergence of a Relaxation Method under Natural Constraints on an Elliptic Operator, Z. Vycisl. Mat.i Mat. Fiz., (in Russian), Vol. 6, pp. 861–883, 1966.
R. Bank and Donald J. Rose, “Analysis of a Multilevel Iterative Method for Nonlinear Finite Element Equations”, Mathematics of Computation, Vol. 39, No 160, pp 453–465, 1982.
R. Bank and T. Dupont, “An optimal order process for solving finite element equations”, Mathematics of Computation., Vol. 36, pp. 35–51, 1981.
R. Bank and A. Sherman, “Algorithmic aspects of the Multi-level solution of finity element equations”, in Sparse Matrix Proceedings, 1978, I.S. Duff and G.W. Stewart, eds., Society for Industrial and Applied Mathematics, Philadelphia, PA, 1979.
A. Brandt, “Multi-Grid Solvers on Parallel Computers”, ICASE Technical Report 80-23, NASA Langley Research Center, Hampton, VA, 1980.
A. Brandt, “Multi-level adaptive technique (MLAT) for fast numerical solutions to boundary value problems”, Proc. 3rd Int. Conf. Numerical Methods in Fluid Mechanics, Paris, France, 1972; Lecture Notes in Physics, Vol. 18, pp. 82–89, Springer-Verlag, Berlin, W. Germany, 1984.
A. Brandt, “Multi-level adaptive solutions to boundary value problems”, Mathematics of Computation, Vol. 31, pp. 333–390, 1977.
A. Brandt, Multigrid Techniques: 1984 Guide, with Applications to Fluid Dynamics. Available as GMD Studien Nr. 85, GMD-AIW, Postfach 1240, D-5205, St. Augustin 1, W. Germany, 1984.
T.F. Chan, Y. Saad, and M.H. Schultz, “Solving elliptic partial differential equations on hypercubes”, Hypercube Multiprocessors 1986, SIAM, Philadelphia, PA, 1986.
R. Courant, K.O. Friedrichs, and H. Lewy, “Uber die partiellen Differenzengleich-ungen der mathematischen Physik”, Math. Ann., Vol. 100, pp. 32–74, 1928.
R.P. Fedorenko, The Speed of Convergence of One Iteration Process, Z. Vycisl. Mat. i Mat. Fiz. (in Russian), Vol. 4, pp. 559–663, 1964.
G.E. Forsythe, W.R. Wasow, Finite Difference Methods for Partial Differential Equations, John Wiley & Sons, Inc., New York, 1960.
P.O. Frederickson and O.A. McBryan, “Parallel Superconvergent Multigrid”, Multigrid Methods: Theory, Applications and Supercomputing (Editor S. McCormick), Lecture Notes in Pure and Applied Math. vol. 100, pp. 195–210, M. Dekker, N.Y., 1988.
P.O. Frederickson and O.A. McBryan, “Superconvergent Multigrid Methods”, Cornell Theory Center, Preprint, May 1987.
W. Hackbusch, “Convergence of multi-grid iterations applied to difference equations”, Mathematics of Computation, Vol. 34, pp. 425–440, 1980.
W. Hackbusch, Multigrid Methods and Applications, Springer-Verlag, 1985.
W. Hackbusch, On the convergence of multi-grid iteration applied to finite element equations, Report 77-8, Universität zu Köln, July, 1977.
W. Hackbusch and U. Trottenberg, eds., Multigrid Methods, Lecture Notes in Math., Vol. 960, Springer-Verlag, 1982.
L. Lapidus and G.F. Pinder, Numerical Solution of Partial Differential Equations in Science and Engineering, Wiley, 1982.
O.A. McBryan and and E. Van de Velde, “Parallel Algorithms for Elliptic Equations”, Commun. Pure and Appl. Math., Vol. 38, pp. 769–795, 1985.
O.A. McBryan and E. Van de Velde, “The Multigrid Method on Parallel Processors”, in Multigrid Methods II, ed. W. Hackbusch and U. Trottenberg, Lecture Notes in Mathematics, Vol. 1228, Springer-Verlag, Berlin, 1986.
S. McCormick, editor, Multigrid Methods, Volume 3 of SIAM Frontiers Series, SIAM, Philadelphia, 1987.
S. McCormick, (ed.), Proceeding of the 2nd Copper Mountain Multigrid Conference, Appl. Math. Comp., Vol. 19, pp. 1–372 (special issue), 1986.
S. McCormick and U. Trottenberg (eds.), Multigrid Methods, Appl. Math. Comp., Vol. 13, pp. 213–474 (special issue), 1983.
J.R. Rice, Numerical Methods, Software and Analysis, Mc-Graw-Hill, New York, 1983.
G. Strang and G. Fix, An Analysis of the Finite Element Method, Prentice-Hall, Englewood Cliffs, NJ, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pan, V., Reif, J. (1990). On the bit-complexity of discrete solutions of PDEs: Compact multigrid. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032062
Download citation
DOI: https://doi.org/10.1007/BFb0032062
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52826-5
Online ISBN: 978-3-540-47159-2
eBook Packages: Springer Book Archive