Package smile.tensor


package smile.tensor
A tensor is a multidimensional array. Mathematically, a tensor is an algebraic object that describes a multilinear relationship between sets of algebraic objects related to a vector space. Tensors may map between different objects such as vectors, scalars, and even other tensors.
  • Class
    Description
    This class provides a skeletal implementation of the Tensor interface, to minimize the effort required to implement this interface.
    ARPACK is a collection of Fortran77 subroutines designed to solve large scale eigenvalue problems.
    Which eigenvalues of asymmetric matrix to compute.
    Which eigenvalues of symmetric matrix to compute.
    The square matrix of A' * A or A * A', whichever is smaller.
    A band matrix is a sparse matrix, whose non-zero entries are confined to a diagonal band, comprising the main diagonal and zero or more diagonals on either side.
    The biconjugate gradient method to solve systems of linear equations.
    The Cholesky decomposition of a symmetric, positive-definite matrix.
    A dense matrix is a matrix where a large proportion of its elements are non-zero.
    Double precision matrix element stream consumer.
    Eigenvalue algorithms such as power iteration and Lanczos algorithms.
    Eigenvalue decomposition.
    A simple on-heap Tensor implementation.
    The LU decomposition.
    Mathematical matrix interface.
    The preconditioner matrix.
    The QR decomposition.
    A scalar is a single number.
    The data type of scalar value.
    A sparse matrix is a matrix populated primarily with zeros.
    Singular Value Decomposition.
    The symmetric matrix in packed storage.
    A Tensor is a multidimensional array containing elements of a single data type.
    Mathematical vector interface.