New answers tagged matrix
4
I think you already know the answer- find the inverse of each of the small diagonal blocks. The details of how you might break the matrix up into the block in Python are something out of scope for this stackexchange group.
As others have suggested you most likely don't really need the inverse of this matrix and could probably do everything you need with a ...
2
As I mentioned in my comment, due to that you are searching for a method based on Python and ideally available in NumPy or SciPy, my suggestion is to use scipy.linalg.expm. It's really easy to use basically you have the $X$ matrix and you just pass it to the scipy.linalg.expm class and it would give you the exponential of $X$ (i.e. $e^{X}$).
Due to that you ...
18
Your code is limited by memory bandwidth. For trivial math, it's often better to count memory accesses rather than flops. You'll get the following table:
operation memory reads/writes
matrix + matrix 3n²
matrix * vector 2n²+n (if vector is not cached)
matrix * vector n²+2n (if vector is only read once)
vector + vector ...
57
Except for code which does a significant number of floating-point operations on data that are held in cache, most floating-point intensive code is performance limited by memory bandwidth and cache capacity rather than by flops.
$v$ and the products $Av$ and $Bv$ are all vectors of length 2000 (16K bytes in double precision), which will easily fit into a ...
6
I don't think there is a way to display the used LAPACK function names natively during runtime using the interfaces provided by scipy.linalg.
Depending on your goals you can:
read the source code and deduce the logic from there. Unfortunately, this is not a runtime-use scenario, but a human analysis.
fork your own version of scipy, add custom outputs (to ...
4
You might want to use the fact that:
$$
||A||_2=\sigma_\max(A)
$$
where $\sigma_\max$ is the largest singular value. If you are interested in details, this Math SO question should be interesting. Thus,
$$
||A^{-1}||_2=\frac{1}{\sigma_\min(A)}
$$
where $\sigma_\min$ is the smallest singular value.
You certainly want to avoid the actual calculation of the ...
Top 50 recent answers are included
