Matrix: Difference between revisions
Jump to navigation
Jump to search
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...") |
m (Kinds of array category) |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
In the APL [[array model]], a matrix (sometimes | 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 [[ | 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 features}}[[Category:Kinds of array]] | |||
Latest revision as of 14:58, 30 April 2020
In the APL array model, a matrix (sometimes table) is an array with rank 2. While matrices are named after the objects in 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 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).
| APL features [edit] | |
|---|---|
| Built-ins | Primitives (functions, operators) ∙ Quad name |
| Array model | Shape ∙ Rank ∙ Depth ∙ Bound ∙ Index (Indexing) ∙ Axis ∙ Ravel ∙ Ravel order ∙ Element ∙ Scalar ∙ Vector ∙ Matrix ∙ Simple scalar ∙ Simple array ∙ Nested array ∙ Cell ∙ Major cell ∙ Subarray ∙ Empty array ∙ Prototype |
| Data types | Number (Boolean, Complex number) ∙ Character (String) ∙ Box ∙ Namespace ∙ Function array |
| Concepts and paradigms | Conformability (Scalar extension, Leading axis agreement) ∙ Scalar function (Pervasion) ∙ Identity element ∙ Complex floor ∙ Array ordering (Total) ∙ Tacit programming (Function composition, Close composition) ∙ Glyph ∙ Leading axis theory ∙ Major cell search ∙ First-class function |
| Errors | LIMIT ERROR ∙ RANK ERROR ∙ SYNTAX ERROR ∙ DOMAIN ERROR ∙ LENGTH ERROR ∙ INDEX ERROR ∙ VALUE ERROR ∙ EVOLUTION ERROR |