Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Discontinuous polynomial approximations in the theory of one-step, hybrid and multistep methods for nonlinear ordinary differential equations
HTML articles powered by AMS MathViewer

by M. C. Delfour and F. Dubeau PDF
Math. Comp. 47 (1986), 169-189 Request permission

Abstract:

This paper studies the approximation of the solution of nonlinear ordinary differential equations by (discontinuous) piecewise polynomials of degree K and traces at the nodes of discretization. A mesh-dependent variational framework underlying this discontinuous approximation is derived. Several families of one-step, hybrid and multistep schemes are obtained. It is shown that the convergence rate in the ${L^2}$-norm is $K + 1$. The nodal-convergence rate can go up to $2K + 2$, depending on the particular scheme under consideration. The mesh-dependent variational framework introduced here is of special interest in the approximation of the solution of optimal control problems governed by differential equations.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65L20
  • Retrieve articles in all journals with MSC: 65L20
Additional Information
  • © Copyright 1986 American Mathematical Society
  • Journal: Math. Comp. 47 (1986), 169-189
  • MSC: Primary 65L20
  • DOI: https://doi.org/10.1090/S0025-5718-1986-0842129-0
  • MathSciNet review: 842129