Approximating the spectrum of matrices and hypermatrices

TL;DR

This paper introduces a general method for approximating the spectral decomposition of matrices and hypermatrices by deriving generators for elimination ideals and iterative procedures.

Contribution

It presents a novel approach to spectral decomposition using algebraic generators and iterative algorithms for matrices and hypermatrices.

Findings

Derived generators for elimination ideals related to spectral constraints

Developed iterative procedures for spectral approximation

Applicable to both matrices and hypermatrices

Abstract

We describe a general approach for computing generators for elimination ideals associated with matrix and hypermatrix spectral decomposition constraints. We derive from these generators iterative procedures for approximating the spectral decomposition of matrices and hypermatrices.