Numerical Analysis: A Comparison of Sparse vs. Non-Sparse Matrix Performance in MATLab

math4650.png

Abstract

This project is an in-depth analysis of error and computational limitations of sparse versus non-sparse matrices in MATLab. It examines performance of the two matrix types by incrementally increasing processor loads of a sinusoidal pile function.

As processing requirements increase, the sparse matrix begins to drastically outperform the non-sparse matrix computation.

(Code within document)

Author(s)

Wyatt "Miller" Miller

 

Similar Projects

 
All Projects
Non-Parametric Bootstrap in R With Correction for Bias and Skew
Non-Parametric Bootstrap in R With Correction for Bias and Skew
Introduction to Tableau
Introduction to Tableau
A Concise Statistical Proof of the Monty Hall Problem in R
A Concise Statistical Proof of the Monty Hall Problem in R
Introduction to Latent Class Analysis with an Application to Vitiligo
Introduction to Latent Class Analysis with an Application to Vitiligo
Principles of Cybersecurity: Project (SSH on a Raspberry Pi)
Principles of Cybersecurity: Project (SSH on a Raspberry Pi)
A Library of Digestion Algorithms and Hashing Protocols: MD5, SHA1, and SHA256
A Library of Digestion Algorithms and Hashing Protocols: MD5, SHA1, and SHA256
A Simple K-Means Cluster Analyzer v0.2
A Simple K-Means Cluster Analyzer v0.2
A Simple Cluster Generator v0.32
A Simple Cluster Generator v0.32
A Simple Unbalanced KDTree with 1NN Implementation
A Simple Unbalanced KDTree with 1NN Implementation
Numerical Analysis: A Comparison of Sparse vs. Non-Sparse Matrix Performance in MATLab
Numerical Analysis: A Comparison of Sparse vs. Non-Sparse Matrix Performance in MATLab
 
CodingMillerUniversity of Colorado DenverMathematics, Coding, Matrices, MATLab, Performance, All ProjectsComment