Shows that the p-norm converges to the infinity norm as p
increases.
Computes the matrix norm induced by a "black box" vector norm using the Monte-Carlo method.
Implements the Cholesky factorization algorithm, applies it to a tridiagonal
matrix and compares with the results of numpy.linalg.cholesky
.
Compares the execution time of Cholesky decomposition
implemented in Python using for-loops and numpy.linalg.cholesky
.
Measures the execution time of a C++ implementation of Cholesky decomposition.
Demonstrates basic features of scipy.sparse
.
Creates a sparse matrix in various formats (COO, CSR, CSC) and solves a linear
system with that matrix.
Visualizes the changes in the sparsity pattern during the LU and Cholesky factorization algorithms.
Performs the principal component analysis (PCA) on a two-dimensional data set.