Hybrid approach to the joint spectral radius computation

08/09/2023
by   Thomas Mejstrik, et al.
0

In this paper we propose a modification to the invariant polytope algorithm (ipa) using ideas of the finite expressible tree algorithm (feta) by Möller and Reif. We show that our new feta-flavoured-ipa applies to a wider range of matrix families.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/16/2021

On the joint spectral radius

We prove explicit polynomial bounds for Bochi's inequalities regarding t...
research
01/29/2019

On the distance α-spectral radius of a connected graph

For a connected graph G and α∈ [0,1), the distance α-spectral radius of ...
research
02/24/2022

An Algorithm for Computing the Covering Radius of a Linear Code Based on Vilenkin-Chrestenson Transform

We present a generalization of Walsh-Hadamard transform that is suitable...
research
01/28/2023

On the spectrum of the double-layer operator on locally-dilation-invariant Lipschitz domains

We say that Γ, the boundary of a bounded Lipschitz domain, is locally di...
research
12/17/2019

Generalized Perron Roots and Solvability of the Absolute Value Equation

Let A be a real (n× n)-matrix. The piecewise linear equation system z-A|...
research
03/29/2023

On the α-spectral radius of hypergraphs

For real α∈ [0,1) and a hypergraph G, the α-spectral radius of G is the ...
research
09/30/2022

An improved algorithm for Generalized Čech complex construction

In this paper, we present an algorithm that computes the generalized Čec...

Please sign up or login with your details

Forgot password? Click here to reset