In this thesis, we consider the question of describing the eigenvalues of a distinguished family of invariant differential operators associated to a Lie superalgebra g and a g-module W, called the "Capelli basis", via evaluation of certain classes of supersymmetric functions, called the interpolation super Jack polynomials. Finding the eigenvalues of the Capelli basis is referred to the Capelli Eigenvalue Problem. The eigenvalue formula depends on the chosen parametrization of the highest weight vectors in the decomposition of the superpolynomial algebra P(W), and consequently on the choice of a Borel subalgebra. In this thesis, we give a solution for each conjugacy class of Borel subalgebras, which we call a refined solution to the Capelli Eigenvalue Problem. Given the pair (g, W), we investigate the formulae for the eigenvalues of the Capelli operators associated to the completely reducible and multiplicity-free modules for two cases: diagonal and symmetric cases. In the former case, we show that we can express the eigenvalue of the Capelli operator on the irreducible component of the multiplicity-free decomposition of P(W) as a polynomial function of the b-highest weight of the irreducible component for any Borel subalgebra b. In the latter case, we show with a concrete counterexample that we cannot expect the results to be as strong as in the first case for all Borel subalgebras. We then express the eigenvalue of the Capelli operator on the irreducible component of the multiplicity-free decomposition of P(W) as a polynomial function of a piecewise affine map on the span of b-highest weights of the irreducible submodules of P(W), with respect to different decreasing Borel subalgebras b.

This thesis demonstrates an efficient parallel method of solving the generalized eigenvalue problem, KΦ = M ΦΛ, where K is symmetric and M is symmetric positive-definite, by first converting it to a standard eigenvalue problem, solving the standard eigenvalue problem, and back-transforming the results. An abstraction for parallel dense linear algebra is introduced along with a new algorithm for forming A := U⁻ᵀ K U⁻¹ , where U is the Cholesky factor of M , that is up to twice as fast as the ScaLAPACK implementation. Additionally, large improvements over the PBLAS implementations of general matrix-matrix multiplication and triangular solves with many right-hand sides are shown. Significant performance gains are also demonstrated for Cholesky factorizations, and a case is made for using 2D-cyclic distributions with a distribution blocksize of one. / text

A method that can be used to detect damage in structures is developed. This method is based on the convexity of the geometric interpretation of the eigenvalue problem for undamped positive definite systems. The damage detection scheme establishes various damage scenarios which are used as failure sets. These scenarios are then compared to the structure's actual response by measuring the natural frequencies of the structure and using a Euclideian norm. Mathematical models were developed for application of the method on a cantilever beam. Damage occurring at a single location or in multiple locations was estalished and studied. Experimental verification was performed on serval prismatic beams in which the method provided adequate results. The exact location and extent of damage for several cases was predicted. When the method failed the prediction was very close to the actual condition in the structure. This method is easy to use and does not require a rigorous amount of instrumentation for obtaining the experimental data required in the detection scheme. / Ph. D.

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 this paper, Kac received both the Lester Ford Award and the Chauvant Prize of the Mathematical Association of America. This problem has received a great deal of attention in the past forty years and has led to similar questions in completely different contexts such as “Can one hear the shape of a graph associated with the Schrödinger operator?”, “Can you hear the shape of your throat?”, “Can you feel the shape of a manifold with Brownian motion?”, “Can one hear the crack in a beam?”, “Can one hear into the sun?”, etc. Each of these topics deals with inverse eigenvalue problems or related inverse problems. For inverse problems in general, the problem may or may not have a solution, the solution may not be unique, and the solution does not necessarily depend continuously on perturbation of the data. For example, in the case of the drum, it has been shown that the answer to Kac’s question in general is “no.” However, if we restrict the class of drums, then the answer can be yes. This is typical of inverse problems when a priori information and restriction of the class of admissible solutions and/or data are used to make the problem well-posed. This thesis provides an analysis of shapes for which the answer to Kac's question is positive and a variety of interesting questions on this problem and its variants, including cases that remain open. This thesis also provides a synopsis and perspectives of other types of “can one hear” problems mentioned above. Another part of this thesis deals with aspects of direct problems related to musical instruments.

O objetivo desta dissertação é estudar o problema de autovalor de Dirichlet para variedades riemannianas completas. Mais precisamente, pretendemos estudar uma cota por baixo para o -ésimo autovalor de um domínio limitado em uma variedade riemanniana completa. Tal cota é obtida fazendo-se uso de uma fórmula de recorrência de Cheng e Yang e um teorema de Nash. Ademais, pretendemos estudar uma desigualdade universal para os autovalores no espaço hiperbólico. / The goal of this dissertation is to study the Dirichlet eigenvalue problem for a complete riemannian manifold. More accurately, we intend to investigate a lower-bound for the -ℎ eigenvalue on a bounded domain in a complete riemannian manifold. Such a bound is obtained by making use of a recursion formula of Cheng and Yang and Nash’s Theorem. Furthermore, we study a universal inequality for eigenvalues of the Dirichlet eigenvalue problem on a bounded domain in a hyperbolic space (−1).

O objetivo desta dissertação é estudar o problema de autovalor de Dirichlet para variedades riemannianas completas. Mais precisamente, pretendemos estudar uma cota por baixo para o -ésimo autovalor de um domínio limitado em uma variedade riemanniana completa. Tal cota é obtida fazendo-se uso de uma fórmula de recorrência de Cheng e Yang e um teorema de Nash. Ademais, pretendemos estudar uma desigualdade universal para os autovalores no espaço hiperbólico. / The goal of this dissertation is to study the Dirichlet eigenvalue problem for a complete riemannian manifold. More accurately, we intend to investigate a lower-bound for the -ℎ eigenvalue on a bounded domain in a complete riemannian manifold. Such a bound is obtained by making use of a recursion formula of Cheng and Yang and Nash’s Theorem. Furthermore, we study a universal inequality for eigenvalues of the Dirichlet eigenvalue problem on a bounded domain in a hyperbolic space (−1).

O objetivo desta dissertação é estudar o problema de autovalor de Dirichlet para variedades riemannianas completas. Mais precisamente, pretendemos estudar uma cota por baixo para o -ésimo autovalor de um domínio limitado em uma variedade riemanniana completa. Tal cota é obtida fazendo-se uso de uma fórmula de recorrência de Cheng e Yang e um teorema de Nash. Ademais, pretendemos estudar uma desigualdade universal para os autovalores no espaço hiperbólico. / The goal of this dissertation is to study the Dirichlet eigenvalue problem for a complete riemannian manifold. More accurately, we intend to investigate a lower-bound for the -ℎ eigenvalue on a bounded domain in a complete riemannian manifold. Such a bound is obtained by making use of a recursion formula of Cheng and Yang and Nash’s Theorem. Furthermore, we study a universal inequality for eigenvalues of the Dirichlet eigenvalue problem on a bounded domain in a hyperbolic space (−1).

No description available.

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.

This thesis studies the so-called “criticality problem”, an important generalised eigenvalue problem arising in neutron transport theory. The smallest positive real eigenvalue of the problem contains valuable information about the status of the fission chain reaction in the nuclear reactor (i.e. the criticality of the reactor), and thus plays an important role in the design and safety of nuclear power stations. Because of the practical importance, efficient numerical methods to solve the criticality problem are needed, and these are the focus of this thesis. In the theory we consider the time-independent neutron transport equation in the monoenergetic homogeneous case with isotropic scattering and vacuum boundary conditions. This is an unsymmetric integro-differential equation in 5 independent variables, modelling transport, scattering, and fission, where the dependent variable is the neutron angular flux. We show that, before discretisation, the nonsymmetric eigenproblem for the angular flux is equivalent to a related eigenproblem for the scalar flux, involving a symmetric positive definite weakly singular integral operator(in space only). Furthermore, we prove the existence of a simple smallest positive real eigenvalue with a corresponding eigenfunction that is strictly positive in the interior of the reactor. We discuss approaches to discretise the problem and present discretisations that preserve the underlying symmetry in the finite dimensional form. The thesis then describes methods for computing the criticality in nuclear reactors, i.e. the smallest positive real eigenvalue, which are applicable for quite general geometries and physics. In engineering practice the criticality problem is often solved iteratively, using some variant of the inverse power method. Because of the high dimension, matrix representations for the operators are often not available and the inner solves needed for the eigenvalue iteration are implemented by matrix-free inneriterations. This leads to inexact iterative methods for criticality computations, for which there appears to be no rigorous convergence theory. The fact that, under appropriate assumptions, the integro-differential eigenvalue problem possesses an underlying symmetry (in a space of reduced dimension) allows us to perform a systematic convergence analysis for inexact inverse iteration and related methods. In particular, this theory provides rather precise criteria on how accurate the inner solves need to be in order for the whole iterative method to converge. The theory is illustrated with numerical examples on several test problems of physical relevance, using GMRES as the inner solver. We also illustrate the use of Monte Carlo methods for the solution of neutron transport source problems as well as for the criticality problem. Links between the steps in the Monte Carlo process and the underlying mathematics are emphasised and numerical examples are given. Finally, we introduce an iterative scheme (the so-called “method of perturbation”) that is based on computing the difference between the solution of the problem of interest and the known solution of a base problem. This situation is very common in the design stages for nuclear reactors when different materials are tested, or the material properties change due to the burn-up of fissile material. We explore the relation ofthe method of perturbation to some variants of inverse iteration, which allows us to give convergence results for the method of perturbation. The theory shows that the method is guaranteed to converge if the perturbations are not too large and the inner problems are solved with sufficiently small tolerances. This helps to explain the divergence of the method of perturbation in some situations which we give numerical examples of. We also identify situations, and present examples, in which the method of perturbation achieves the same convergence rate as standard shifted inverse iteration. Throughout the thesis further numerical results are provided to support the theory.