On finite termination of the generalized Newton method for solving absolute value equations

07/10/2022
by   Jia Tang, et al.
0

Motivated by the framework constructed by Brugnano and Casulli [SIAM J. Sci. Comput. 30: 463–472, 2008], we analyze the finite termination property of the generalized Netwon method (GNM) for solving the absolute value equation (AVE). More precisely, for some special matrices, GNM is terminated in at most 2n + 2 iterations. A new result for the unique solvability and unsolvability of the AVE is obtained. Numerical experiments are given to demonstrate the theoretical analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2023

A generalization of the Newton-based matrix splitting iteration method for generalized absolute value equations

A generalization of the Newton-based matrix splitting iteration method (...
research
11/27/2021

A non-monotone smoothing Newton algorithm for solving the system of generalized absolute value equations

The system of generalized absolute value equations (GAVE) has attracted ...
research
12/06/2022

Hierarchical Termination Analysis for Generalized Planning

This paper presents a new approach for analyzing and identifying potenti...
research
01/28/2021

Sufficient conditions for the unique solution of a class of new Sylvester-like absolute value equation

In this paper, a class of new Sylvester-like absolute value equation (AV...
research
03/17/2021

An inexact Douglas-Rachford splitting method for solving absolute value equations

The last two decades witnessed the increasing of the interests on the ab...
research
10/21/2021

Newton-Type Methods For Simultaneous Matrix Diagonalization

This paper proposes a Newton type method to solve numerically the eigenp...
research
07/02/2019

A New Cyclic Gradient Method Adapted to Large-Scale Linear Systems

This paper proposes a new gradient method to solve the large-scale probl...

Please sign up or login with your details

Forgot password? Click here to reset