code: protected DoubleMatrix1D findEqFeasiblePoint(DoubleMatrix2D AMatrix, DoubleMatrix1D bVector) throws Exception {
  		
  		int p = AMatrix.rows();
  		int m = AMatrix.columns();
  		if(m <= p){
  			LogFactory.getLog(this.getClass().getName()).error("Equalities matrix A must be pxn with rank(A) = p < n");
  			throw new RuntimeException("Equalities matrix A must be pxn with rank(A) = p < n");
  		}
  		
  		if(AMatrix instanceof SparseDoubleMatrix2D){
  			QRSparseFactorization qr = new QRSparseFactorization((SparseDoubleMatrix2D)AMatrix);
  			qr.factorize();
  			DoubleMatrix1D x = qr.solve(bVector);		
  			return x;
  		}else{
  			return findEqFeasiblePoint2(AMatrix, bVector);
  		}
  	}
docs: Find a solution of the linear (equalities) system A.x = b.
  A is a pxn matrix, with rank(A) = p < n.
  @see "S.Boyd and L.Vandenberghe, Convex Optimization, p. 682"
  NB: we are waiting for Csparsej to fix its qr decomposition issues.
  @TODO: sign this method with more restrictive class parameters