Essays about: "Sparse Matrix"
Showing result 1 - 5 of 39 essays containing the words Sparse Matrix.
-
1. Gap Probabilities in Random Matrix Ensembles
University essay from Uppsala universitet/Analys och partiella differentialekvationerAbstract : In this degree project we look at eigenvalue statistics of two randommatrix ensembles, the Gaussian and the circular ensembles. We beginwith their definition and discuss the joint probability distribution of theirentries and eigenvalues. READ MORE
-
2. Effects of Varying Precision on a FPGA using the SpMXV problem : A comparative study
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : With Moore’s Law slowing down, designing computer hardware that keeps up with the performance demands is becoming increasingly difficult. An interesting area of research is the Field Programmable Gate Array (FPGA) which is a re-programmable hardware device, and which might not be as dependent on Moore’s Law as other hardware. READ MORE
-
3. A Multi-Level Extension of the Hierarchical PCA Framework with Applications to Portfolio Construction with Futures Contracts
University essay from KTH/Matematisk statistikAbstract : With an increasingly globalised market and growing asset universe, estimating the market covariance matrix becomes even more challenging. In recent years, there has been an extensive development of methods aimed at mitigating these issues. READ MORE
-
4. Minimum Cost Distributed Computing using Sparse Matrix Factorization
University essay from KTH/Optimeringslära och systemteoriAbstract : Distributed computing is an approach where computationally heavy problems are broken down into more manageable sub-tasks, which can then be distributed across a number of different computers or servers, allowing for increased efficiency through parallelization. This thesis explores an established distributed computing setting, in which the computationally heavy task involves a number of users requesting a linearly separable function to be computed across several servers. READ MORE
-
5. Optimization over nonnegative matrix polynomials
University essay from Linköpings universitet/Institutionen för systemteknikAbstract : This thesis is concerned with convex optimization problems over matrix polynomials that are constrained to be positive semidefinite on the unit circle. Problems of this form appear in signal processing and can often be solved as semidefinite programs (SDPs). READ MORE