Global ETD Search

121	Bounding the Norm of Matrix Powers Dowler, Daniel Ammon 05 July 2013 (has links) (PDF) In this paper I investigate properties of square complex matrices of the form Ak, where A is also a complex matrix, and k is a nonnegative integer. I look at several ways of representing Ak. In particular, I present an identity expressing the kth power of the Schur form T of A in terms of the elements of T, which can be used together with the Schur decomposition to provide an expression of Ak. I also explain bounds on the norm of Ak, including some based on the element-based expression of Tk. Finally, I provide a detailed exposition of the most current form of the Kreiss Matrix Theorem. Matrix Powers Matrix Norm Bounds Matrix Power Bounds Kreiss Matrix Theorem Schur Decomposition Schur Form Mathematics
122	A Simplified Improvement on the Design of QO-STBC Based on Hadamard Matrices Anoh, Kelvin O.O., Abd-Alhameed, Raed, Dama, Yousef A.S., Jones, Steven M.R. 01 1900 (has links) Yes / In this paper, a simplified approach for implementing QO-STBC is presented. It is based on the Hadamard matrix, in which the scheme exploits the Hadamard property to attain full diversity. Hadamard matrix has the characteristic that diagonalizes a quasi-cyclic matrix and decoding matrix that are diagonal matrix permit linear decoding. Using quasi-cyclic matrices in designing QO-STBC systems require that the codes should be rotated to reasonably separate one code from another such that error floor in the design can be minimized. It will be shown that, orthogonalizing the secondary codes and then imposing the Hadamard criteria that the scheme can be well diagonalized. The results of this simplified approach demonstrate full diversity and better performance than the interference-free QO-STBC. Results show about 4 dB gain with respect to the traditional QO-STBC scheme and performs alike with the earlier Hadamard based QO-STBC designed with rotation. These results achieve the consequent mathematical proposition of the Hadamard matrix and its property also shown in this study. QO-STBC Hadamard matrix
123	CROSS LAYER OPTIMIZATIONS FOR PERFORMANCE ENHANCEMENT IN WIRELESS NETWORKS AHUJA, DISHA 18 April 2008 (has links) No description available. Multipacket Reception MPR matrix
124	The design of active circulators Lamb, Larry Lee January 1980 (has links) No description available. Admittance Matrix Formulation Circulator
125	Matrix Variate and Kernel Density Methods for Applications in Telematics Pocuca, Nikola January 2019 (has links) In the last few years, telemetric data arising from embedded vehicle sensors brung an overwhelming abundance of information to companies. There is no indication that this will be abated in future. This information concerning driving behaviour brings an opportunity to carry out analysis. The merging of telemetric data and informatics gives rise to a sub-field of data science known as telematics. This work encompasses matrix variate and kernel density methods for the purposes of analysing telemetric data. These methods expand the current literature by alleviating the issues that arise with high-dimensional data. / Thesis / Master of Science (MSc) telematics, matrix variate
126	Effect of water vapor on the high temperature strength of an alumina matrix-nextel 720 fiber reinforced cmc Varghese, Prakash 01 October 2001 (has links) No description available. Ceramic matrix composites Engineering
127	Sums and products of square-zero matrices Hattingh, Christiaan Johannes 03 1900 (has links) Which matrices can be written as sums or products of square-zero matrices? This question is the central premise of this dissertation. Over the past 25 years a signi - cant body of research on products and linear combinations of square-zero matrices has developed, and it is the aim of this study to present this body of research in a consolidated, holistic format, that could serve as a theoretical introduction to the subject. The content of the research is presented in three parts: rst results within the broader context of sums and products of nilpotent matrices are discussed, then products of square-zero matrices, and nally sums of square-zero matrices. / Mathematical Sciences / M. Sc. (Mathematics) Nilpotent matrix Quadratic matrix Square-zero matrix Matrix division Matrix factorization Sum decomposition Rational canonical form Smith canonical form Invariant factors Companion matrix Nonderogatory matrix Matrix similarity Matrix trace Field Field characteristic Algebraic closure Matrix polynomial 512.9434 Matrices
128	Algorithms for matrix functions and their Fréchet derivatives and condition numbers Relton, Samuel January 2015 (has links) No description available. 510
129	Optimizing Sparse Matrix-Matrix Multiplication on a Heterogeneous CPU-GPU Platform Wu, Xiaolong 16 December 2015 (has links) Sparse Matrix-Matrix multiplication (SpMM) is a fundamental operation over irregular data, which is widely used in graph algorithms, such as finding minimum spanning trees and shortest paths. In this work, we present a hybrid CPU and GPU-based parallel SpMM algorithm to improve the performance of SpMM. First, we improve data locality by element-wise multiplication. Second, we utilize the ordered property of row indices for partial sorting instead of full sorting of all triples according to row and column indices. Finally, through a hybrid CPU-GPU approach using two level pipelining technique, our algorithm is able to better exploit a heterogeneous system. Compared with the state-of-the-art SpMM methods in cuSPARSE and CUSP libraries, our approach achieves an average of 1.6x and 2.9x speedup separately on the nine representative matrices from University of Florida sparse matrix collection. Sparse matrix-matrix multiplication Data locality Pipelining GPU
130	Linear Operators that Preserve Qualitative Matrix Structures Ye, Shumin 01 May 1993 (has links) We characterized the group of linear operators that preserve sign-nonsingular matrices over ��(ℝ). Then we extended these results to n show that a linear operator T that strongly preserves L-matrices over ��,�(ℝ) if and only if T preserves L-matrices and T is also one to one on m,n the set of cells. We also characterized the group of linear operators that strongly preserve L-matrices. In addition, we characterized the group of linear operators that preserve super L- matrices, the subset of L-matrix. Also we investigated linear operators that preserve totally L-matrices, the subset of L-matrix. Chapters 1 and 2 of this dissertation contain some material of the work done by other researchers on the linear preserver problems and the properties of sign-nonsingular matrices and L-matrix. Characterizations of linear operators in Chapters 3, 4, 5, and 6 of this dissertation are new. linear operators qualitative matrix structures matrix structures Mathematics

Search results