Extension name and usage¶Array API specification for linear algebra functions.
The name of the namespace providing the extension must be: linalg.
If implemented, this linalg extension must be retrievable via:
>>> xp = x.__array_namespace__() >>> if hasattr(xp, 'linalg'): >>> # Use `xp.linalg`Design Principles¶
A principal goal of this specification is to standardize commonly implemented interfaces among array libraries. While this specification endeavors to avoid straying too far from common practice, this specification does, with due restraint, seek to address design decisions arising more from historical accident than first principles. This is especially true for linear algebra APIs, which have arisen and evolved organically over time and have often been tied to particular underlying implementations (e.g., to BLAS and LAPACK).
Accordingly, the standardization process affords the opportunity to reduce interface complexity among linear algebra APIs by inferring and subsequently codifying common design themes, thus allowing more consistent APIs. What follows is the set of design principles governing the APIs which follow:
Batching: if an operation is explicitly defined in terms of matrices (i.e., two-dimensional arrays), then the associated interface should support “batching” (i.e., the ability to perform the operation over a “stack” of matrices). Example operations include:
inv: computing the multiplicative inverse of a square matrix.
cholesky: performing Cholesky decomposition.
matmul: performing matrix multiplication.
Data types: if an operation requires decimal operations and Type Promotion Rules semantics are undefined (e.g., as is the case for mixed-kind promotions), then the associated interface should be specified as being restricted to floating-point data types. While the specification uses the term “SHOULD” rather than “MUST”, a conforming implementation of the array API standard should only ignore the restriction provided overly compelling reasons for doing so. Example operations which should be limited to floating-point data types include:
inv: computing the multiplicative inverse.
slogdet: computing the natural logarithm of the absolute value of the determinant.
norm: computing the matrix or vector norm.
Certain operations are solely comprised of multiplications and additions. Accordingly, associated interfaces need not be restricted to floating-point data types. However, careful consideration should be given to overflow, and use of floating-point data types may be more prudent in practice. Example operations include:
matmul: performing matrix multiplication.
trace: computing the sum along the diagonal.
cross: computing the vector cross product.
Lastly, certain operations may be performed independent of data type, and, thus, the associated interfaces should support all data types specified in this standard. Example operations include:
matrix_transpose: computing the transpose.
diagonal: returning the diagonal.
Return values: if an interface has more than one return value, the interface should return a namedtuple consisting of each value.
In general, interfaces should avoid polymorphic return values (e.g., returning an array or a namedtuple, dependent on, e.g., an optional keyword argument). Dedicated interfaces for each return value type are preferred, as dedicated interfaces are easier to reason about at both the implementation level and user level. Example interfaces which could be combined into a single overloaded interface, but are not, include:
eigh: computing both eigenvalues and eigenvectors.
eigvalsh: computing only eigenvalues.
Implementation agnosticism: a standardized interface should eschew parameterization (including keyword arguments) biased toward particular implementations.
Historically, at a time when all array computing happened on CPUs, BLAS and LAPACK underpinned most numerical computing libraries and environments. Naturally, language and library abstractions catered to the parameterization of those libraries, often exposing low-level implementation details verbatim in their higher-level interfaces, even if such choices would be considered poor or ill-advised by today’s standards (e.g., NumPy’s use of UPLO in eigh). However, the present day is considerably different. While still important, BLAS and LAPACK no longer hold a monopoly over linear algebra operations, especially given the proliferation of devices and hardware on which such operations must be performed. Accordingly, interfaces must be conservative in the parameterization they support in order to best ensure universality. Such conservatism applies even to performance optimization parameters afforded by certain hardware.
Orthogonality: an interface should have clearly defined and delineated functionality which, ideally, has no overlap with the functionality of other interfaces in the specification. Providing multiple interfaces which can all perform the same operation creates unnecessary confusion regarding interface applicability (i.e., which interface is best at which time) and decreases readability of both library and user code. Where overlap is possible, the specification must be parsimonious in the number of interfaces, ensuring that each interface provides a unique and compelling abstraction. Examples of related interfaces which provide distinct levels of abstraction (and generality) include:
vecdot: computing the dot product of two vectors.
matmul: performing matrix multiplication (including between two vectors and thus the dot product).
tensordot: computing tensor contractions (generalized sum-products).
einsum: expressing operations in terms of Einstein summation convention, including dot products and tensor contractions.
The above can be contrasted with, e.g., NumPy, which provides the following interfaces for computing the dot product or related operations:
dot: dot product, matrix multiplication, and tensor contraction.
inner: dot product.
vdot: dot product with flattening and complex conjugation.
multi_dot: chained dot product.
tensordot: tensor contraction.
matmul: matrix multiplication (dot product for two vectors).
einsum: Einstein summation convention.
where dot is overloaded based on input array dimensionality and vdot and inner exhibit a high degree of overlap with other interfaces. By consolidating interfaces and more clearly delineating behavior, this specification aims to ensure that each interface has a unique purpose and defined use case.
A conforming implementation of this linalg extension must provide and support the following functions.
cholesky(x, /, *, upper=False)
Returns the lower (upper) Cholesky decomposition of a complex Hermitian or real symmetric positive-definite matrix x.
cross(x1, x2, /, *, axis=-1)
Returns the cross product of 3-element vectors.
det(x, /)
Returns the determinant of a square matrix (or a stack of square matrices) x.
diagonal(x, /, *, offset=0)
Returns the specified diagonals of a matrix (or a stack of matrices) x.
eigh(x, /)
Returns an eigenvalue decomposition of a complex Hermitian or real symmetric matrix (or a stack of matrices) x.
eigvalsh(x, /)
Returns the eigenvalues of a complex Hermitian or real symmetric matrix (or a stack of matrices) x.
inv(x, /)
Returns the multiplicative inverse of a square matrix (or a stack of square matrices) x.
matmul(x1, x2, /)
Alias for matmul().
matrix_norm(x, /, *, keepdims=False, ord='fro')
Computes the matrix norm of a matrix (or a stack of matrices) x.
matrix_power(x, n, /)
Raises a square matrix (or a stack of square matrices) x to an integer power n.
matrix_rank(x, /, *, rtol=None)
Returns the rank (i.e., number of non-zero singular values) of a matrix (or a stack of matrices).
matrix_transpose(x, /)
Alias for matrix_transpose().
outer(x1, x2, /)
Returns the outer product of two vectors x1 and x2.
pinv(x, /, *, rtol=None)
Returns the (Moore-Penrose) pseudo-inverse of a matrix (or a stack of matrices) x.
qr(x, /, *, mode='reduced')
Returns the QR decomposition of a full column rank matrix (or a stack of matrices).
slogdet(x, /)
Returns the sign and the natural logarithm of the absolute value of the determinant of a square matrix (or a stack of square matrices) x.
solve(x1, x2, /)
Returns the solution of a square system of linear equations with a unique solution.
svd(x, /, *, full_matrices=True)
Returns a singular value decomposition (SVD) of a matrix (or a stack of matrices) x.
svdvals(x, /)
Returns the singular values of a matrix (or a stack of matrices) x.
tensordot(x1, x2, /, *, axes=2)
Alias for tensordot().
trace(x, /, *, offset=0, dtype=None)
Returns the sum along the specified diagonals of a matrix (or a stack of matrices) x.
vecdot(x1, x2, /, *, axis=-1)
Alias for vecdot().
vector_norm(x, /, *, axis=None, keepdims=False, ord=2)
Computes the vector norm of a vector (or batch of vectors) x.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4