We investigate the Matrix Powering Positivity Problem, PosMatPow: given an m×m square integer matrix M, a linear function f : Z m×m → Z with integer coefficients, and a positive integer n (encoded in binary), determine whether f(Mn) ≥ 0. We show that for fixed dimensions m of 2 and 3, this problem is decidable in polynomial tim
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its ...
Given linear matrix inequalities (LMIs) L1 and L2 it is natural to ask:(Q1) when does one dominate t...
AbstractA Z-matrix is a square matrix with nonpositive off-diagonal elements. We give a polynomial a...
We investigate theMatrix Powering Positivity Problem, PosMatPow: given anm×m square integer matrixM,...
We investigate theMatrix Powering Positivity Problem, PosMatPow: given anm×m square integer matrixM,...
We investigate the Matrix Powering Positivity Problem, PosMatPow: given an m X m square integer matr...
Abstract. A classical theorem proved in 1942 by I.J. Schoenberg describes all real-valued functions ...
A classical theorem of I.J. Schoenberg characterizes functions that preserve positivity when applied...
A classical theorem proved in 1942 by I.J.Schoenberg describes all real-valued functions that preser...
It is known that LMI can be useful for solving systems of polynomial equations and inequalities prov...
A classical theorem proved in 1942 by I.J.Schoenberg describes all real-valued functions that preser...
AbstractA real, square matrix with nonpositive off-diagonal elements is a Z-matrix, and a Z-matrix w...
We discuss an algorithm with a simplistic approach to solving systems of linear equations arising fr...
The linear complementarity problem is that of finding an n x 1 vector z such that, Mz + q 2 0, z 2 0...
International audienceWe present algorithms and heuristics to compute the characteristic polynomial ...
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its ...
Given linear matrix inequalities (LMIs) L1 and L2 it is natural to ask:(Q1) when does one dominate t...
AbstractA Z-matrix is a square matrix with nonpositive off-diagonal elements. We give a polynomial a...
We investigate theMatrix Powering Positivity Problem, PosMatPow: given anm×m square integer matrixM,...
We investigate theMatrix Powering Positivity Problem, PosMatPow: given anm×m square integer matrixM,...
We investigate the Matrix Powering Positivity Problem, PosMatPow: given an m X m square integer matr...
Abstract. A classical theorem proved in 1942 by I.J. Schoenberg describes all real-valued functions ...
A classical theorem of I.J. Schoenberg characterizes functions that preserve positivity when applied...
A classical theorem proved in 1942 by I.J.Schoenberg describes all real-valued functions that preser...
It is known that LMI can be useful for solving systems of polynomial equations and inequalities prov...
A classical theorem proved in 1942 by I.J.Schoenberg describes all real-valued functions that preser...
AbstractA real, square matrix with nonpositive off-diagonal elements is a Z-matrix, and a Z-matrix w...
We discuss an algorithm with a simplistic approach to solving systems of linear equations arising fr...
The linear complementarity problem is that of finding an n x 1 vector z such that, Mz + q 2 0, z 2 0...
International audienceWe present algorithms and heuristics to compute the characteristic polynomial ...
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its ...
Given linear matrix inequalities (LMIs) L1 and L2 it is natural to ask:(Q1) when does one dominate t...
AbstractA Z-matrix is a square matrix with nonpositive off-diagonal elements. We give a polynomial a...
Add to ORKG