Interval algorithm for absolute value equations (Q657417)

From MaRDI portal
Revision as of 21:00, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Interval algorithm for absolute value equations
scientific article

    Statements

    Interval algorithm for absolute value equations (English)
    0 references
    0 references
    0 references
    0 references
    16 January 2012
    0 references
    The authors consider the absolute value equation \(f(x):= Ax-|x|- b= 0\), \(A\in\mathbb{R}^{n\times n}\), \(b\in\mathbb{R}^n\). They present a generalized Newton method in order to approximate a zero \(x^*\) of \(f\). To this end they use a particular smoothing function \(f_\mu\) for \(f\). With a second algorithm they construct an enclosure of \(x^*\) using interval arithmetical tools, among them the so-called \(\varepsilon\)-inflation. Numerical experiments illustrate the efficiency of both methods.
    0 references
    0 references
    absolute value equation
    0 references
    generalized Newton method
    0 references
    \(\varepsilon\)-inflation
    0 references
    interval iteration
    0 references
    error estimation
    0 references
    linear complementarity problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references