Matrix Data Structure

A Matrix Data Structure is a homogeneous array data structure with number values (or empty values).

• Context:
  • It can (typically) be used to model a Mathematical Matrix, such as a vector data structure.
  • It can range from being an Empty Matrix Data Structure to being a Populated Matrix Data Structure (with matrix data).
  • It can range from being a Dense Matrix Data Structure to being a Sparse Matrix Data Structure.
  • It can (often) be a part of a Matrix Processing System.
• Example(s):
  • a Python Matrix (e.g. numpy matrix), Scala Matrix, R Matrix, Perl Matrix, ...
  • …
• Counter-Example(s):
  • a Array Tuple Data Structure.
  • a Heterogeneous Data Structure.
• See: Record Matrix, Identity Matrix, Hermitian Matrix, Positive Definite Matrix.

---

---

References

2015

• http://en.wikipedia.org/wiki/Comparison_of_linear_algebra_libraries
  • 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.

---