Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 29 for “"Toeplitz matrices"”.
-
Numerical methods for Toeplitz matrices / by Douglas Robin Sweet
Typescript (photocopy)
-
Normal approximants for certain toeplitz matrices and toeplitz operators
… the normal approximation problem for certain Toeplitz matrices and Toeplitz operators, with respect to the operator norm. For upper triangular Toeplitz matrices, we exh1b1t a natural normal approximant, and show that it is a best normal approximant in certain fundamental cases. In other cases, …
-
Discrete time- and band-limited functions and Toeplitz matrices
Includes bibliographical references (pages 94-96).
-
High-performance algorithms to solve Toeplitz and block Toeplitz matrices
Fast algorithms to factor Toeplitz matrices have existed since the beginning of this century. The two most notable algorithms to factor Toeplitz matrices are the Schur and the Levinson-Durbin. The former factors the Toeolitz matrix itself while the latter factors the inverse. In this thesis, we …
-
Structured linear algebra problems and applications to system identification
… rank estimation and conditioning for structured matrices. The ideas are developed with attention to potential applications in control and signal processing where such matrices arise routinely. A stability result for the factorization of the broad class of positive definite Toeplitz-like matrices …
-
Aspects of Toeplitz operators and matrices : asymptotics, norms, singular values
… distinct parts. The rst chapter deals with block Toeplitz operators de ned by rational matrix function symbols on discrete sequence spaces. Here we study sequences of operators that converge to the inverses of these Toeplitz operators via an invertibility result involving a special representation …
-
Discrete approximations of differential operators by Sinc methods
… Sinc methods. This leads into the areas of Sinc matrices and, more generally, Toeplitz matrices. In the first part of the dissertation, we explore the Sine matrices [special characters omitted] used to approximate derivative operators and their properties as a subset of skew-symmetric Toeplitz …
-
Galois Groups of Schubert Problems
… the tensor product as the action of certain Toeplitz matrices and using spectral analysis, the inequality can be rewritten as an integral. We establish the inequality by estimating this integral using only elementary Calculus.
-
Multiphysics Design and Modeling for Advanced Packaging and Heterogeneous Integration of Power Delivery
… approach with Fourier series–based Toeplitz matrices. This method provides a unified framework for transient electrical simulations and steady-state thermo-mechanical analysis, representing time-varying system elements in the frequency domain to improve stability and efficiency. To …
-
Efficient solutions to Toeplitz-structured linear systems for signal processing
… for linear systems with scalar and multi-level Toeplitz structure. Toeplitz systems are common in one-dimensional signal-processing applications, and typically correspond to temporal- or spatial-invariance in the underlying physical phenomenon. Over time, a number of algorithms have been …
-
Classification of Multivariate Time Series Using Covariance Structures : Applications to EEG data
… of symmetric positive definite (SPD) covariance matrices and affine-invariant Riemannian (AIR) geometry is a state-of-the-art approach for decoding motor imagery (MI) electroencephalography (EEG) data. However, standard covariance matrices capture only spatial correlations while discarding …
-
Compressive system identification (CSI): theory and applications of exploiting sparsity in the analysis of high-dimensional dynamical systems
… block-sparse signals) and structured measurement matrices (e.g., Toeplitz matrices) where the structure is implied by the system under study.
-
Authentication protocols in pervasive computing
… We propose several digest constructions using Toeplitz matrices, integer multiplication and pseudorandom numbers. The application of digest functions leads us to develop more efficient alternatives to standard digital signatures.</p> <p>Our protocol security analysis leads to a new bound on the …
-
Mirror symmetry, tropical geometry and representation theory
… of ideal fillings and factorisations of Toeplitz matrices into simple root subgroups.<br/><br/><br/>
-
Convolutive Blind Sparse Source Separation with Application to EMG Decomposition
… isometry property (RIP) of measurement or mixing matrices is a promising approach to guarantee the unique solution in compressed sensing methods. In convolutive source separation, mixing matrices have banded block Toeplitz structure. Therefore, the analytical RIP bound for banded block Toeplitz …
-
Coded approaches for straggler-resilient distributed matrix computations: Numerical stability, sparsity and leveraging partial computations
… are assigned the job of processing encoded submatrices of the original matrices. These works utilize concepts from erasure coding to mitigate the effect of stragglers by running “coded” copies of tasks comprising a job; stragglers are typically treated as erasures. However much of prior work in …
-
Preconditioning for Toeplitz-related systems
<p>This thesis concerns preconditioning for Toeplitz-related systems. Specifically, we consider functions of Toeplitz matrices, i.e. <em>h</em>(<em>T</em><sub>n</sub>)x<sub>n</sub>=b<sub>n</sub>, where <em>h</em>(<em>z</em>) is an analytic function and <em>T</em><sub>n</sub>ϵℂ<sup>n×n</sup> is …
-
Fast order-recursive Hermitian Toeplitz eigenspace techniques for array processing
… dissertation presents a fast Recursive/Iterative Toeplitz (Hermitian) Eigenspace (RITE) algorithm, and its extension to the generalized strongly regular eigendecomposition situation (C-RITE). Both procedures exhibit highly parallel structures, and their applicability to fast passive array …
-
Using and saving randomness
… various almost universal hash families including Toeplitz matrices, Linear Congruential Hash, and Multiplicative Universal Hash, this approach significantly improves the upper bound on the degree of strong extractors in these hash families. Then we consider explicit hash families and …
Page 1 of 2