Package org.hipparchus.linear
package org.hipparchus.linear
Linear algebra support.
-
ClassDescriptionAbstractFieldMatrix<T extends FieldElement<T>>Basic implementation of
FieldMatrixmethods regardless of the underlying storage.Basic implementation of RealMatrix methods regardless of the underlying storage.Interface defining very basic matrix operations.Array2DRowFieldMatrix<T extends FieldElement<T>>Implementation ofFieldMatrixusing aFieldElement[][] array to store entries.Implementation ofRealMatrixusing adouble[][]array to store entries.ArrayFieldVector<T extends FieldElement<T>>This class implements theFieldVectorinterface with aFieldElementarray.This class implements theRealVectorinterface with a double array.BlockFieldMatrix<T extends FieldElement<T>>Cache-friendly implementation of FieldMatrix using a flat arrays to store square blocks of the matrix.Cache-friendly implementation of RealMatrix using a flat arrays to store square blocks of the matrix.Matrix decomposer using Cholseky decomposition.Calculates the Cholesky decomposition of a matrix.Given a matrix A, it computes a complex eigen decomposition AV = VD.This is an implementation of the conjugate gradient method forRealLinearOperator.Interface handling decomposition algorithms that can solve A × X = B.DefaultFieldMatrixChangingVisitor<T extends FieldElement<T>>Default implementation of theFieldMatrixChangingVisitorinterface.DefaultFieldMatrixPreservingVisitor<T extends FieldElement<T>>Default implementation of theFieldMatrixPreservingVisitorinterface.A default concrete implementation of the abstract classIterativeLinearSolverEvent.Default implementation of theRealMatrixChangingVisitorinterface.Default implementation of theRealMatrixPreservingVisitorinterface.Enumerate to specify how dependent vectors should be handled inMatrixUtils.orthonormalize(List, double, DependentVectorsHandler)andMatrixUtils.orthonormalize(Field, List, CalculusFieldElement, DependentVectorsHandler).Implementation of a diagonal matrix.Calculates the eigen decomposition of a non-symmetric real matrix.Calculates the eigen decomposition of a symmetric real matrix.FieldDecompositionSolver<T extends FieldElement<T>>Interface handling decomposition algorithms that can solve A × X = B.FieldLUDecomposer<T extends FieldElement<T>>Matrix decomposer using LU-decomposition.FieldLUDecomposition<T extends FieldElement<T>>Calculates the LUP-decomposition of a square matrix.FieldMatrix<T extends FieldElement<T>>Interface defining field-valued matrix with basic algebraic operations.FieldMatrixChangingVisitor<T extends FieldElement<?>>Interface defining a visitor for matrix entries.FieldMatrixDecomposer<T extends FieldElement<T>>Interface for all algorithms providing matrix decomposition.FieldMatrixPreservingVisitor<T extends FieldElement<?>>Interface defining a visitor for matrix entries.FieldQRDecomposer<T extends CalculusFieldElement<T>>Matrix decomposer using QR-decomposition.FieldQRDecomposition<T extends CalculusFieldElement<T>>Calculates the QR-decomposition of a field matrix.FieldVector<T extends FieldElement<T>>Interface defining a field-valued vector with basic algebraic operations.FieldVectorChangingVisitor<T extends FieldElement<?>>This interface defines a visitor for the entries of a vector.FieldVectorPreservingVisitor<T extends FieldElement<?>>This interface defines a visitor for the entries of a vector.Class transforming a general real matrix to Hessenberg form.This abstract class defines an iterative solver for the linear system A · x = b.This is the base class for all events occurring during the iterations of aIterativeLinearSolver.This class implements the standard Jacobi (diagonal) preconditioner.Matrix decomposer using LU-decomposition.Calculates the LUP-decomposition of a square matrix.Interface for all algorithms providing matrix decomposition.A collection of static methods that operate on or return matrices.Sparse matrix implementation based on an open addressed map.This class implements theRealVectorinterface with aOpenIntToDoubleHashMapbacking store.Given a matrix A, it computes a complex eigen decomposition A = VDV^{T}.This abstract class defines preconditioned iterative solvers.Matrix decomposer using QR-decomposition.Calculates the QR-decomposition of a matrix.This class defines a linear operator operating on real (double) vector spaces.Interface defining a real-valued matrix with basic algebraic operations.Interface defining a visitor for matrix entries.Formats anxmmatrix in components list format "{{a00,a01, ..., a0m-1},{a10, a11, ..., a1m-1},{...},{ an-10, an-11, ..., an-1m-1}}".Interface defining a visitor for matrix entries.Class defining a real-valued vector with basic algebraic operations.This interface defines a visitor for the entries of a vector.Formats a vector in components list format "{v0; v1; ...; vk-1}".This interface defines a visitor for the entries of a vector.Calculates the rectangular Cholesky decomposition of a matrix.An algebraic Riccati equation is a type of nonlinear equation that arises in the context of infinite-horizon optimal control problems in continuous time or discrete time.This solver computes the solution using the following approach: 1.Calculates the rank-revealing QR-decomposition of a matrix, with column pivoting.Class transforming a general real matrix to Schur form.Calculates the Cholesky decomposition of a positive semidefinite matrix.Matrix decomposer using Singular Value Decomposition.Calculates the compact Singular Value Decomposition of a matrix.SparseFieldMatrix<T extends FieldElement<T>>Sparse matrix implementation based on an open addressed map.SparseFieldVector<T extends FieldElement<T>>This class implements theFieldVectorinterface with aOpenIntToFieldHashMapbacking store.Marker interface forRealMatriximplementations that require sparse backing storageMarker class for RealVectors that require sparse backing storageImplementation of the SYMMLQ iterative linear solver proposed by Paige and Saunders (1975).