Sökning: "sparse matrix"
Visar resultat 1 - 5 av 40 uppsatser innehållade orden sparse matrix.
1. Gap Probabilities in Random Matrix Ensembles
Kandidat-uppsats, Uppsala universitet/Analys och partiella differentialekvationerSammanfattning : 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. LÄS MER
2. Effects of Varying Precision on a FPGA using the SpMXV problem : A comparative study
Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : 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. LÄS MER
3. A Multi-Level Extension of the Hierarchical PCA Framework with Applications to Portfolio Construction with Futures Contracts
Master-uppsats, KTH/Matematisk statistikSammanfattning : 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. LÄS MER
4. Minimum Cost Distributed Computing using Sparse Matrix Factorization
Master-uppsats, KTH/Optimeringslära och systemteoriSammanfattning : 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. LÄS MER
5. Optimization over nonnegative matrix polynomials
Master-uppsats, Linköpings universitet/Institutionen för systemteknikSammanfattning : 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). LÄS MER