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.

 

Minimax approximate solutions of linear boundary value problems
HTML articles powered by AMS MathViewer

by Darrell Schmidt and Kenneth L. Wiggins PDF
Math. Comp. 33 (1979), 139-148 Request permission

Abstract:

Define the operator $D:C”[0,\tau ] \to C[0,\tau ]$ by $D[u] = u” - {a_0}u\prime - {a_1}u$ where ${a_0},{a_1} \in C[0,\tau ]$ and consider the two point boundary value problem $({\text {BVP}})\;D[y](x) = {a_2}(x)$, $x \in [0,\tau ]$, ${N_0}[y] = {\alpha _0}y(0) + {\alpha _1}y\prime (0) = {\alpha _2}$, ${N_\tau }[y] = {\beta _0}y(\tau ) + {\beta _1}y\prime (\tau ) = {\beta _2}$ where ${a_2} \in C[0,\tau ]$, $\alpha _0^2 + \alpha _1^2 \ne 0$ and $\beta _0^2 + \beta _1^2 \ne 0$. Let ${\Pi _k}$ denote the set of polynomials of degree at most k and define the approximating set ${\mathcal {P}_k} = \{ p \in {\Pi _k}:{N_0}[p] = {\alpha _2},{N_\tau }[p] = {\beta _2}\}$. Then for each $k \geqslant 3$ there exists ${p_k} \in {\mathcal {P}_k}$ satisfying $\left \| {D[{p_k}] - {a_2}} \right \| = {\inf _{p \in {\mathcal {P}_k}}}\left \| {D[p] - {a_2}} \right \| = {\delta _k}$, where $\left \| \cdot \right \|$ denotes the uniform norm on $C[0,\tau ]$. If the homogeneous BVP $D[y] = 0$, ${N_0}[y] = {N_\tau }[y] = 0$ has no nontrivial solutions, then the nonhomogeneous BVP has a unique solution y and ${\lim _{k \to \infty }}\left \| {p_k^{(i)} - {y^{(i)}}} \right \| = 0$ for $i = 0,1,2$. If X denotes a closed subset of $[0,\tau ]$ and \[ {\delta _{k,X}} = \inf \limits _{p \in {\mathcal {P}_k}} \max \limits _{x \in X} |D[p](x) - {a_2}(x)|,\] then for each $\varepsilon > 0$ there exists $\delta > 0$ such that $d(x) \leqslant \delta$ implies that $0 \leqslant {\delta _k} - {\delta _{k,X}} \leqslant \varepsilon$, where $d(X)$ denotes the density of X in $[0,\tau ]$. Several numerical examples are given.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65L10
  • Retrieve articles in all journals with MSC: 65L10
Additional Information
  • © Copyright 1979 American Mathematical Society
  • Journal: Math. Comp. 33 (1979), 139-148
  • MSC: Primary 65L10
  • DOI: https://doi.org/10.1090/S0025-5718-1979-0514815-X
  • MathSciNet review: 514815