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

@inproceedings{Khalil1976ARO,
title={A review of current studies on complexity of algorithms for partial differential equations},
author={Hatem M. Khalil and Dana L. Ulery},
booktitle={ACM '76},
year={1976}
}
• Published in ACM '76 20 October 1976
• Mathematics
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.
2 Citations
Regularization, Recognition and Complexity Estimation Methods of Automata Models of Discrete Dynamical Systems in Control Problem
Results of development of regularization methods for partially set automata models of systems based on use of geometrical images of automatons mappings and numerical interpolation methods are presented.
COMPLEXITY ESTIMATION OF DISCRETE AUTOMATONS
The method of extraction from a geometrical image of laws of functioning of the automaton of sequence of the second coordinates of points, accurate within number of the input signals, offered and developed by V.A.Tverdokhlebov, allows to reduce research of lawsof functioning of automatons to research of properties of numerical sequences.

## References

SHOWING 1-10 OF 48 REFERENCES
Theory of optimal algorithms
Motivations for studying computational complexity are discus* recent results in algebraic and analytic computational complexity This report is based on an invited paper presented at a Conference for
Comparison of accurate methods for the integration of hyperbolic equations
• Environmental Science
• 1972
Historically, second order accurate difference methods have been used for computations in dynamic meteorology and oceanography. We investigate more accurate difference methods and show that fourth
The Direct Solution of the Discrete Poisson Equation in $O(N^2 )$ Operations
An algorithm is described which solves the discrete Poisson equation on a rectangle with a regular $N \times N$ mesh in $O(N^2 )$ arithmetic operations. However, the method is very highly unstable,
Complexity Bounds for Regular Finite Difference and Finite Element Grids
• Mathematics, Computer Science
• 1973
Sharp lower bounds are obtained for multiplications and storage in the sparse system arising from the application of finite difference or finite element techniques to linear boundary value problems
A conjugate gradient approach to nonlinear elliptic boundary value problems in irregular regions
• Mathematics, Computer Science
• 1974
A version of the conjugate gradient method is proposed for solving discrete approximations to nonlinear elliptic boundary value problems over irregular regions, with the Poisson equations being solved by the Buneman algorithm after some preprocessing.
The Relative Efficiency of Finite Difference and Finite Element Methods. I: Hyperbolic Problems and Splines
• Mathematics
• 1974
The finite element method, using smooth splines as basis functions, applied to the model problem $u_t = cu_x$ with periodic data generates a differential-difference equation whose phase error is