A numerically rigorous proof of curve veering in an eigenvalue problem for differential equations (Q1909649)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A numerically rigorous proof of curve veering in an eigenvalue problem for differential equations
scientific article

    Statements

    A numerically rigorous proof of curve veering in an eigenvalue problem for differential equations (English)
    0 references
    0 references
    12 October 1997
    0 references
    Parameter-dependent selfadjoint eigenvalue problems for a system of ordinary fourth-order differential equations are considered. The phenomenon of eigenvalue curves veering is investigated by the use of numerical procedures. The author proposes such methods of computing bounds of the form \[ p(\Omega)-\epsilon \leq \lambda(\Omega) \leq p(\Omega)+\epsilon \] for the eigenvalue curves \(\lambda(\Omega)\) that rounding errors are rigorously controlled by the use of interval arithmetic. By means of calculated bounds, the phenomenon of curve veering for a concrete situation can be proved without requiring special properties of the eigenvalue curves.
    0 references
    parameter-dependent selfadjoint eigenvalue problems
    0 references
    systems of ordinary fourth-order differential equations
    0 references
    curve veering
    0 references
    interval arithmetic
    0 references
    eigenvalue curves
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references