It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax conjecture. Several applications and corollaries, in particular concerning hyperbolic matrix polynomials, are presented.

We show in the present paper that many open and challenging problems in control theory belong to the class of concave minimization programs. More precisely, these problems can be recast as the minimization of a concave objective function over convex LMI (Linear Matrix Inequality) constraints. In this setting, these problems can then be eeciently handled using local and/or global optimization te...

Despite the increasing popularity of error treatment as a research subject, the effect of age as a potential learner-internal factor affecting choice of feedback is largely undertreated. Characterized by being at early stages of self-empowerment, young language learners are considerably vulnerable and in need of particular language input to meet their age-appropriate psychological demands. This...

In [Z1] S. Zelditch introduced an equivariant version of a pseudo-differential calculus on a hyperbolic Riemann surface. We recast his construction in terms of trilinear invariant functionals on irreducible unitary representations of PGL2(R). This allows us to use certain properties of these functionals in the study of the action of pseudodifferential operators on eigenfunctions of the Laplacia...

This paper presents an approach to parsing the Manhattan structure of an indoor scene from a single RGBD frame. The problem of recovering the floor plan is recast as an optimal labeling problem which can be solved efficiently using Dynamic Programming.

We use the existence of localized eigenfunctions of the Laplacian on the Sierpiński gasket (SG) to formulate and prove analogues of the strong Szegö limit theorem in this fractal setting. Furthermore, we recast some of our results in terms of equally distributed sequences.

This paper compares VDM and the Reenement Calculus as methods for deriving executable code from formal speciications. Two existing VDM case studies are recast in the Reenement Calculus style to illustrate the comparison. One case study illustrates operation decomposition or procedural reenement while the other is an example of data reiication or data reenement.