We consider two algorithms that use the block Macaulay matrix to solve (rectangular)
multiparameter eigenvalue problems (MEPs). On the one hand, a multidimensional …

One of the most pervasive tools from (numerical) linear algebra is, without any doubt, the
standard eigenvalue decomposition. Eigenvalues describe the intrinsic system dynamics of …

We deal with the challenges and solutions for two-parameter eigenvalue problems (TPEPs)
involving large-scale various dense coefficient matrices using several numerical methods …

Effective computation of resultants is a central problem in elimination theory and polynomial
system solving. Commonly, we compute the resultant as a quotient of determinants of …

In this article, we solve m‐parameter eigenvalue problems (m EPs), with m any natural
number by representing the problem using tensor‐trains (TTs) and designing a method …

In this paper, we consider the aeroelastic flutter problem (AEFP) in terms of matrix equations.
We provide a general framework on the spectral theory of three parameter AEFP in tensor …

Standard multiparameter eigenvalue problems (MEPs) are systems of k≥ 2 k ≥ 2 linear kk‐
parameter square matrix pencils. Recently, a new form of multiparameter eigenvalue …

We present a new approach to compute eigenvalues and eigenvectors of locally definite
multiparameter eigenvalue problems by its signed multiindex. The method has the …

Solving polynomial systems is one of the oldest and most important problems in
computational mathematics and has many applications in several domains of science and …

It was mainly due to Atkinson works, who introduced Linear Multiparameter Eigenvalue
problems (LMEPs), based on determinantal operators on the Tensor Product Space. Later …