This dissertation consists of three more or less independent projects. In the first project, we find the microstates free entropy dimension of a large class of L1[0; 1]{ circular operators, in the presence of a generator of the diagonal subalgebra. In the second one, for each sequence {cn}n in l1(N), we de fine an operator A in the hyper finite II1-factor R. We prove that these operators are quasinilpotent and they generate the whole hyper finite II1-factor. We show that they have non-trivial, closed, invariant subspaces affiliated to the von Neumann algebra, and we provide enough evidence to suggest that these operators are interesting for the hyperinvariant subspace problem. We also present some of their properties. In particular, we show that the real and imaginary part of A are equally distributed, and we find a combinatorial formula as well as an analytical way to compute their moments. We present a combinatorial way of computing the moments of A*A. Finally, let fTkg1k =1 be a family of *-free identically distributed operators in a finite von Neumann algebra. In this paper, we prove a multiplicative version of the Free Central Limit Theorem. More precisely, let Bn = T*1T*2...T*nTn...T2T1 then Bn is a positive operator and B1=2n n converges in distribution to an operator A. We completely determine the probability distribution v of A from the distribution u of jTj2. This gives us a natural map G : M M with u G(u) = v. We study how this map behaves with respect to additive and multiplicative free convolution. As an interesting consequence of our results, we illustrate the relation between the probability distribution v and the distribution of the Lyapunov exponents for the sequence fTkg1k=1 introduced by Vladismir Kargin.

This dissertation is primarily concerned with studying the invariant subspaces of left-invertible, weighted shifts, with generalizations to left-invertible operators where applicable. The two main problems that are researched can be stated together as When does a weighted shift have the one-dimensional wandering subspace property for all of its closed, invariant subspaces? This can fail either by having a subspace that is not generated by its wandering subspace, or by having a subspace with an index greater than one. For the former we show that every left-invertible, weighted shift is similar to another weighted shift with a residual space, with respect to being generated by the wandering subspace, of dimension $n$, where $n$ is any finite number. For the latter we derive necessary and sufficient conditions for a pure, left-invertible operator with an index of one to have a closed, invariant subspace with an index greater than one. We use these conditions to show that if a closed, invariant subspace for an operator in a class of weighted shifts has a vector in $l^1$, then it must have an index equal to one, and to produce closed, invariant subspaces with an index of two for operators in another class of weighted shifts. / Ph. D.

The existence and uniqueness of Lagrangian invariant subspaces of Hamiltonian matrices is studied. Necessary and sufficient conditions are given in terms of the Jordan structure and certain sign characteristics that give uniqueness of these subspaces even in the presence of purely imaginary eigenvalues. These results are applied to obtain in special cases existence and uniqueness results for Hermitian solutions of continuous time algebraic Riccati equations.

This thesis consists of four chapters. Chapter 1 contains the preliminaries. We give the background, notation and some results needed for this work, and we describe our main results of this thesis. In Chapter 2 we will introduce a class of weighted Bergman spaces. We then will discuss some properties about the multiplication operator, Mz , on them. We also characterize the dual spaces of these weighted Bergman spaces. In Chapter 3 we will characterize the reducing subspaces of multiple weighted shifts. The reducing subspaces of the Bergman and the Dirichlet shift of multiplicity N are portrayed from this characterization. In Chapter 4 we will introduce the class of super-isometrically dilatable operators and describe their elementary properties. We then will discuss an equivalent description of the invariant subspace lattice for the Bergman shift. We will also discuss the interpolating sequences on the bidisk. Finally, we will examine a special class of super-isometrically dilatable operators. One corollary of this work is that we will prove that the compression of the Bergman shift on two compliments of two invariant subspaces are unitarily equivalent if and only if the two invariant subspaces are equal. / Ph. D.

在這一篇論文中，我們討論 Ck/Cm/1 的等候系統。 我們利用矩陣多項式的奇異點及向量造 C_k/C_m/1 的機率分配的解空間。而矩陣多項式的非零奇異點和一個由抵達間隔時間與服務時間所形成的方程式有密切的關係。我們證明了在 E_k/E_m/1 的等候系統中，方程式的所有根都是相異的。但是當方程式有重根時，我們必須解一組相當複雜的方程式才能得到構成解空間的向量。此外，我們建立了一個描述飽和機率為 Kronecker products 線性組合的演算方法。 / In this thesis, we analyze the single server queueing system Ck/Cm/1. We construct a general solution space of the vector for stationary probability and describe the solution space in terms of singularities and vectors of the fundamental matrix polynomial Q(w). There is a relation between the singularities of Q(w) and the roots of the characteristic polynomial involving the Laplace transforms of the interarrival and service times distributions. In the Ek/Em/1 queueing system, it is proved that the roots of the characteristic polynomial are distinct if the arrival and service rates are real. When multiple roots occur, one needs to solve a set of equations of matrix polynomials. As a result, we establish a procedure for describing those vectors used in the expression of saturated probability as linear combination of Kronecker products.

The existence and uniqueness of Lagrangian invariant subspaces of Hamiltonian matrices is studied. Necessary and sufficient conditions are given in terms of the Jordan structure and certain sign characteristics that give uniqueness of these subspaces even in the presence of purely imaginary eigenvalues. These results are applied to obtain in special cases existence and uniqueness results for Hermitian solutions of continuous time algebraic Riccati equations.

This thesis concerns methods of reduced complexity for electronic structure calculations.  When quantum chemistry methods are applied to large systems, it is important to optimally use computer resources and only store data and perform operations that contribute to the overall accuracy. At the same time, precarious approximations could jeopardize the reliability of the whole calculation.  In this thesis, the self-consistent field method is seen as a sequence of rotations of the occupied subspace. Errors coming from computational approximations are characterized as erroneous rotations of this subspace. This viewpoint is optimal in the sense that the occupied subspace uniquely defines the electron density. Errors should be measured by their impact on the overall accuracy instead of by their constituent parts. With this point of view, a mathematical framework for control of errors in Hartree-Fock/Kohn-Sham calculations is proposed.  A unifying framework is of particular importance when computational approximations are introduced to efficiently handle large systems. An important operation in Hartree-Fock/Kohn-Sham calculations is the calculation of the density matrix for a given Fock/Kohn-Sham matrix. In this thesis, density matrix purification is used to compute the density matrix with time and memory usage increasing only linearly with system size. The forward error of purification is analyzed and schemes to control the forward error are proposed. The presented purification methods are coupled with effective methods to compute interior eigenvalues of the Fock/Kohn-Sham matrix also proposed in this thesis.New methods for inverse factorizations of Hermitian positive definite matrices that can be used for congruence transformations of the Fock/Kohn-Sham and density matrices are suggested as well. Most of the methods above have been implemented in the Ergo quantum chemistry program. This program uses a hierarchic sparse matrix library, also presented in this thesis, which is parallelized for shared memory computer architectures. It is demonstrated that the Ergo program is able to perform linear scaling Hartree-Fock calculations. / QC 20100908