Analyzing eigenvalues

This paper proposes a method to increase the accuracy in estimating forests height using polarimetric interferometry UAV-SAR images. The forest parameters extracted by the proposed method are implemented through three stages. The topographic phase and mean extinction coefficients can be determined in the first two steps through analyzing eigenvalues of the interferometry coherence matrix.

9p vikissinger 03-03-2022 11 1   Download

The stability analysis of linear time invariant delay differential- algebraic equations (DDAEs) is analyzed. Examples are delivered to demonstrate that the eigenvalue-based approach to analyze the exponential stability of dynamical systems is not valid for an arbitrarily high index system, and hence, a new concept of weak exponential stability (w.e.s) is proposed. Then, we characterize the w.e.s in term of a spectral condition for some special classes of DDAEs.

13p cathydoll4 21-02-2019 40 0   Download

The results of the analysis problem are obtained by Spectral method. Necessary conditions for the maximum value of the first eigenvalue corresponding to given column volume are established to determine the optimal distribution of cross-sectional area along the column axis.

12p dannisa 14-12-2018 37 0   Download

Using the similarity variable the asymptotic solutions to mode I and mode III crack problems are obtained. The asymptotic stress, creep strain rate and damage fields near the crack tip are analyzed by solving nonlinear eigenvalue problems resulting in a new far stress distribution. The configurations of the totally damaged zone governed by the new far stress field are found and analyzed.

14p thienthanquydu 23-10-2018 23 1   Download

It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at least 2pd − 1 cos(  2k ). A similar result has been proved by Friedman using more sophisticated tools.More generally, Serre has shown (see [3], [4] ) that for any fixed r and for any infinite family of d-regular graphs Gi, lim inf r(Gi) 2pd − 1. The same result has been proved by Friedman already in [5].

4p thulanh5 12-09-2011 93 5   Download