Mathematics of Computation · 1972 · 109 citations · 17 references
ComputingComputational EngineeringComputer ScienceComputational MechanicsFinite Element AnalysisFinite Element MethodsConvergence AnalysisFinite Element DiscretizationFinite Element FormulationNumerical AlgorithmsNumerical Methods For Differential EquationsGalerkin ApproximationGalerkin DiscretizationNumerical Solutions Of Ordinary Differential EquationsPiecewise Polynomial ApproximationQuadrature Rules
New techniques for numerically solving systems of first-order ordinary differential equations are obtained by finding local Galerkin approximations on each subinterval of a given mesh. Different classes of methods correspond to different quadrature rules used to evaluate the innerproducts involved. At each step, a polynomial of degree <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="n"> <mml:semantics> <mml:mi>n</mml:mi> <mml:annotation encoding="application/x-tex">n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is constructed and the arcs are joined together continuously, but not smoothly, to form a piecewise polynomial of degree <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="n"> <mml:semantics> <mml:mi>n</mml:mi> <mml:annotation encoding="application/x-tex">n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and class <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper C Superscript 0"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>C</mml:mi> <mml:mn>0</mml:mn> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">{C^0}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . If the <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="n"> <mml:semantics> <mml:mi>n</mml:mi> <mml:annotation encoding="application/x-tex">n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -point quadrature rule used for the innerproducts is of order <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="nu plus 1 comma nu greater-than-over-equals n"> <mml:semantics> <mml:mrow> <mml:mi> ν </mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mi> ν </mml:mi> <mml:mo> ≧ </mml:mo> <mml:mi>n</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\nu + 1,\nu \geqq n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , then the Galerkin method is of order <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="nu"> <mml:semantics> <mml:mi> ν </mml:mi> <mml:annotation encoding="application/x-tex">\nu</mml:annotation> </mml:semantics> </mml:math> </inline-formula> at the mesh points. In between the mesh points, the <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="j"> <mml:semantics> <mml:mi>j</mml:mi> <mml:annotation encoding="application/x-tex">j</mml:annotation> </mml:semantics> </mml:math> </inline-formula> th derivatives have accuracy of order <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper O left-parenthesis h Superscript min left-parenthesis nu comma n plus 1 right-parenthesis Baseline right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>h</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo movablelimits="true" form="prefix">min</mml:mo> <mml:mo stretchy="false">(</mml:mo> <mml:mi> ν </mml:mi> <mml:mo>,</mml:mo> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:msup> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">O({h^{\min (\nu ,n + 1)}})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , for <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="j equals 0"> <mml:semantics> <mml:mrow> <mml:mi>j</mml:mi> <mml:mo>=</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">j = 0</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper O left-parenthesis h Superscript n minus j plus 1 Baseline right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>h</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>n</mml:mi> <mml:mo> − </mml:mo> <mml:mi>j</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msup> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">O({h^{n - j + 1}})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> for <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="1 less-than-over-equals j less-than-over-equals n"> <mml:semantics> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo> ≦ </mml:mo> <mml:mi>j</mml:mi> <mml:mo> ≦ </mml:mo> <mml:mi>n</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">1 \leqq j \leqq n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> .
17
Introduction to numerical analysis
Donald B. Houghton · Journal of the Franklin Institute · 1956 · 1.1K citations
Implicit Runge-Kutta processes
J. C. Butcher · Mathematics of Computation · 1964 · 679 citations