# SuanShu, a Java numerical and statistical library

Skip navigation links

# Package com.numericalmethod.suanshu.algebra.linear.matrix.doubles.linearsystem

• Interface Summary
Interface Description
LinearSystemSolver.Solution
This is the solution to a linear system of equations.
• Class Summary
Class Description
BackwardSubstitution
Backward substitution solves a matrix equation in the form Ux = b by an iterative process for an upper triangular matrix U.
ForwardSubstitution
Forward substitution solves a matrix equation in the form Lx = b by an iterative process for a lower triangular matrix L.
Kernel
The kernel or null space (also nullspace) of a matrix A is the set of all vectors x for which Ax = 0.
LinearSystemSolver
Solve a system of linear equations in the form: Ax = b, We assume that, after row reduction, A has no more rows than columns.
LSProblem
This is the problem of solving a system of linear equations.
LUSolver
Use LU decomposition to solve Ax = b where A is square and det(A) != 0.
OLSSolver
This class solves an over-determined system of linear equations in the ordinary least square sense.
OLSSolverByQR
This class solves an over-determined system of linear equations in the ordinary least square sense.
OLSSolverBySVD
This class solves an over-determined system of linear equations in the ordinary least square sense.
ThomasAlgorithm
Thomas algorithm is an efficient algorithm to solve a linear tridiagonal matrix equation.
• Enum Summary
Enum Description
Kernel.Method
These are the available methods to compute kernel basis.
• Exception Summary
Exception Description
LinearSystemSolver.NoSolution
This is the runtime exception thrown when it fails to solve a system of linear equations.
Skip navigation links

Copyright © 2010-2018 Numerical Method Incorporation Limited. All Rights Reserved.