This paper derives explicit eigensolutions of the Laplace operator, whose eigenvalue problem is also called the Helmholtz equation. Specifically, the paper showcases all geometries through which the solutions to the Helmholtz equation can be represented in a finite sinusoidal form. These geometries are the rectangle, the square, the isosceles right triangle, the equilateral triangle, and the hemi-equilateral triangle. As a counterexample, the paper also proves that the parallelogram cannot yield a product form of a solution through the method of separation of variables. The solutions for the isosceles triangle and the hemi-equilateral triangle are derived using symmetric properties of the square and the equilateral triangle.  The paper concludes that symmetry is crucial to solving the Laplacian for these geometries and that this symmetry is also reflected in their respective spectra. However, importantly, the spectrum is unique for the examined geometries.

In the last years some results for the Laplacian on manifolds have been shown to hold also for the graph Laplacian, e.g. Courant's nodal domain theorem or Cheeger's inequality. Friedman (Some geometric aspects of graphs and their eigenfunctions, Duke Math. J. 69 (3), pp. 487-525, 1993) described the idea of a ``graph with boundary". With this concept it is possible to formulate Dirichlet and Neumann eigenvalue problems. Friedman also conjectured another ``classical" result for manifolds, the Faber-Krahn theorem, for regular bounded trees with boundary. The Faber-Krahn theorem states that among all bounded domains $D \subset R^n$ with fixed volume, a ball has lowest first Dirichlet eigenvalue. In this paper we show such a result for regular trees by using a rearrangement technique. We give restrictive conditions for trees with boundary where the first Dirichlet eigenvalue is minimized for a given "volume". Amazingly Friedman's conjecture is false, i.e. in general these trees are not ``balls". But we will show that these are similar to ``balls". (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing

In this paper we prove a Faber-Krahn-type inequality for regular trees and give a complete characterization of extremal trees. It extends a former result of the author. The main tools are rearrangements and perturbation of regular trees. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing

No description available.

The ground state of a quantum system is the minimizer of the total energy of that system. The aim of this thesis is to present and numerically solve the Gross-Pitaevskii eigenvalue problem (GPE) as a physical model for the formation of ground states of dilute Bose gases at ultra-low temperatures in a disordered potential. The first part of the report introduces the quantum mechanical phenomenon that arises at ground states of the Bose gases; the Anderson localization, and presents the nonlinear eigenvalue problem and the finite element method (FEM) used to discretize the GPE. The numerical method used to solve the eigenvalue problem for the smallest eigenvalue is called the inverse power iteration method, which is presented and explained. In the second part of the report, the smallest eigenvalue of a linear Schrödinger equation is compared with the numerically computed smallest eigenvalue (ground state) in order to evaluate the accuracy of a linear numerical scheme constructed as first step for numerically solving the non-linear problem. In the next part of the report, the numerical methods are implemented to solve for the eigenvalue and eigenfunction of the (non-linear) GPE at ground state (smallest eigenvalue). The mathematical expression for the quantum energy and smallest eigenvalue of the non-linear system are presented in the report. The methods used to solve the GPE are the FEM and inverse power iteration method and different instances of the Anderson localization are produced. The study shows that the error of the smallest eigenvalue approximation for the linear case without disorder is satisfying when using FEM and Power iteration method. The accuracy of the approximation obtained for the linear case without disorder is satisfying, even for a low numbers of iterations. The methods require many more iterations for solving the GPE with a strong disorder. On the other hand, pronounced instances of Anderson localizations are produced in a certain scaling regime. The study shows that the GPE indeed works well as a physical model for the Anderson localization. / Syftet med denna avhandling är att undersöka hur väl Gross-Pitaevskii egenvärdesekvation (GPE) passar som en fysisk modell för bildandet av stationära elektronstater i utspädda Bose-gaser vid extremt låga temperaturer. Fenomenet som skall undersökas heter Anderson lokalisering och uppstår när potentialfältets styrka och störning i systemet är tillräckligt hög. Undersökningen görs i denna avhandling genom att numeriskt lösa GPE samt illustrera olika utfall av Anderson lokaliseringen vid olika numeriska värden. Den första delen av rapporten introducerar det icke-linjära matematiska uttrycket för GPE samt de numeriska metoderna som används för att lösa problemet numerisk: finita elementmetoden (FEM) samt egenvärdesalgoritmen som heter inversiiteration. Finita elementmetoden används för att diskretisera variationsproblemet av GPE och ta fram en enkel algebraisk ekvation. Egenvärdesalgoritmen tillämpas på den algebraiska ekvation för att iterativt beräkna egenfunktionen som motsvarar det minsta egenvärdet. Det minsta egenvärdet av en fullt definierad (linjär) Schrödinger ekvation löses i rapportens andra del. Den linjära ekvationen löses för att ta fram en förenklad numerisk algoritm att utgå ifrån innan den icke-linjära algoritmen tas fram. För att försäkra sig att den linjära algoritmen stämmer bra jämförs det exakta egenvärdet för problemet med ett numeriskt framtaget värde. Undersökningen av den linjära algoritmen visar att vi får en bra uppskattning av egenvärdet - även vid få iterationer. Vidare konstrueras den ickelinjära algoritmen baserat på den linjära. Ekvationen löses och undersökes. Egenfunktionen som motsvarar minsta egenvärdet framtas och beskriver kvantsystemet i lägsta energitillståndet, så kallade grundtillståndet. Undersökningen av GPE visar att de numeriska metoderna kräver många fler iterationer innan en tillräckligt bra uppskattning av egenvärdet fås. Å andra sidan fås markanta Anderson lokaliseringar för ett skalningsområde som beskrivs av styrkan av potentialfältet i relation till dess störning. Slutsatsen är att Gross-Pitaevskii egenvärdesekvation passar bra som en fysisk modell för detta kvantsystem.

Symmetric generalized eigenvalue problems arise in many physical applications and frequently only a few of the eigenpairs are of interest. Typically, the problems are large and sparse, and therefore traditional methods such as the QZ algorithm may not be considered. Moreover, it may be impractical to apply shift-and-invert Lanczos, a favored method for problems of this type, due to difficulties in applying the inverse of the shifted matrix. With these difficulties in mind, Golub and Ye developed an inverse free Krylov subspace algorithm for the symmetric generalized eigenvalue problem. This method does not rely on shift-and-invert transformations for convergence acceleration, but rather a preconditioner is used. The algorithm suffers, however, in the presence of multiple or clustered eigenvalues. Also, it is only applicable to the location of extreme eigenvalues. In this work, we extend the method of Golub and Ye by developing a block generalization of their algorithm which enjoys considerably faster convergence than the usual method in the presence of multiplicities and clusters. Preconditioning techniques for the problems are discussed at length, and some insight is given into how these preconditioners accelerate the method. Finally we discuss a transformation which can be applied so that the algorithm extracts interior eigenvalues. A preconditioner based on a QR factorization with respect to the B-1 inner product is developed and applied in locating interior eigenvalues.

<p>This master thesis has been carried out on behalf of Volvo Construction Equipment. A front frame of an</p><p>articulated hauler should be analysed according to the Finite Element Method and vibration tests should be</p><p>made. The results from the experimental tests should be correlated with the analytical test results here using</p><p>MAC-values. These values will show if the FE-model represents the physical structure correctly.</p><p>Visualisations are made on both the experimental and analytical results to get a better understanding about the</p><p>eigenmodes of the frame.</p><p>The final results showed that the FE-model was not a match to the physical structure which the experimental</p><p>tests were made on. It should be noted that the final result only states the present situation. The CAD-model had</p><p>not been completed when this thesis was performed and therefore some deviation occurred in the results. Some</p><p>actions are needed in order to reach a better result and they are stated in this report. When they are made, the</p><p>results can be improved by following the work that has been done in this master thesis.</p>

This thesis is about high–dimensional problems considered under the so{called Kolmogorov condition. Hence, we consider research questions related to random matrices with p rows (corresponding to the parameters) and n columns (corresponding to the sample size), where p &gt; n, assuming that the ratio <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Csmall%5Cfrac%7Bp%7D%7Bn%7D" /> converges when the number of parameters and the sample size increase. We focus on the eigenvalue distribution of the considered matrices, since it is a well–known information–carrying object. The spectral distribution with compact support is fully characterized by its moments, i.e., by the normalized expectation of the trace of powers of the matrices. Moreover, such an expectation can be seen as a free moment in the non–commutative space of random matrices of size p x p equipped with the functional <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Csmall%20%5Cfrac%7B1%7D%7Bp%7DE%5BTr%5C%7B%5Ccdot%5C%7D%5D" />. Here, the connections with free probability theory arise. In the relation to that eld we investigate the closed form of the asymptotic spectral distribution for the sum of the quadratic forms. Moreover, we put a free cumulant–moment relation formula that is based on the summation over partitions of the number. This formula is an alternative to the free cumulant{moment relation given through non{crossing partitions ofthe set. Furthermore, we investigate the normalized <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Csmall%20E%5B%5Cprod_%7Bi=1%7D%5Ek%20Tr%5C%7BW%5E%7Bm_i%7D%5C%7D%5D" /> and derive, using the dierentiation with respect to some symmetric matrix, a recursive formula for that expectation. That allows us to re–establish moments of the Marcenko–Pastur distribution, and hence the recursive relation for the Catalan numbers. In this thesis we also prove that the <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Csmall%20%5Cprod_%7Bi=1%7D%5Ek%20Tr%5C%7BW%5E%7Bm_i%7D%5C%7D" />, where <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Csmall%20W%5Csim%5Cmathcal%7BW%7D_p(I_p,n)" />, is a consistent estimator of the <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Csmall%20E%5B%5Cprod_%7Bi=1%7D%5Ek%20Tr%5C%7BW%5E%7Bm_i%7D%5C%7D%5D" />. We consider <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Csmall%20Y_t=%5Csqrt%7Bnp%7D%5Cbig(%5Cfrac%7B1%7D%7Bp%7DTr%5Cbig%5C%7B%5Cbig(%5Cfrac%7B1%7D%7Bn%7DW%5Cbig)%5Et%5Cbig%5C%7D-m%5E%7B(t)%7D_1%20(n,p)%5Cbig)," />, where <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Csmall%20m%5E%7B(t)%7D_1%20(n,p)=E%5Cbig%5B%5Cfrac%7B1%7D%7Bp%7DTr%5Cbig%5C%7B%5Cbig(%5Cfrac%7B1%7D%7Bn%7DW%5Cbig)%5Et%5Cbig%5C%7D%5Cbig%5D" />, which is proven to be normally distributed. Moreover, we propose, based on these random variables, a test for the identity of the covariance matrix using a goodness{of{t approach. The test performs very well regarding the power of the test compared to some presented alternatives for both the high–dimensional data (p &gt; n) and the multivariate data (p ≤ n).

This dissertation investigates data reduction strategies from a signal processing perspective in centralized detection and estimation applications. First, it considers a deterministic source observed by a network of sensors and develops an analytical strategy for ranking sensor transmissions based on the magnitude of their test statistics. The benefit of the proposed strategy is that the decision to transmit or not to transmit observations to the fusion center can be made at the sensor level resulting in significant savings in transmission costs. A sensor network based on target tracking application is simulated to demonstrate the benefits of the proposed strategy over the unconstrained energy approach. Second, it considers the detection of random signals in noisy measurements and evaluates the performance of eigenvalue-based signal detectors. Due to their computational simplicity, robustness and performance, these detectors have recently received a lot of attention. When the observed random signal is correlated, several researchers claim that the performance of eigenvalue-based detectors exceeds that of the classical energy detector. However, such claims fail to consider the fact that when the signal is correlated, the optimal detector is the estimator-correlator and not the energy detector. In this dissertation, through theoretical analyses and Monte Carlo simulations, eigenvalue-based detectors are shown to be suboptimal when compared to the energy detector and the estimator-correlator.

Orientador: Eliana Xavier Linhares de Andrade / Banca: Roberto Andreani / Banca: Cleonice Fátima Bracciali / Resumo: O principal objetivo deste trabalho é apresentar, discutir as qualidades e desempenho e provar a convergência de um método iterativo para a solução numérica do problema de autovalores de uma matriz, que chamamos de Método Assemelhado ao de Francis (MAF). O método em questão distingue-se do QR de Francis pela maneira, mais simples e rápida, de se obter as matrizes ortogonais Qk, k = 1; 2. Apresentamos, também, uma comparação entre o MAF e os algoritmos QR de Francis e LR de Rutishauser. / Abstract: The main purpose of this work is to presente, to discuss the qualities and performance and to prove the convergence of an iterative method for the numerical solution of the eigenvalue problem, that we have called the Método Assemelhado ao de Francis (MAF)þþ. This method di ers from the QR method of Francis by providing a simpler and faster technique of getting the unitary matrices Qk; k = 1; 2; We present, also, a comparison analises between the MAF and the QR of Francis and LR of Rutishauser algorithms. / Mestre