On the solvability and Picard-type method for absolute value matrix equations

DOI10.1007/S40314-022-01782-WMaRDI QIDQ2115066zbMATHOpenAlexFDO

Publication date 15 March 2022

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40314-022-01782-w

convergence solvability unique solution absolute value matrix equation Picard-type method

Iterative numerical methods for linear systems (65F10) Matrix equations and identities (15A24) Numerical methods for matrix equations (65F45)

Recommendations

Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation
Sufficient conditions for the solvability of a Sylvester-like absolute value matrix equation
On the unique solvability of the absolute value equation
Some notes on the solvability conditions for absolute value equations
scientific article; zbMATH DE number 7260006

Cites work

scientific article; zbMATH DE number 635657 (Why is no real title available?)
A generalized Newton method for absolute value equations
A generalized modified Hermitian and skew-Hermitian splitting (GMHSS) method for solving complex Sylvester matrix equation
A globally and quadratically convergent method for absolute value equations
A modified generalized Newton method for absolute value equations
A note on absolute value equations
A note on unique solvability of the absolute value equation
A theorem of the alternatives for the equationAx+B|x| =b
Absolute value equations
An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation
An iterative method for solving absolute value equations and sufficient conditions for unique solvability
Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
Global and finite convergence of a generalized Newton method for absolute value equations
Knapsack feasibility as an absolute value equation solvable by successive linear programming
Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation
New sufficient conditions for the unique solution of a square Sylvester-like absolute value equation
On Picard-SHSS iteration method for absolute value equation
On an iterative method for solving absolute value equations
On equivalent reformulations for absolute value equations
On the solution of general absolute value equations
On the unique solution of the generalized absolute value equation
On the unique solvability of the absolute value equation
On unique solvability of the absolute value equation
Primal-dual bilinear programming solution of the absolute value equation
Sufficient conditions for the solvability of a Sylvester-like absolute value matrix equation
TWO CSCS-BASED ITERATION METHODS FOR SOLVING ABSOLUTE VALUE EQUATIONS
The Picard-HSS iteration method for absolute value equations
The general coupled matrix equations over generalized bisymmetric matrices
The unique solution of the absolute value equations

Cited in

(8)

On the sole solvability of general absolute value equation
Relaxed-based matrix splitting methods for solving absolute value equations
Sufficient conditions for the solvability of a Sylvester-like absolute value matrix equation
Exceptional family of elements and existence condition of solution for absolute value equation
Unique solvability conditions for the absolute value matrix equation
On unique solvability and Picard’s iterative method for absolute value equations
Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation
Generalized cubic matrix solutions to matrix equation \(\boldsymbol{A} +\boldsymbol{X} = \boldsymbol{AX}\) and solutions to absolute value equation

This page was built for publication: On the solvability and Picard-type method for absolute value matrix equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115066)