It is undecidable whether the growth rate of a given bilinear system is 1

DOI10.1016/J.LAA.2022.06.022MaRDI QIDQ2158279zbMATH OpenOpenAlexWikidataFDO

Authors Matthieu Rosenfeld

Publication date 26 July 2022

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2201.07630

zbMATH Keywords

bilinear mapsbilinear systemsgrowth rate

Mathematics Subject Classification ID

Linear transformations, semilinear transformations (15A04) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Quadratic and bilinear forms, inner products (15A63) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Abstract: We show that there exists no algorithm that decides for any bilinear system $(B,v)$ if the growth rate of $(B,v)$ is $1$. This answers a question of Bui who showed that if the coefficients are positive the growth rate is computable (i.e., there is an algorithm that outputs the sequence of digits of the growth rate of $(B,v)$). Our proof is based on a reduction of the computation of the joint spectral radius of a set of matrices to the computation of the growth rate of a bilinear system. We also use our reduction to deduce that there exists no algorithm that approximates the growth rate of a bilinear system with relative accuracy $varepsilon$ in time polynomial in the size of the system and of $varepsilon$. Our two results hold even if all the coefficients are nonnegative rationals.

Recommendations

• Growth rate of switched homogeneous systems
• Growth of bilinear maps
• Efficient algorithms for deciding the type of growth of products of integer matrices
• The boundedness of all products of a pair of matrices is undecidable
• Publication:5749640

Cites work

• Growth of bilinear maps
• scientific article; zbMATH DE number 3155071 (Why is no real title available?)
• The boundedness of all products of a pair of matrices is undecidable
• The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
• The maximum number of minimal dominating sets in a tree

Cited in

(4)

• Growth of bilinear maps
• Growth of replacements
• Growth of bilinear maps. II: Bounds and orders
• Growth of bilinear maps. III: Decidability

This page was built for publication: It is undecidable whether the growth rate of a given bilinear system is 1

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