Pythagorean Vectors and Rational Orthonormal Matrices

A Pythagorean vector is an integer vector having an integer 2-norm. Such vectors are closely related to Pythagorean n-tuples, since n-tuples are the building blocks for Pythagorean vectors. Pythagorean vectors are, in their turn, the building blocks for rational orthonormal matrices. The work in this thesis has a pedagogical application to the QR decomposition of matrices, widely used in Linear Algebra. A barrier for students learning the details of the QR decomposition of a given matrix A is the occurrence of square-roots that cannot be simplified during the application of the two standard algorithms, namely the Gram--Schmidt method and Householder transformations. This thesis studies Pythagorean vectors and their application to the construction of exercises and test questions in which a given matrix A can be factored into matrices Q and R, with all arithmetic operations resulting in rational quantities, free from square roots. This freedom from square roots applies to every step of the calculations, and not just the final result. As a preliminary to QR decomposition, the thesis explores the properties of Pythagorean vectors, including their generation for an arbitrary specified dimension. Pythagorean triples, which correspond to Pythagorean vectors of dimension 2, have been widely and enthusiastically studied in the literature, but higher dimensions have been less studied, and this thesis adds some new observations to previous studies

Rational Krylov for Stieltjes matrix functions: convergence and pole selection

Evaluating the action of a matrix function on a vector, that is $x=f(\mathcal M)v$, is an ubiquitous task in applications. When $\mathcal M$ is large, one usually relies on Krylov projection methods. In this paper, we provide effective choices for the poles of the rational Krylov method for approximating $x$ when $f(z)$ is either Cauchy-Stieltjes or Laplace-Stieltjes (or, which is equivalent, completely monotonic) and $\mathcal M$ is a positive definite matrix. Relying on the same tools used to analyze the generic situation, we then focus on the case $\mathcal M=I \otimes A - B^T \otimes I$, and $v$ obtained vectorizing a low-rank matrix; this finds application, for instance, in solving fractional diffusion equation on two-dimensional tensor grids. We see how to leverage tensorized Krylov subspaces to exploit the Kronecker structure and we introduce an error analysis for the numerical approximation of $x$. Pole selection strategies with explicit convergence bounds are given also in this case

Vector space framework for unification of one- and multidimensional filter bank theory

A number of results in filter bank theory can be viewed using vector space notations. This simplifies the proofs of many important results. In this paper, we first introduce the framework of vector space, and then use this framework to derive some known and some new filter bank results as well. For example, the relation among the Hermitian image property, orthonormality, and the perfect reconstruction (PR) property is well-known for the case of one-dimensional (1-D) analysis/synthesis filter banks. We can prove the same result in a more general vector space setting. This vector space framework has the advantage that even the most general filter banks, namely, multidimensional nonuniform filter banks with rational decimation matrices, become a special case. Many results in 1-D filter bank theory are hence extended to the multidimensional case, with some algebraic manipulations of integer matrices. Some examples are: the equivalence of biorthonormality and the PR property, the interchangeability of analysis and synthesis filters, the connection between analysis/synthesis filter banks and synthesis/analysis transmultiplexers, etc. Furthermore, we obtain the subband convolution scheme by starting from the generalized Parseval's relation in vector space. Several theoretical results of wavelet transform can also be derived using this framework. In particular, we derive the wavelet convolution theorem

A note on the index bundle over the moduli space of monopoles

Donaldson has shown that the moduli space of monopoles $M_k$ is diffeomorphic to the space \Rat_k of based rational maps from the two-sphere to itself. We use this diffeomorphism to give an explicit description of the bundle on \Rat_k obtained by pushing out the index bundle from $M_k$. This gives an alternative and more explicit proof of some earlier results of Cohen and Jones.Comment: 9 page

Parseval frames of exponentially localized magnetic Wannier functions

Motivated by the analysis of gapped periodic quantum systems in presence of a uniform magnetic field in dimension $d \le 3$, we study the possibility to construct spanning sets of exponentially localized (generalized) Wannier functions for the space of occupied states. When the magnetic flux per unit cell satisfies a certain rationality condition, by going to the momentum-space description one can model $m$ occupied energy bands by a real-analytic and $\mathbb Z^{d}$-periodic family $\{P({\bf k})\}_{{\bf k} \in \mathbb R^{d}}$ of orthogonal projections of rank $m$. A moving orthonormal basis of $\mathrm{Ran} P({\bf k})$ consisting of real-analytic and $\mathbb Z^d$-periodic Bloch vectors can be constructed if and only if the first Chern number(s) of $P$ vanish(es). Here we are mainly interested in the topologically obstructed case. First, by dropping the generating condition, we show how to algorithmically construct a collection of $m-1$ orthonormal, real-analytic, and periodic Bloch vectors. Second, by dropping the linear independence condition, we construct a Parseval frame of $m+1$ real-analytic and periodic Bloch vectors which generate $\mathrm{Ran} P({\bf k})$. Both algorithms are based on a two-step logarithm method which produces a moving orthonormal basis in the topologically trivial case. A moving Parseval frame of analytic, periodic Bloch vectors corresponds to a Parseval frame of exponentially localized composite Wannier functions. We extend this construction to the case of magnetic Hamiltonians with an irrational magnetic flux per unit cell and show how to produce Parseval frames of exponentially localized generalized Wannier functions also in this setting. Our results are illustrated in crystalline insulators modelled by $2d$ discrete Hofstadter-like Hamiltonians, but apply to certain continuous models of magnetic Schr\"{o}dinger operators as well.Comment: 40 pages. Improved exposition and minor corrections. Final version matches published paper on Commun. Math. Phy

Cyclic LTI systems in digital signal processing

Cyclic signal processing refers to situations where all the time indices are interpreted modulo some integer L. In such cases, the frequency domain is defined as a uniform discrete grid (as in L-point DFT). This offers more freedom in theoretical as well as design aspects. While circular convolution has been the centerpiece of many algorithms in signal processing for decades, such freedom, especially from the viewpoint of linear system theory, has not been studied in the past. In this paper, we introduce the fundamentals of cyclic multirate systems and filter banks, presenting several important differences between the cyclic and noncyclic cases. Cyclic systems with allpass and paraunitary properties are studied. The paraunitary interpolation problem is introduced, and it is shown that the interpolation does not always succeed. State-space descriptions of cyclic LTI systems are introduced, and the notions of reachability and observability of state equations are revisited. It is shown that unlike in traditional linear systems, these two notions are not related to the system minimality in a simple way. Throughout the paper, a number of open problems are pointed out from the perspective of the signal processor as well as the system theorist