code: public static boolean cs_cholsol(int order, DZcs A, DZcsa b) {
  		DZcsa x;
  		DZcss S;
  		DZcsn N;
  		int n;
  		boolean ok;
  		if (!CS_CSC (A) || b == null) return (false);	/* check inputs */
  		n = A.n ;
  		S = cs_schol (order, A) ;			/* ordering and symbolic analysis */
  		N = cs_chol (A, S) ;				/* numeric Cholesky factorization */
  		x = new DZcsa (n) ;				/* get workspace */
  		ok = (S != null && N != null && x != null) ;
  		if (ok)
  		{
  			cs_ipvec (S.pinv, b, x, n);		/* x = P*b */
  			cs_lsolve (N.L, x) ;			/* x = L\x */
  			cs_ltsolve (N.L, x) ;			/* x = L'\x */
  			cs_pvec (S.pinv, x, b, n) ;		/* b = P'*x */
  		}
  		return (ok);
  	}
docs: Solves Ax=b where A is symmetric positive definite; b is overwritten with
  solution.
  
  @param order
  ordering method to use (0 or 1)
  @param A
  column-compressed matrix, symmetric positive definite, only
  upper triangular part is used
  @param b
  right hand side, b is overwritten with solution
  @return true if successful, false on error