All Classes and Interfaces
Class
Description
An advanced matrix predicate that test the whole matrix rather than its
elements.
A basic dense vector implementation using an array.
This is a CCS (Compressed Column Storage) matrix class.
This class represents Cholesky decomposition of matrices.
A basic sparse vector implementation using underlying value and index arrays.
This is a CRS (Compressed Row Storage) matrix class.
A dense vector.
This class represents Eigen decomposition of matrices.
This class represents Gaussian method for solving linear systems.
This class represents Jacobi method for solving linear systems.
This class provides solution of "fat" linear system with least euclidean norm.
Tiny class for common things.
Linear System Solver interface;
This class implements Strategy design pattern;
This class represents LU decomposition of matrices.
A real matrix.
A matrix accumulator that accumulates elements across matrix.
Interface for implementing various matrix decompositions.
An abstract matrix factory.
A matrix function that takes an element with its indices and produces
a new value.
A matrix predicate that tests each matrix element.
A matrix procedure that performs an action of every matrix element.
This class represents QR decomposition of matrices.
This class represents
Seidel method
for solving linear systems.
This class represents singular value decomposition of matrices.
A sparse vector.
This class represents Square Root method
for solving linear systems.
This class represents Sweep (or
Tridiagonal matrix, or Thomas) method for solving linear systems.
A vector represents an array of elements.
A vector accumulator that accumulates vector's elements.
An abstract vector factory.
A vector function that takes a vector's element and produces a new value.
A vector predicate that tests vector's elements.
A vector procedure that acts on vector's elements.