• Tidak ada hasil yang ditemukan

abs_vol18_pp589-599. 27KB Jun 04 2011 12:05:47 AM

N/A
N/A
Protected

Academic year: 2017

Membagikan "abs_vol18_pp589-599. 27KB Jun 04 2011 12:05:47 AM"

Copied!
1
0
0

Teks penuh

(1)

ELA

AN ALGORITHM FOR SOLVING THE ABSOLUTE VALUE

EQUATION

JIRI ROHN†

Abstract. Presented is an algorithm which for eachA, B∈Rn×n

andb∈Rn

in a finite number of steps either finds a solution of the equationAx+B|x|=b, or states existence of a singular matrix Ssatisfying|S−A| ≤ |B|(and in most cases also constructs such anS).

Key words. Absolute value equation, Algorithm, Regularity, Singularity, Theorem of the alternatives.

AMS subject classifications.15A06, 65H10, 90C33.

Received by the editors March 10, 2009. Accepted for publication August 27, 2009. Handling

Editor: Daniel Szyld.

Institute of Computer Science, Czech Academy of Sciences, Prague, and School of Business

Ad-ministration, Anglo-American University, Prague, Czech Republic ([email protected]). Supported by the Czech Republic Grant Agency under grants 201/09/1957 and 201/08/J020, and by the Institu-tional Research Plan AV0Z10300504.

Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 18, pp. 589-599, September 2009

Referensi

Dokumen terkait

Morgan Street Chicago, IL 60607-7045 ([email protected]), and Visiting Professor, Berlin Mathematical School, Institut f¨ ur Mathematik, Technische Universit¨ at Berlin, Strasse

The refined inertia of a matrix pattern is defined and techniques are developed for constructing potentially nilpotent full sign patterns.. Such patterns are

Supported by the Natural Science Foundation of China (60672160), the Scientific Research Innovation Foundation of Shanghai Municipal Education Commission (09YZ13), and Key

This is a survey of forty necessary and sufficient conditions for regularity of interval matrices published in various papers over the last thirty-five years.. Afull list of

The latter two problems are hopeless since they are wild; i.e., each of them contains the problem of classifying pairs of matrices over F up to similarity..

The problem of finding the minimum rank (maximum nullity) of edge subdivisions of a given graph G is investigated.. Is is shown that if an edge is adjacent to a vertex of degree 1 or

The first kind is the minimal and maximal eigenvalues of all leading principal submatrices of A , and the second kind is one eigenvalue of each leading principal submatrix of A

Several properties of scalar palindromic polynomials are derived, and together with properties of compound matrices, used to establish the Smith form of regular and singular