DeepAI AI Chat
Log In Sign Up

Elliptic polytopes and invariant norms of linear operators

by   Thomas Mejstrik, et al.

We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long matrix products, in the Lyapunov stability, etc.. The main issue in the construction is to decide whether a given ellipse is in the convex hull of others. The computational complexity of this problem is analysed by considering an equivalent optimisation problem. We show that the number of local extrema of that problem may grow exponentially in d. For d=2,3, it admits an explicit solution for an arbitrary number of ellipses; for higher dimensions, several geometric methods for approximate solutions are derived. Those methods are analysed numerically and their efficiency is demonstrated in applications.


page 1

page 2

page 3

page 4


Computer-assisted analysis of the sign-change structure for elliptic problems

In this paper, a method is proposed for rigorously analyzing the sign-ch...

A Mann iterative regularization method for elliptic Cauchy problems

We investigate the Cauchy problem for linear elliptic operators with C^∞...

A Survey on Numerical Methods for Spectral Space-Fractional Diffusion Problems

The survey is devoted to numerical solution of the fractional equation A...

Port-Hamiltonian Realizations of Linear Time Invariant Systems

The question when a general linear time invariant control system is equi...

High order numerical schemes for solving fractional powers of elliptic operators

In many recent applications when new materials and technologies are deve...

Convex Optimisation for Inverse Kinematics

We consider the problem of inverse kinematics (IK), where one wants to f...