Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"polynomial eigenvalue"”.
-
Implementación paralela de métodos iterativos para la resolución de problemas polinómicos de valores propios
The polynomial eigenvalue problem appears in many areas of scientific and technical computing. It can be seen as a generalization of the linear eigenvalue problem in which the equation P(lambda)x = 0, that defines the problem, involves a polynomial P(lambda), of degree d, in the parameter lambda …
-
Fine-time resolution passive RF source imaging
… key tools throughout this thesis is the use of polynomial matrices and the polynomial eigenvalue decomposition that allow spatial super resolution techniques, such as the MUSIC algorithm, to be extended to the broadband domain.Results are demonstrated via simulations and statistical analysis …
-
Spectral Stability of Plasma Flow in Magnetic Nozzle
… stability of plasmas is understood as an eigenvalue problem of linearized plasma equations describing time dynamics near some equilibrium state. Presence of eigenvalues with positive imaginary part would indicate the instability when small fluctuations will grow (typically exponentially) …
-
Error Propagation and Algorithmic Design of Contour Integral Eigensolvers with Applications to Fiber Optics
… weak formulation of the Helmholtz problem into a polynomial eigenvalue problem, thus motivating our the adaptation of the FEAST algorithm to solve such eigenvalue problems. We verify the results of our algorithm by finding leaky modes and propagation constants of a step-index fiber, where one can …
-
Advanced polynomial matrix factorization techniques
The advancements in polynomial matrix algebra have significantly bolstered the formulationof broadband array problems, enabling more effective solutions. This is particularlyevident through the utilization of polynomial matrix factorization techniquessuch as the polynomial eigenvalue decomposition …
-
Matrix Polynomials and their Lower Rank Approximations
… a “lower-rank” approximation of a matrix polynomial using second-order non-linear optimization techniques. Two notions of rank are investigated. The first is the rank as the number of linearly independent rows or columns, which is the classical definition. The other notion considered is …