The inverse eigenvalue problem of a graph G is the characterizing all lists eigenvalues real symmetric matrices whose off-diagonal pattern prescribed by adjacencies G. strong spectral property powerful tool in this problem, which identifies entries can be perturbed while controlling and preserving eigenvalues. Matrix Liberation Lemma introduced Barrett et al. 2020 advances notion to more genera...

Stability parameters for stabilized methods in uids are suggested. The computation of the largest eigenvalue of a generalized eigenvalue problem replaces controversial de nitions of element diameters and inverse estimate constants, used heretofore to compute these stability parameters. The design is employed in the advective-di usive model, incompressible Navier-Stokes equations and the Stokes ...

We introduce an adaptive finite element method for computing electromagnetic guided waves in a closed, inhomogeneous, pillared three-dimensional waveguide at a given frequency based on the inverse iteration method. The problem is formulated as a generalized eigenvalue problems. By modifying the exact inverse iteration algorithm for the eigenvalue problem, we design a new adaptive inverse iterat...

In this paper we consider a rational eigenvalue problem governing the vibrations of a tube bundle immersed in an inviscid compressible fluid. Taking advantage of eigensolutions of appropriate sparse linear eigenproblems the large nonlinear eigenvalue problem is projected to a much smaller one which is solved by inverse iteration.

In present article the self-contained derivation of eigenvalue inverse problem results is given by using a discrete approximation with three-diagonal SturmLiouville operator on a finite interval. It is demonstrated that inverse problem procedure is nothing else than well known Gram-Schmidt orthonormalization in Euclidean space for special vectors numbered by space coordinate index. All the resu...

Pole assignment problems are special algebraic inverse eigenvalue problems. In this paper, we research numerical methods of the robust pole assignment problem for second-order systems. The problem is formulated as an optimization problem. Depending upon whether the prescribed eigenvalues are real or complex, we separate the discussion into two cases and propose two algorithms for solving this p...