Complexity of computing interval matrix powers for special classes of matrices

David Hartman; Milan Hladík

Displaying similar documents to “Complexity of computing interval matrix powers for special classes of matrices”

Nested matrices and inverse $M$ -matrices

Jeffrey L. Stuart (2015)

Czechoslovak Mathematical Journal

Similarity:

Given a sequence of real or complex numbers, we construct a sequence of nested, symmetric matrices. We determine the $L U$ - and $Q R$ -factorizations, the determinant and the principal minors for such a matrix. When the sequence is real, positive and strictly increasing, the matrices are strictly positive, inverse $M$ -matrices with symmetric, irreducible, tridiagonal inverses.

On the matrix negative Pell equation

Aleksander Grytczuk, Izabela Kurzydło (2009)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Let N be a set of natural numbers and Z be a set of integers. Let M₂(Z) denotes the set of all 2x2 matrices with integer entries. We give necessary and suficient conditions for solvability of the matrix negative Pell equation (P) X² - dY² = -I with d ∈ N for nonsingular X,Y belonging to M₂(Z) and his generalization (Pn) $\sum_{i = 1}^{n} X ₂_{i} - d \sum_{i = 1}^{n} Y ²_{i} = - I$ with d ∈ N for nonsingular $X_{i}, Y_{i} \in M ₂ (Z)$ , i=1,...,n.

A method to rigorously enclose eigenpairs of complex interval matrices

Castelli, Roberto, Lessard, Jean-Philippe

Similarity:

In this paper, a rigorous computational method to enclose eigenpairs of complex interval matrices is proposed. Each eigenpair $x = (λ,)$ is found by solving a nonlinear equation of the form $f (x) = 0$ via a contraction argument. The set-up of the method relies on the notion of $r a d i i p o l y n o m i a l s$ , which provide an efficient mean of determining a domain on which the contraction mapping theorem is applicable.

Nonsingularity, positive definiteness, and positive invertibility under fixed-point data rounding

Jiří Rohn (2007)

Applications of Mathematics

Similarity:

For a real square matrix $A$ and an integer $d \geq 0$ , let $A_{(d)}$ denote the matrix formed from $A$ by rounding off all its coefficients to $d$ decimal places. The main problem handled in this paper is the following: assuming that $A_{(d)}$ has some property, under what additional condition(s) can we be sure that the original matrix $A$ possesses the same property? Three properties are investigated: nonsingularity, positive definiteness, and positive invertibility. In all three cases it is shown that there exists...

A new inclusion interval for the real eigenvalues of real matrices

Yinghua Wang, Xinnian Song, Lei Gao (2023)

Czechoslovak Mathematical Journal

Similarity:

By properties of Cvetković-Kostić-Varga-type (or, for short, CKV-type) B-matrices, a new class of nonsingular matrices called CKV-type $\bar{B}$ -matrices is given, and a new inclusion interval of the real eigenvalues of real matrices is presented. It is shown that the new inclusion interval is sharper than those provided by J. M. Peña (2003), and by H. B. Li et al. (2007). We also propose a direct algorithm for computing the new inclusion interval. Numerical examples are included to illustrate...

Circulant matrices with orthogonal rows and off-diagonal entries of absolute value $1$

Daniel Uzcátegui Contreras, Dardo Goyeneche, Ondřej Turek, Zuzana Václavíková (2021)

Communications in Mathematics

Similarity:

It is known that a real symmetric circulant matrix with diagonal entries $d \geq 0$ , off-diagonal entries $\pm 1$ and orthogonal rows exists only of order $2 d + 2$ (and trivially of order $1$ ) [Turek and Goyeneche 2019]. In this paper we consider a complex Hermitian analogy of those matrices. That is, we study the existence and construction of Hermitian circulant matrices having orthogonal rows, diagonal entries $d \geq 0$ and any complex entries of absolute value $1$ off the diagonal. As a particular case, we consider...

The image of multilinear polynomials evaluated on $3 \times 3$ upper triangular matrices

Thiago Castilho de Mello (2021)

Communications in Mathematics

Similarity:

We describe the images of multilinear polynomials of arbitrary degree evaluated on the $3 \times 3$ upper triangular matrix algebra over an infinite field.

Vandermonde nets

Roswitha Hofer, Harald Niederreiter (2014)

Acta Arithmetica

Similarity:

The second-named author recently suggested identifying the generating matrices of a digital (t,m,s)-net over the finite field $_{q}$ with an s × m matrix C over $_{q^{m}}$ . More exactly, the entries of C are determined by interpreting the rows of the generating matrices as elements of $_{q^{m}}$ . This paper introduces so-called Vandermonde nets, which correspond to Vandermonde-type matrices C, and discusses the quality parameter and the discrepancy of such nets. The methods that have been successfully used...

-simplicity of interval max-min matrices

Ján Plavka, Štefan Berežný (2018)

Kybernetika

Similarity:

A matrix $A$ is said to have $𝐗$ -simple image eigenspace if any eigenvector $x$ belonging to the interval $𝐗 = {x : \underset{̲}{x} \leq x \leq \bar{x}}$ containing a constant vector is the unique solution of the system $A \otimes y = x$ in $𝐗$ . The main result of this paper is an extension of $𝐗$ -simplicity to interval max-min matrix $𝐀 = {A : \underset{̲}{A} \leq A \leq \bar{A}}$ distinguishing two possibilities, that at least one matrix or all matrices from a given interval have $𝐗$ -simple image eigenspace. $𝐗$ -simplicity of interval matrices in max-min algebra are studied and equivalent conditions for...

Linear preservers of row-dense matrices

Sara M. Motlaghian, Ali Armandnejad, Frank J. Hall (2016)

Czechoslovak Mathematical Journal

Similarity:

Let $𝐌_{m, n}$ be the set of all $m \times n$ real matrices. A matrix $A \in 𝐌_{m, n}$ is said to be row-dense if there are no zeros between two nonzero entries for every row of this matrix. We find the structure of linear functions $T : 𝐌_{m, n} \to 𝐌_{m, n}$ that preserve or strongly preserve row-dense matrices, i.e., $T (A)$ is row-dense whenever $A$ is row-dense or $T (A)$ is row-dense if and only if $A$ is row-dense, respectively. Similarly, a matrix $A \in 𝐌_{n, m}$ is called a column-dense matrix if every column of $A$ is a column-dense vector. At the end, the structure...

Controllable and tolerable generalized eigenvectors of interval max-plus matrices

Matej Gazda, Ján Plavka (2021)

Kybernetika

Similarity:

By max-plus algebra we mean the set of reals $ℝ$ equipped with the operations $a \oplus b = max {a, b}$ and $a \otimes b = a + b$ for $a, b \in ℝ .$ A vector $x$ is said to be a generalized eigenvector of max-plus matrices $A, B \in ℝ (m, n)$ if $A \otimes x = λ \otimes B \otimes x$ for some $λ \in ℝ$ . The investigation of properties of generalized eigenvectors is important for the applications. The values of vector or matrix inputs in practice are usually not exact numbers and they can be rather considered as values in some intervals. In this paper the properties of matrices and vectors with inexact (interval)...