Abstract
For many of the examples given in chapter 1, acceptable accuracy, and often very high accuracy, could be achieved with less than five terms in the trial solution. The advent of computers has brought both a demand for solutions of high accuracy and an interest in problems that are inherently more complex than the simple examples given in section 1.2.
This is a preview of subscription content, log in via an 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
Chakrabarti, S. Int. J. Num. Meth. Eng. 3, 261–273 (1971).
Cooley, J. W., and Tukey, J. W. Math. Comp. 19, 297–301 (1965).
Ergatoudis, I., Irons, B., and Zienkiewicz, O. C. Int. J. Solids Struct. 4, 31–42 (1968).
Isaacson, E., and Keller, H. B. Analysis of Numerical Methods, Wiley, New York (1966).
Orszag, S. A. Phys. Fluids Supplement II 12, 250–257 (1969).
Orszag, S. A. J. Comp. Phys. 37, 93–112 (1980).
Strang, G. Linear Algebra and Its Applications, Academic Press, New York, 2nd Edn. (1980).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Fletcher, C.A.J. (1984). Computational Galerkin Methods. In: Computational Galerkin Methods. Springer Series in Computational Physics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85949-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-85949-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85951-9
Online ISBN: 978-3-642-85949-6
eBook Packages: Springer Book Archive