Search Java Classes and Packages
#Com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype Classes and Interfaces - 61 results found.
| Name | Description | Type | Package | Framework |
| AutoParallelMatrixMathOperation | This class uses ParallelMatrixMathOperation when the first input matrix argument's size is greater than the defined threshold; otherwise, it uses SimpleMatrixMathOperation. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.mathoperation | SuanShu |
| BiconjugateGradientSolver | The Biconjugate Gradient method (BiCG) is useful for solving non-symmetric n-by-n linear systems. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
| BiconjugateGradientStabilizedSolver | The Biconjugate Gradient Stabilized (BiCGSTAB) method is useful for solving non-symmetric n-by-n linear systems. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
| BidiagonalMatrix | A bi-diagonal matrix is either upper or lower diagonal. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.dense.diagonal | SuanShu |
| BidiagonalMatrix .BidiagonalMatrixType | the available types of bi-diagonal matricesa lower bi-diagonal matrix, where there are only non-zero entries on the main and sub | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.dense.diagonal | SuanShu |
| BlockWinogradAlgorithm | This implementation accelerates matrix multiplication via a combination of the Strassen algorithm and block matrix multiplication. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.mathoperation.multiplication | SuanShu |
| ConjugateGradientNormalErrorSolver | For an under-determined system of linear equations, Ax = b, or when the coefficient matrix A is non-symmetric and nonsingular, | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
| ConjugateGradientNormalResidualSolver | For an under-determined system of linear equations, Ax = b, or when the coefficient matrix A is non-symmetric and nonsingular, | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
| ConjugateGradientSolver | The Conjugate Gradient method (CG) is useful for solving a symmetric n-by-n linear system. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
| ConjugateGradientSquaredSolver | The Conjugate Gradient Squared method (CGS) is useful for solving a non-symmetric n-by-n linear system. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
| ConvergenceFailure | This exception is thrown by IterativeLinearSystemSolver. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative | SuanShu |
| ConvergenceFailure .Reason | the reasons for the convergence failureThrown when the iterative algorithm fails to proceed during its | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative | SuanShu |
| CSRSparseMatrix | The Compressed Sparse Row (CSR) format for sparse matrix has this representation: (value, col_ind, row_ptr). | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse | SuanShu |
| DefaultMatrixStorage | There are multiple ways to implement the storage data structure depending on the matrix type for optimization purpose. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype | SuanShu |
| DenseData | This implementation of the storage of a dense matrix stores the data of a 2D matrix as an 1D In general, computing index for a double[] is faster than that for a double[][]. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.dense | SuanShu |
| DenseMatrix | This class implements the standard, dense, double based matrix representation. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.dense | SuanShu |
| DenseMatrixMultiplication | Matrix operation that multiplies two matrices. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.mathoperation.multiplication | SuanShu |
| DenseMatrixMultiplicationByBlock | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.mathoperation.multiplication | SuanShu | |
| DenseMatrixMultiplicationByBlock .BlockAlgorithm | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.mathoperation.multiplication | SuanShu | |
| DenseMatrixMultiplicationByIjk | parallel execution with multiple threads. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.mathoperation.multiplication | SuanShu |
| Densifiable | This interface specifies whether a matrix implementation can be efficiently converted to the standard dense matrix representation. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.dense | SuanShu |
| DiagonalMatrix | A diagonal matrix has non-zero entries only on the main diagonal. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.dense.diagonal | SuanShu |
| DOKSparseMatrix | The Dictionary Of Key (DOK) format for sparse matrix uses the coordinates of non-zero entries in the matrix as keys. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse | SuanShu |
| GaussSeidelSolver | Similar to the Jacobi method, the Gauss-Seidel method (GS) solves each equation in sequential order. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.stationary | SuanShu |
| GeneralizedConjugateResidualSolver | The Generalized Conjugate Residual method (GCR) is useful for solving a non-symmetric n-by-n linear system. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
| GeneralizedMinimalResidualSolver | The Generalized Minimal Residual method (GMRES) is useful for solving a non-symmetric n-by-n linear system. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
| GivensMatrix | Givens rotation is a rotation in the plane spanned by two coordinates axes. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype | SuanShu |
| HilbertMatrix | A Hilbert matrix, H, is a symmetric matrix with entries being the unit fractions H[i][j] = 1 / (i + j -1) | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype | SuanShu |
| IdentityPreconditioner | This identity preconditioner is used when no preconditioning is applied. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.preconditioner | SuanShu |
| IterativeLinearSystemSolver | An iterative method for solving an N-by-N (or non-square) linear system Ax = b involves a sequence of matrix-vector multiplications. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative | SuanShu |
| IterativeLinearSystemSolver .Solution | This is the solution to a system of linear equations using an iterativeSearch for a solution that optimizes the objective function from the | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative | SuanShu |
| JacobiPreconditioner | The Jacobi (or diagonal) preconditioner is one of the simplest forms of preconditioning, such that the preconditioner is the diagonal of | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.preconditioner | SuanShu |
| JacobiSolver | The Jacobi method solves sequentially n equations in a linear system Ax = b in isolation in each iteration. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.stationary | SuanShu |
| LILSparseMatrix | The list of lists (LIL) format for sparse matrix stores one list per row, where each entry stores a column index and value. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse | SuanShu |
| LowerTriangularMatrix | A lower triangular matrix has 0 entries where column index > row index. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.dense.triangle | SuanShu |
| MatrixCoordinate | The location of a matrix entry is specified by a 2D coordinates (i, j), where i and j are the row-index and column-index of the entry respectively. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse | SuanShu |
| MatrixMathOperation | This interface defines some standard operations for generic matrices. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.mathoperation | SuanShu |
| MinimalResidualSolver | The Minimal Residual method (MINRES) is useful for solving a symmetric n-by-n linear system (possibly indefinite or singular). | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
| PermutationMatrix | A permutation matrix is a square matrix that has exactly one entry '1' in each row and each column and 0's elsewhere. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype | SuanShu |
| Preconditioner | Preconditioning reduces the condition number of the coefficient matrix of a linear system to accelerate the convergence | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.preconditioner | SuanShu |
| PreconditionerFactory | This constructs a new instance of Preconditioner for a coefficient matrix. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.preconditioner | SuanShu |
| QuasiMinimalResidualSolver | The Quasi-Minimal Residual method (QMR) is useful for solving a non-symmetric n-by-n linear system. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
| SimpleMatrixMathOperation | This is a generic, single-threaded implementation of matrix math operations. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.mathoperation | SuanShu |
| SORSweep | This is a building block for to perform the forward or backward sweep. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.stationary | SuanShu |
| SparseMatrix | A sparse matrix stores only non-zero values. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse | SuanShu |
| SparseMatrix .Entry | This is a (non-zero) entry in a sparse matrix. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse | SuanShu |
| SparseMatrix .Entry .TopLeftFirstComparator | This Comparator sorts the matrix coordinates first from top to bottom (rows), and then from left to right (columns). | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse | SuanShu |
| SparseMatrixUtils | These are the utility functions for SparseMatrix. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse | SuanShu |
| SparseStructure | This interface defines common operations on sparse structures such as sparse vector or sparse matrix. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse | SuanShu |
| SparseVector | A sparse vector stores only non-zero values. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse | SuanShu |
| SparseVector .Entry | This is an entry in a SparseVector. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse | SuanShu |
| SparseVector .Entry .Comparator | This Comparator sorts the matrix coordinates first from top to bottom (rows), and then from left to right (columns). | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse | SuanShu |
| SparseVector .Iterator | This wrapper class overrides the Iterator. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse | SuanShu |
| SSORPreconditioner | SSOR preconditioner is derived from a symmetric coefficient matrix A which is decomposed as | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.preconditioner | SuanShu |
| SteepestDescentSolver | The Steepest Descent method (SDM) solves a symmetric n-by-n linear system. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.nonstationary | SuanShu |
| SubMatrixBlock | Sub-matrix block representation for block algorithm. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.mathoperation.multiplication | SuanShu |
| SuccessiveOverrelaxationSolver | The Successive Overrelaxation method (SOR), is devised by applying extrapolation to the Gauss-Seidel method. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.stationary | SuanShu |
| SymmetricMatrix | A symmetric matrix is a square matrix such that its transpose equals to itself, i. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.dense.triangle | SuanShu |
| SymmetricSuccessiveOverrelaxationSolver | The Symmetric Successive Overrelaxation method (SSOR) is like SOR, but it performs in each | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.stationary | SuanShu |
| TridiagonalMatrix | A tri-diagonal matrix has non-zero entries only on the super, main and sub diagonals. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.dense.diagonal | SuanShu |
| UpperTriangularMatrix | An upper triangular matrix has 0 entries where row index is greater than column index. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.dense.triangle | SuanShu |