Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Remote Access
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)


A general equivalence theorem in the theory of discretization methods

Authors: J. M. Sanz-Serna and C. Palencia
Journal: Math. Comp. 45 (1985), 143-152
MSC: Primary 65J10; Secondary 65M10, 65N10
MathSciNet review: 790648
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The Lax-Richtmyer theorem is extended to work in the framework of Stetter's theory of discretizations. The new result applies to both initial and boundary value problems discretized by finite elements, finite differences, etc. Several examples are given, together with a comparison with other available equivalence theorems. The proof relies on a generalized Banach-Steinhaus theorem.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65J10, 65M10, 65N10

Retrieve articles in all journals with MSC: 65J10, 65M10, 65N10

Additional Information

PII: S 0025-5718(1985)0790648-7
Article copyright: © Copyright 1985 American Mathematical Society

Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia