package mikera.matrixx.decompose;

import mikera.matrixx.impl.PermutationMatrix;

/**
 * Interface for results of LUP decomposition

 * 

 * LUP Decomposition refactors the original matrix such that:

 * 
 PT*L*U = A
 where P is a pivot matrix, L
 * is a lower triangular matrix, U is an upper triangular matrix and A is the
 * original matrix.
 * 

 * 

 * 

 * LUP Decomposition is useful since once the decomposition has been performed
 * linear equations can be quickly solved and the original matrix A inverted.
 * Different algorithms can be selected to perform the decomposition, all will
 * have the same end result.
 * 
 *
 * @author Peter Abeles
 */
public interface ILUPResult extends ILUResult {
	
	  /**
	   * 

	   * Returns the P matrix from the decomposition.
	   * 
	   *
	   * @return The P matrix.
	   */
	  public PermutationMatrix getP();

}