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 16 of 16 for “"Inverse eigenvalue problem"”.
-
An Inverse Eigenvalue Problem for the Schrödinger Equation on the Unit Ball of R<sup>3</sup>
The inverse eigenvalue problem for a given operator is to determine the coefficients by using knowledge of its eigenfunctions and eigenvalues. These are determined by the behavior of the solutions on the domain boundaries. In our problem, the Schrödinger operator acting on functions defined on the …
-
Spectral graph theory of the Hypercube
… Spectral Graph Theory focuses on the set of eigenvalues and eigenvectors, called the spectrum, of these matrices and provides several interesting areas of study. One of these is the inverse eigenvalue problem of a graph, which tries to determine information about the possible eigenvalues of …
-
Counting Threshold Graphs and Finding Inertia Sets
… papers. Inertia sets are a relaxation of the inverse eigenvalue problem. Instead of determining all the possible eigenvalues that can be obtained by matrices with a specific zero/nonzero pattern we restrict to counting the number of positive and negative eigenvalues.
-
Incorporating Acoustical Consistency in the Design for Manufacturing of Wooden Guitars
… mechanical properties of the wooden plate, is an inverse eigenvalue problem. Since few methods exist for solving the inverse eigenvalue problem of general matrices, a new method based on the generalized Cayley-Hamilton theorem was proposed in the thesis. A further method, based on the determinant …
-
On the quasimonotonicity of a square linear operator with respect to a nonnegative cone
… the presence of a positive first eigenvector the problem is shown to be equivalent to the irreducible nonnegative inverse eigenvalue problem
-
Musings on matchings, matrices, and multiplicities
… Theorem is a celebrated contribution to the inverse eigenvalue problem for trees due to its determination of vertices whose removal affects multiplicities of eigenvalues in a non-intuitive manner. For a more general graph, G, that contains cycles, the construction of the weighted matching …
-
Diagonal Entry Restrictions in Minimum Rank Matrices, and the Inverse Inertia and Eigenvalue Problems for Graphs
… example of how nil vertices can help solve the inverse inertia problem. Lastly we give results about the inverse eigenvalue problem and solve a more complex variation of the problem (the λ, µ problem) for the path on 4 vertices. We also obtain a general result for the λ, µ problem concerning the …
-
Structured numerical problems in contemporary applications
The presence of structure in a computational problem can often be exploited and can lead to a more efficient numerical algorithm. In this dissertation, we look at structured numerical problems that arise from applications in wireless communications and machine learning that also impact other areas …
-
Steady State Stability Analysis of AC-DC Power Systems
… system operating point is selected.</p> <p>A new eigenvalue tracking algorithm has been developed based on the evaluation of the sensitivity of a matrix determinant. It iteratively updates the eigenvalues following any change in the system state matrix at one-third the cost of eigenvalue …
-
Can One Hear...? An Exploration Into Inverse Eigenvalue Problems Related To Musical Instruments
The central theme of this thesis deals with problems related to the question, “Can one hear the shape of a drum?” first posed formally by Mark Kac in 1966. More precisely, can one determine the shape of a membrane with fixed boundary from the spectrum of the associated differential operator? For …
-
G-Varieties and the Principal Minors of Symmetric Matrices
The variety of principal minors of nxn symmetric matrices, denoted Zn, can be described naturally as a projection from the Lagrangian Grassmannian. Moreover, Zn is invariant under the action of a group G C GL(2n) isomorphic to (SL(2)xn) x Sn. One may use this symmetry to study the defining ideal of …
-
Número mínimo de autovalores de grafos unicíclicos
… exposição de resultados clássicos e recentes do Problema Inverso de Autovalor para Grafos (IEP-G). Foi feita uma revisão de literatura com foco em técnicas que têm se mostrado eficientes para resolver problemas relacionados ao IEP-G. Além disso, trazemos algoritmos de diagonalização em grafos com …
-
Construction of approximately equiangular tight frames and their applications
… a graph and its spetrum onsists of two distint eigenvalues.Viewing the onstrution of a signature matrix as an inverse eigenvalue problem,we develop a numerial algorithm to ompute a solution that approximates the signaturematrix of an ETF. The seond method produes nearly equiangular, nearly tight …
-
Το αντίστροφο φασματικό πρόβλημα της εύρεσης του δείκτη διάθλασης για το εσωτερικό πρόβλημα διαπερατότητας
… of this thesis is the investigation of the inverse transmission eigenvalue problem, that is the determination of the refractive index of an inhomogeneous medium from transmission eigenvalues. Using some known results for the case where the refractive index is a radially symmetric and C2 …