MF_LUsolve
 MD_LUsolve 
ME_LUsolve 
MCF_LUsolve 
MCD_LUsolve 
MCE_LUsolve 

Function  solve a linear system MA * X = B, where MA has already been decomposed into LU form 

Syntax C/C++  #include <MFstd.h>
void MF_LUsolve( fVector X, fMatrix LU, fVector B, uiVector Ind, ui len ); 
C++ MatObj  #include <OptiVec.h>
void vector<T>::LUsolve( const matrix<T>& MLU, const vector<T>& B, const vector<ui>& Ind ); 
Pascal/Delphi  uses MFstd;
procedure MF_LUsolve( X:fVector; MLU:fMatrix; B:fVector; Ind:uiVector;
len:UIntSize ); 

Description  The linear system MA * X = B is solved for the vector X. Instead of MA itself, this function expects the LU decomposed form of MA as the input matrix MLU, along with its rowpermutation indices in the vector Ind as output by MF_LUdecompose.
If the original matrix MA is still available, it is recommended to "finepolish" the result by calling MF_LUimprove. In comparison to the LU decomposition and backsubstitution already performed, this iterative improvement takes very little time, but it can lead to an appreaciable improvement of the solution and often even save solutions which otherwise would be ruined by roundoff error. 

