Abstract
We present a new algorithm for solving general semilinear, elliptic partial differential equations. The algorithm is based on Newton's Method but uses an approximate iterative method to solve the linear systems that arise at each step of Newton's Method. We show that the algorithm can maintain the quadratic convergence of Newton's Method and that it may be substantially faster than other available methods for semilinear or nonlinear partial differential equations.
This research was supported in part by the Office of Naval Research, N0014-67-A-0097-0016.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Bartels and J. 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.
G. Birkhoff and D. J. Rose. Elimination by nested dissection. Complexity of Sequential and Parallel Numerical Algorithms, edited by J. F. Traub, Academic Press, New York, 1973.
A. Chang. Application of sparse matrix methods in electric power system analysis. Sparse Matrix Proceedings, edited by R. A. Willoughby, IBM Research Report #RA1, Yorktown Heights, New York, 1968.
M. A. Diamond. An Economical Algorithm for the Solution of Finite Difference Equations, PhD dissertation, Department of Computer Science, University of Illinois, 1971.
E. G. D'Jakonov. On certain iterative methods for solving non-linear difference equations. Proceedings of the Conference on the Numerical Solution of Differential Equations, (Scotland, June 1969), Springer-Verlag, Heidelberg, 1969.
F. W. Dorr. The direct solution of the discrete Poisson equation on a rectangle. SIAM Review 12:248–263, 1970.
A. J. Hoffman, M. S. Martin, and D. J. Rose. Complexity bounds for regular finite difference and finite element grids. SIAM Journal on Numerical Analysis 10:364–369, 1973.
J. M. Ortega and W. C. Rheinboldt. Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
L. F. Richardson. The approximate arithmetical solution by finite differences of physical problems involving differential equations with an application to the stresses in a masonry dam. Philosophical Transactions of the Royal Society, London, Series A(210): 307–357, 1910.
A. H. Sherman. PhD dissertation, Department of Computer Science, Yale University. To appear.
H. L. Stone. Iterative solution of implicit approximations of multidimensional partial differential equations. SIAM Journal on Numerical Analysis 10:530–558, 1968.
J. H. Wilkinson. The Algebraic Eigenvalue Problem, Clarendon Press, London, 1965.
D. M. Young. Iterative Solutions of Large Linear Systems, Academic Press, New York, 1971.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag
About this paper
Cite this paper
Eisenstat, S.C., Schultz, M.H., Sherman, A.H. (1974). The application of sparse matrix methods to the numerical solution of nonlinear elliptic partial differential equations. In: Colton, D.L., Gilbert, R.P. (eds) Constructive and Computational Methods for Differential and Integral Equations. Lecture Notes in Mathematics, vol 430. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066268
Download citation
DOI: https://doi.org/10.1007/BFb0066268
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07021-4
Online ISBN: 978-3-540-37302-5
eBook Packages: Springer Book Archive
