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}
}
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. 
View on ACM
doi.org
2 Citations
Background Citations
1

2 Citations

Regularization, Recognition and Complexity Estimation Methods of Automata Models of Discrete Dynamical Systems in Control Problem
TLDR
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
TLDR
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
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
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…
Comparing certain classes of difference and finite element methods for a hyperbolic problem
A conjugate gradient approach to nonlinear elliptic boundary value problems in irregular regions
TLDR
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
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…
Development, evaluation and selection of methods for elliptic partial differential equations
Comparison of some fourth order difference schemes for hyperbolic problems
ON THE SOLUTION OF LARGE SYSTEMS OF LINEAR ALGEBRAIC EQUATIONS WITH SPARSE, POSITIVE DEFINITE MATRICES
...
...