We establish the upper bounds for the difference between the first two eigenvalues of the relative and absolute eigenvalue problems. Relative and absolute boundary conditions are generalization of Dirichlet and Neumann boundary conditions on functions to differential forms respectively. The domains are taken to be a family of symmetric regions in Rn consisting of two cavities joined by a straight thin tube. Our operators are Hodge Laplacian operators acting on k-forms given by the formula Δ(k) = dδ+δd, where d and δ are the exterior derivatives and the codifferentials respectively. A result has been established on Dirichlet case (0-forms) by Brown, Hislop, and Martinez [2]. We use the same techniques to generalize the results on exponential decay of eigenforms, singular perturbation on domains [1], and matrix representation of the Hodge Laplacian restricted to a suitable subspace [2]. From matrix representation, we are able to find exponentially small upper bounds for the difference between the first two eigenvalues.

Many recent research results have concluded that the multiple-input multiple-output (MIMO) wireless communication architecture is a promising approach to achieve high bandwidth efficiencies. MIMO wireless channels can be simply defined as a link for which both the transmitting and receiving ends are equipped with multiple antenna elements. This advanced communication technology has the potential to resolve the bottleneck in traffic capacity for future wireless networks. Applying MIMO techniques to mobile communication systems, the problem of channel fading between the transmitters and receivers, which results in received signal strength fluctuations, is inevitable. The time-varying nature of the mobile channel affects various aspects of receiver design. This thesis provides some analytical methodologies to investigate the variation of MIMO eigenmodes. Although the scope is largely focussed on the temporal variation in this thesis, our results are also extended to frequency variation. Accurate analytical approximations for the level crossing rate (LCR) and average fade duration (AFD) of the MIMO eigenmodes in an independent, identically distributed (i.i.d.) flat-fading channel are derived. Furthermore, since several channel metrics (such as the total power gain, eigenvalue spread, capacity and Demmel condition number) are all related to the eigenmodes, we also derive their LCRs and AFDs using a similar approach. The effectiveness of our method lies in the fact that the eigenvalues and corresponding channel metrics can be well approximated by gamma or Gaussian variables. Our results provide a comprehensive, closed-form analysis for the temporal behavior of MIMO channel metrics that is simple, robust and rapid to compute. An alternative simplified formula for the LCR for MIMO eigenmodes is also presented with applications to different types of autocorrelation functions (ACF). Our analysis has been verified via Monte Carlo computer simulations. The joint probability density function (PDF) for the eigenvalues of a complex Wishart matrix and a perturbed version of it are also derived in this thesis. The latter version can be used to model channel estimation errors and variations over time or frequency. Using this PDF, the probabilities of adaptation error (PAE) due to feedback delay in some adaptive MIMO schemes are evaluated. In particular, finite state Markov chains (FSMC) have been used to model rate-feedback system and dual-mode antenna selection schemes. The PDF is also applied to investigate MIMO systems that merge singular value decomposition (SVD)-based transceiver structure and adaptive modulation. A FSMC is constructed to investigate the modulation state entering rates (MSER), the average stay duration (ASD), and the effects of feedback delay on the accuracy of modulation state selection in mobile radio systems. The system performance of SVD-based transceivers is closely related to the quality of the channel information at both ends of the link. Hence, we examine the effect of feedback time delay, which causes the transmitter to use outdated channel information in time-varying fading channels. In this thesis, we derive an analytical expression for the instantaneous signal to interference plus noise ratio (SINR) of eigenmode transmission with a feedback time delay. Moreover, this expression implies some novel metrics that gauge the system performance sensitivity to time-variations of the steering vectors (eigenvectors of the channel correlation matrix) at the transmitter. Finally, the fluctuation of the channel in the frequency domain is of interest. This is motivated by adaptive orthogonal frequency division multiplexing (OFDM) systems where the signalling parameters per subcarriers are assigned in accordance with some channel quality metrics. A Gaussian distribution has been suggested to approximate the number of subcarriers using certain signalling modes (such as outage/transmission and diversity/multiplexing), as well as the total data rates, per OFDM realization. Additionally, closed-form LCRs for the channel gains (including the individual eigenmode gains) over frequency are also derived for both single-input single-output (SISO) and MIMO-OFDM systems. The corresponding results for the average fade bandwidth (AFB) follow trivially, These results may be useful for system design, for example by calculating the feedback overheads based on subcarrier aggregation.

An n × n sign pattern A is potentially stable (PS) if there exists a real matrix A having the sign pattern A and with all its eigenvalues having negative real parts. The identification of non-trivial necessary and sufficient conditions for potential stability remains a long standing open problem. Here we review some of the previous results and give simplified proofs for some of these results. Three techniques are given for the construction of larger order PS sign patterns from given PS sign patterns. These techniques are: construction of a sign pattern that allows a nested sequence of properly signed principal minors (a nest), bordering of a PS sign pattern with additional rows and columns, and use of a similarity transformation of a matrix that is reducible with two diagonal blocks (one of which is a stable matrix and the other a negative scalar). The minimum number of nonzero entries in an irreducible minimally PS sign pattern is determined for n = 2, . . . , 6 and for an arbitrary sign pattern that allows a nest. We also determine lower bounds for the number of nonzero entries in irreducible minimally PS sign patterns having certain sign patterns for their diagonal entries. For irreducible PS sign patterns of order at least four, a bordering construction leads to a new upper bound for the minimum number of nonzero entries.

In this paper, the coarse mesh transport method is extended to hexagonal geometry. This stochastic-deterministic hybrid transport method calculates the eigenvalue and explicit pin fission density profile of hexagonal reactor cores. It models the exact detail within complex heterogeneous cores without homogenizing regions or materials, and neither block-level nor core-level asymmetry poses any limitations to the method. It solves eigenvalue problems by first splitting the core into a set of coarse meshes, and then using Monte Carlo methods to create a library of response expansion coefficients, found by expanding the angular current in phase-space distribution using a set of polynomials orthogonal on the angular half-space defined by mesh boundaries. The coarse meshes are coupled by the angular current at their interfaces. A deterministic sweeping procedure is then used to iteratively construct the solution. The method is evaluated using benchmark problems based on a gas-cooled, graphite-moderated high temperature reactor. The method quickly solves problems to any level of detail desired by the user. In this paper, it is used to explicitly calculate the fission density of individual fuel pins and determine the reactivity worth of individual control rods. In every case, results for the core multiplication factor and pin fission density distribution are found within several minutes. Results are highly accurate when compared to direct Monte Carlo reference solutions; errors in the eigenvalue calculations are on the order of 0.02%, and errors in the pin fission density average less than 0.1%.

Thesis (Ph. D.)--University of Texas at Austin, 2004. / Supervisors: Tomio Petrosky and E.C.G. Sudarshan. Vita. Includes bibliographical references.

Excluídos problemas simples de condução de calor nos quais a temperatura depende apenas do tempo ou apenas de uma coordenada de posição, os demais levam a equações diferenciais parciais, as quais tem soluções em termos de séries obtidas de vários métodos como a separação de variáveis, a superposição, a função de Green, a técnica da transformada integral, a transformada de Laplace e o teorema de Duhamel. Estas soluções dependem de autovalores que são obtidos das raízes de equações transcendentais que na maioria dos casos não podem ser expressas em forma fechada, mas podem ser obtidas de tabelas, expressões aproximadas, e expressões iterativas. O objetivo desse estudo é encontrar novas expressões para estas raízes, que sejam mais simples ou que tenham mais exatidão do que as já existentes. As três equações transcendentais que são consideradas aqui são as mais frequentemente utilizadas entre as que não tem solução fechada, e surgem quando as condições de contorno são convectivas. Uma nova família de funções iterativas é obtida, a qual inclui várias funções clássicas e, em particular, toda a família de métodos de Householder. Um novo método obtido é o que tem convergência mais rápida para as presentes equações. Apesar das tabelas de raízes apresentarem valores com vários dígitos significativos, problemas reais dificilmente levam a um valor da variável independente que pode ser diretamente encontrado, tornando-se necessário o uso de interpolação. Então, a exatidão de raízes obtidas por estas tabelas é limitada pela exatidão da interpolação, a qual pode ser comparada com a das expressões aproximadas. As expressões existentes são analisadas utilizando propriedades das raízes. Uma expressão aproximada desenvolvida para a primeira raiz das três equações é baseada no método do ponto fixo, outra é obtida da aplicação do conceito de MiniMax para se reajustar expressões de outros autores, e uma final tem forma algébrica. O conceito de MiniMax não é obtido através de algum método que possa ser considerado elementar, e dois novos métodos são desenvolvidos para aplicá-lo. Modernos sistemas algébricos computacionais são utilizados para gerar novas expressões aproximadas para a primeira raiz, mas encontrou-se que elas podem ser melhoradas através de métodos analíticos. Expansão em frações contínuas e novamente a aproximação de Padé são utilizadas para se obter expressões de grande exatidão. Expressões que levam a bons resultados para a primeira raiz são generalizadas para que elas sirvam para as demais raízes. Finalmente, uma comparação é feita considerando todas expressões aproximadas, indicando quais são consideradas as melhores. / Apart from simple problems of heat conduction in which the temperature depends only on the time or just on a position coordinate, the others lead to partial differential equations, which have solutions in terms of series obtained from various methods such as separation variables, superposition, the Green's function, the technique of integral transform, the Laplace transform and Duhamel's theorem. These solutions depend on eigenvalues, which are obtained from the roots of transcendental equations that in most cases cannot be expressed in closed form, but they can be obtained from tables, approximate expressions and iterative expressions. The objective of this study is to find new expressions for these roots, which are simpler or have more accuracy than the existing ones. The three transcendental equations that are considered here are the most frequently used among those that have not closed solution, and appear when the boundary conditions are convective. A new family of iterative functions is proposed, which includes several classical functions and, in particular, the entire family of Householder methods. A new method is obtained which has faster convergence to the present equations. Although the tables of roots present values with various significant digits, real problems hardly lead to a value of the independent variable that can be directly found, making it necessary to use interpolation. Then, the accuracy of the roots obtained from these tables is limited by the accuracy of the interpolation, which can be compared with the approximate expressions. Existing expressions are analyzed using the root properties. An approximate expression developed for the first root of the three equations is based on the fixed point method, another is obtained from the application of the concept of MiniMax to readjust expressions of others authors, and the last one has an algebraic form. The MiniMax concept is not obtained through any method that can be considered elementary, and two new methods are developed to apply it. Modern computer algebra systems are used to generate new approximate expressions for the first root, but it is found that they can be improved by analytical methods. Expansion in continuous fractions is adopted and the Padé approximation to obtain expressions of greater accuracy. Expressions leading to good results for the first root are generalized so that they serve for the other roots. Finally, a comparison is made considering all approximate expressions, indicating what are considered the best.

This thesis presents principal components as a useful tool for data dimensio- nality reduction. In the first part, the basic terminology and theoretical properties of principal components are described and a biplot construction is derived there as well. Besides, heuristic methods for a choice of the optimum number of prin- cipal components are summarised there. Subsequently, asymptotical properties of sample eigenvalues of covariance and white Wishart matrices are described and cases of equality of some eigenvalues are distinguished at the same time. In the second part of the thesis, asymptotic distribution of the largest eigenva- lue of white Wishart matrices is described, completed with graphic illustrations. A test of the number of significant eigenvalues is suggested on the basis of this limiting distribution, and the connection of this test to the number of suitable principal components is presented. The final part of the thesis provides an over- view of advanced computational methods for the choice of an adequate number of principal components. The thesis is completed with graphical illustrations and a simulation study using Wolfram Mathematica and R.

Propriedades do primeiro autovalor e da primeira autofunção do operador laplaciano em variedades riemannianas são estudadas. Para variedades em que se pode estimar o laplaciano de funções distância, estimativas explícitas para o primeiro autovalor do laplaciano em domínios duplamente conexos são obtidas. Então observamos que hipóteses sobre as curvaturas da variedade e do bordo do domínio permitem estimar o laplaciano da distância. Além disso, autofunções em domínios não compactos do espaço hiperbólico EI" são estudadas. Mostramos que donn'nios contidos em horobolas não admitem autofunções limitadas associadas ao autovalor A(HIn), mas se o fecho assintótico do domínio contém um aberto de (9ooIHIn, então ele admite uma autofunção positiva que se anula em dfí U dooQ. A existência e o perfil de autofunções de autovalor A(IHI") em EI", em IHIn\Sr(o), em horobolas, em hiperbolas e no complementar de horobolas são analisados. Para alguns desses domínios apresentamos uma expressão explícita para a autofunção que depende apenas da distância à fronteira. Finalmente, técnicas de simetrização de Schwarz são adaptadas para variedades permitindo-nos obter estimativas para normas de autofunções. Primeiro um argumento de comparação demonstra que variedades mais simétricas maximizam certas normas. Obtenios também uma estimativa diretamente da função isoperimétrica da variedade. / Some properties of the first eigenvalue A and the first eigenfunction of the Laplace operator in a Riemannian manifold are studied. Assuming a bound for the Laplacian of the distance function, exphcit estimates for the first eigenvalue of a doubly counected domain are presented. Then some assumptions on the curvatures of the manifold and its boundary are made in order to have an estimate for the Laplacian of the distance function. Furthermore eigenfunctions of non compact domains in the hyperbohc space EIn are studied. We prove that a domain contained in a horoball does not admit a bounded eigenfunction of eigenvalue A(lHIn), but if the closure of the domain contains an open set of then it admits a positive eigenfunction that vanishes on dQ U daoíl. The existence and the profile of eigenfunctions of eigenvalue A(E[n ) in H71, in H [ r i \ 5 r ( o ) , in horoballs, hiperballs and in the complement of a horoball are analysed. For some of these domains we present an explicit expression for the eigenfunction that depends only on the distance to the boundary. Finally Schwarz symmetrization techniques are adapted for manifolds implying in estimates for the norm of the eigenfunctions. First a comparison argument proves that highly symmetric manifolds maximize some norm and then an estimated obtained directly from the isoperimetric function of the manifold is presented.

In the first part of this thesis, we study critical points of random polynomials. We choose two deterministic sequences of complex numbers, whose empirical measures converge to the same probability measure in complex plane. We make a sequence of polynomials whose zeros are chosen from either of sequences at random. We show that the limiting empirical measure of zeros and critical points agree for these polynomials. As a consequence we show that when we randomly perturb the zeros of a deterministic sequence of polynomials, the limiting empirical measures of zeros and critical points agree. This result can be interpreted as an extension of earlier results where randomness is reduced. Pemantle and Rivin initiated the study of critical points of random polynomials. Kabluchko proved the result considering the zeros to be i.i.d. random variables. In the second part we deal with the spectrum of products of Ginibre matrices. Exact eigenvalue density is known for a very few matrix ensembles. For the known ones they often lead to determinantal point process. Let X1, X2,..., Xk be i.i.d Ginibre matrices of size n ×n whose entries are standard complex Gaussian random variables. We derive eigenvalue density for matrices of the form X1 ε1 X2 ε2 ... Xk εk , where εi = ±1 for i =1,2,..., k. We show that the eigenvalues form a determinantal point process. The case where k =2, ε1 +ε2 =0 was derived earlier by Krishnapur. In the case where εi =1 for i =1,2,...,n was derived by Akemann and Burda. These two known cases can be obtained as special cases of our result.

Made available in DSpace on 2014-06-11T19:24:45Z (GMT). No. of bitstreams: 0 Previous issue date: 2005-09-08Bitstream added on 2014-06-13T18:52:36Z : No. of bitstreams: 1 silva_nr_me_botfca.pdf: 603039 bytes, checksum: 4acd5387f9aeb3ee2adb6a3405b329e6 (MD5) / Os experimentos agronômicos, em geral, apresentam uma quantidade razoável de variáveis observadas e uma complexa estrutura de variação entre e dentro dessas variáveis. Essa estrutura de variação acarreta uma dificuldade para a utilização dos procedimentos requeridos pelo modelo estatístico, em virtude do difícil acesso a programas computacionais para a análise dos dados multivariados. Uma alternativa para redimensionar a quantidade de variáveis consiste na técnica dos componentes principais, que consegue descrever um conjunto com um número menor de variáveis não correlacionadas entre si, ordenadas de maneira decrescente pelas magnitudes das variâncias, de tal forma que a variância total do conjunto inicial seja preservada. Em síntese, a prática da análise de componentes principais é considerada sob o objetivo da redução do espaço paramétrico. Uma das dificuldades encontrada pelos pesquisadores no uso da técnica dos componentes principais, consiste na determinação do número de componentes que deve ser utilizado na redução do espaço paramétrico. Dentre alguns métodos exploratórios discutidos foram apresentados quatro critérios para a escolha do número de componentes principais os quais retem de forma qualificada, a informação contida nas variáveis originais. Neste sentido, foi proposto no presente estudo, a elaboração de um programa computacional, desenvolvido em linguagem MAPLE V.3 e CLIPPER 5.1, de fácil manuseio e acessível a todos os pesquisadores das áreas agronômicas. Visando a operacionalização do aplicativo e a utilização dos procedimentos de análise multivariada, finalizou-se o estudo apresentando dois exemplos envolvendo situações observadas na literatura agronômica, onde no primeiro faz-se uma abordagem pela metodologia univariada e pela utilização de componentes principais por processo gráfico, e no segundo... / The agronomical experiments, in general, introduce a reasonable quantity of observed variables and a variation complex structure between and within these variables. This variation structure carries a difficulty for the utilization of the procedures required by the statistical model, in view of the difficult access for computational programs for the analysis of the multivariate data. An option for redimensionate the quantity of variable consists in the technique of the principal components, which manages to describe a set with a smaller number of variable not correlated to each other, ordenate of decreasing way by the magnitudes of the variances, of such a form that the total variance of the initial set be preserved. In synthesis, the practice of the analysis of principal components is considered under the objective of the reduction of the parametric space. One of the difficulties found by the researchers in the use of the technique of the principal components, it consists in the determination of the number of components that should be used in the reduction of the parametric space. Among some argued exploratory methods were introduced four criteria for the choice of the number of principal components the ones retain of form qualified, the information contained in the original variables. In this sense, it was proposed at study present, the elaboration of a computational program, developed in language MAPLE V.3 and CLIPPER 5.1, of easy handling and accessible to all the researchers of the agronomical areas. Aiming at operationalization of the application and the utilization of the multivariate analysis procedures, it was concluded the study introducing two examples involving situations observed in the agronomical literature, where in the first an approach is done by the univariate methodology and by the utilization of principal components for prosecute graph, and in the second... (Complete abstract click electronic access below)