Matrix: Difference between revisions

Jump to navigation Jump to search
14 bytes added ,  14:23, 14 November 2019
no edit summary
Miraheze>Marshall
(Created page with "In the APL array model, a matrix (sometimes "table") is an array with rank 2. While matrices are named after the objects in [https://en.wikipedia.org/wiki/Linear_algeb...")
 
Miraheze>Marshall
No edit summary
Line 1: Line 1:
In the APL [[array model]], a matrix (sometimes "table") is an array with [[rank]] 2. While matrices are named after the objects in [https://en.wikipedia.org/wiki/Linear_algebra linear algebra], which are multiplied using the [[matrix product]], APL matrices do not have to be used in this way: they can store arbitrary data like any other array.
In the APL [[array model]], a '''matrix''' (sometimes '''table''') is an array with [[rank]] 2. While matrices are named after the objects in [[wikipedia:linear algebra|linear algebra]], which are multiplied using the [[matrix product]], APL matrices do not have to be used in this way: they can store arbitrary data like any other array.


Rank 2 is the smallest rank for which multidimensional array theory offers an advantage over one-dimensional lists. Unlike [[Vector|vectors]], [[Transpose]] on matrices changes the order of data, although there is only one possible transpose so dyadic Transpose is never needed. The [[ravel order]] of a matrix has two possible definitions; APLs choose to keep the rows together (row major order) rather than the columns (column major).
Rank 2 is the smallest rank for which multidimensional array theory offers an advantage over one-dimensional lists. Unlike [[vector]]s, [[Transpose]] on matrices changes the order of data, although there is only one possible transpose so dyadic Transpose is never needed. The [[ravel order]] of a matrix has two possible definitions; APLs choose to keep the rows together (row major order) rather than the columns (column major).
{{APL programming language}}
Anonymous user

Navigation menu