NANASep 30, 2015

An inexact Picard iteration method for absolute value equation

arXiv:1509.09102
Originality Synthesis-oriented
AI Analysis

For researchers working on numerical methods for absolute value equations, this is an incremental improvement over existing Picard iteration methods.

The paper proposes a new inexact Picard iteration method for solving absolute value equations, providing convergence conditions and numerical experiments showing effectiveness.

Recently, a class of inexact Picard iteration method for solving the absolute value equation: $Ax-|x~|=b$ have been proposed in [Optim Lett 8:2191-2202,2014]. To further improve the performance of Picard iteration method, a new inexact Picard iteration method is proposed to solve the absolute value equation. The sufficient conditions for the convergence of the proposed method for the absolute value equation is given. Some numerical experiments are given to demonstrate the effectiveness of the new method.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes