Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/800191.805573acmconferencesArticle/Chapter ViewAbstractPublication Pagesacm-national-conferenceConference Proceedingsconference-collections
Article
Free access

A review of current studies on complexity of algorithms for partial differential equations

Published: 20 October 1976 Publication History

Abstract

We review current work in analytic computational complexity of sequential algorithms for partial differential equations. Included are studies which analyze and compare classes of algorithms for hyperbolic, elliptic and parabolic problems. Emphasis is on the criteria and techniques used to perform the analysis and comparisons.

References

[1]
W. E. Culham and R. S. Varga, Numerical methods for time-dependent, nonlinear boundary value problems, Soc. Petroleum Engineers J., 11 (1971), 374-388.
[2]
R. Vichnevetsky and F. De Schutter, Frequency analysis of finite element and finite difference methods for initial value problems, in Advances in computer methods for partial differential equations, R. Vichnevetsky, ed., AICA, N.J., 1975.
[3]
J. F. Traub, Theory of optimal algorithms, Technical report, Carnegie-Mellon University, Pa., 1973.
[4]
H. O. Kreiss and J. Oliger, Comparison of accurate methods for the integration of hyperbolic equations, Tellus 24 (1972), 199-215.
[5]
Blair Swartz and Burton Wendroff, The relative efficiency of finite difference and finite element methods, I: Hyperbolic problems and splines, SIAM J. Numer. Anal. II, 5(1974), 979-993.
[6]
B. Swartz, Comparing certain classes of difference and finite element methods for a hyperbolic problem, in Advances in computer methods for partial differential equations, R. Vichnevetsky, ed., AICA, N.J., 1975.
[7]
B. Swartz, The construction and comparison of finite difference analogs of some finite element schemes, in Mathematical aspects of finite elements in partial differential equations, C. de Boor, ed., Academic Press, N.Y., 1974.
[8]
J. Gary, Comparison of some fourth order difference schemes for hyperbolic problems, in Advances in computer methods for partial differential equations, R. Vichnevetsky, ed. AICA, N.J., 1975.
[9]
G. Birkhoff and V. A. Dougalis, Numerical solution of hydrodynamic problems, in Advances in computer methods for partial differential equations, R. Vichnevetsky, ed. AICA, N.J., 1975.
[10]
A. J. Hoffman, M. S. Martin, and D. J. Rose, Complexity bounds for regular finite difference and finite element grids, SIAM J. Numer. Anal. 10, 2(1973), 364-369.
[11]
F. W. Dorr, The direct solution of the discrete poisson equation on a rectangle, SIAM Rev. 12(1970), 248-263.
[12]
Randolph E. Bank and Donald J. Rose, An O(N2) method for solving constant coefficient boundary value problems in two dimensions, SIAM J. Numer. Anal. 12, 4(1975), 527-539.
[13]
F. W. Dorr, The direct solution of the discrete poisson equation in O(N2) operations, SIAM Rev. 17, 3(1975), 412-415.
[14]
S. C. Eisenstat, M. H. Schultz and A. H. Sherman, Application of sparse matrix methods to partial differential equations, in Advances in computer methods for partial differential equations, R. Vichnevetsky, ed., AICA, N.J., 1975.
[15]
David M. Young, On the solution of large systems of linear algebraic equations with sparse, positive definite matrices, Report CNA 55, Center for Numerical Analysis, The University of Texas at Austin, 1972.
[16]
Richard Bartels and James W. Daniel, A conjugate gradient approach to nonlinear elliptic boundary value problems in irregular regions, Report CNA 63, Center for Numerical Analysis, The University of Texas at Austin, 1973.
[17]
H. Wozniakowski, Numerical stability of iterations for solution of nonlinear equations and large linear systems, invited paper presented at the Symposium On Analytic Computational Complexity, Carnegie-Mellon University, Pa., 1975.
[18]
E. N. Houstis, R. E. Lynch, T. S. Papatheodorou and J. R. Rice, Development, evaluation and selection of methods for elliptic partial differential equations, in Advances in computer methods for partial differential equations, R. Vichnevetsky, ed., AICA, N.J., 1975.
[19]
John R. Rice, The algorithm selection problem, Report CSD-TR 152, Computer Science Dept., Purdue University, 1975.
[20]
Milos Zlamal, Finite element methods for parabolic equations, Math. of Comp. 28, 126(1974), 393-404.
[21]
J. Thomas King, Semidiscrete perturbed variational methods for the numerical solution of parabolic boundary value problems, SIAM J. Numer. Anal. 12, 1(1975).
[22]
H. M. Khalil and J. H. Giese, A two-parameter family of two-level higher order difference methods for the two-dimensional heat equation, JIMA 16(1975), 193-205.
[23]
Hatem M. Khalil and Dana L. Ulery, Multiparameter families of difference approximations to the heat operator in an arbitrary region, in Advances in computer methods for partial differential equations, R. Vichnevetsky, ed., AICA, N.J., 1975.
[24]
Hatem M. Khalil and John H. Giese, A unified account of two-level ten-point difference methods for the two dimensional heat operator, in preparation.
[25]
P. M. Dew and R. E. Scraton, JIMA 11 (1973), 231-240.
[26]
P. M. Dew and R. E. Scraton, Chebyshev methods for the numerical solution of parabolic partial differential equations in two and three space variables, JIMA 16(1975), 121-131.
[27]
G. Dubois, The application of the TCNR-methods to multi-region nuclear reactor parabolic problems, in Advances in computer methods for partial differential equations, R. Vichnevetsky, ed., AICA, N.J., 1975.
[28]
Harvey S. Price, Application of finite element methods to solving immiscible displacement problems with sharp fronts, Proc. of the SIGNUM meeting on software for partial differential equations, 1975.
[29]
Hans G. Kaper, Gary K. Leaf, and Arthur J. Lindeman, A timing comparison study for some high order finite element approximation procedures and a low order finite difference approximation procedure for the numerical solution of the multigroup neutron diffusion equation, Nuclear Sc. & Eng. 49(1972).
[30]
J. Douglas, A survey of methods for parabolic differential equations, in Advances in computers 2, Academic Press, N.Y., 1961.
[31]
A. Brandt, Generalized local maximum principles for finite-difference operators, Math. of Comp. 27, 124 (1973), 685-718.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ACM '76: Proceedings of the 1976 annual conference
October 1976
576 pages
ISBN:9781450374897
DOI:10.1145/800191
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 October 1976

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 387
    Total Downloads
  • Downloads (Last 12 months)36
  • Downloads (Last 6 weeks)13
Reflects downloads up to 25 Nov 2024

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media