Linear Algebra System
Jump to navigation
Jump to search
A Linear Algebra System is a mathematical system (that applies a linear algebra algorithm to solve a linear algebra task.
- Context:
- It can (often) include a: Matrix Inversion System, ...
- Example(s):
- numpy.linalg [1].
- …
- Counter-Example(s):
- See: Library (Computing).
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/comparison_of_linear_algebra_libraries Retrieved:2015-2-1.
- The following tables provide a comparison of linear algebra software libraries, either specialized or general purpose libraries with significant linear algebra coverage. ...
- … Matrix types (special types like bidiagonal/tridiagonal are not listed):
- Real - general (nonsymmetric) real.
- Complex - general (nonsymmetric) complex.
- SPD - symmetric positive definite (real).
- HPD - Hermitian positive definite (complex).
- SY - symmetric (real).
- HE - Hermitian (complex).
- BND - band.
- Operations:
- TF - triangular factorizations (LU, Cholesky)
- OF - orthogonal factorizations (QR, QL, generalized factorizations)
- EVD - eigenproblems.
- SVD - singular value decomposition.
- GEVD - generalized EVD.
- GSVD - generalized SVD.