Examples of java.math.BigDecimal.pow()

java.math.BigDecimal.pow()
Returns a {@code BigDecimal} whose value is(thisⁿ), The power is computed exactly, to unlimited precision.
The parameter {@code n} must be in the range 0 through999999999, inclusive. {@code ZERO.pow(0)} returns {@link #ONE}. Note that future releases may expand the allowable exponent range of this method. @param n power to raise this {@code BigDecimal} to. @return thisⁿ @throws ArithmeticException if {@code n} is out of range. @since 1.5

    
    d = new BigDecimal(1.2d, mc);
    d = d.add(d, mc);
    d = d.divide(d, mc);
    d = d.multiply(d, mc);
    d = d.pow(2, mc);
    d = d.round(mc);
    d = d.setScale(1);
    d = d.subtract(d, mc);
  }
}

View Full Code Here

        // The (unspecified) scale/precision of the exponent should have no impact on the returned scale/precision
        // TODO FIXME remove .intValue() so non-integer exponents produce correct results
        // None of the normal Java libraries support BigDecimal.pow(BigDecimal)
        for (int i = 0; i < newHardScores.length; i++) {
            BigDecimal hardScore = hardScores[i]; 
            newHardScores[i] = hardScore.pow(actualExponent.intValue()).setScale(hardScore.scale());
        }
        for (int i = 0; i < newSoftScores.length; i++) {
            BigDecimal softScore = softScores[i]; 
            newSoftScores[i] = softScore.pow(actualExponent.intValue()).setScale(softScore.scale());
        }

View Full Code Here

            BigDecimal hardScore = hardScores[i]; 
            newHardScores[i] = hardScore.pow(actualExponent.intValue()).setScale(hardScore.scale());
        }
        for (int i = 0; i < newSoftScores.length; i++) {
            BigDecimal softScore = softScores[i]; 
            newSoftScores[i] = softScore.pow(actualExponent.intValue()).setScale(softScore.scale());
        }
        return new BendableBigDecimalScore(newHardScores, newSoftScores);
    }


    public BendableBigDecimalScore negate() {

View Full Code Here

          }
          BigDecimal mean = mean(numbers, context);
          List<BigDecimal> squares = new ArrayList<BigDecimal>();
          for (BigDecimal number : numbers) {
              BigDecimal XminMean = number.subtract(mean);
              squares.add(XminMean.pow(2, context));
          }
          BigDecimal sum = sum(squares);
          return sum.divide(new BigDecimal(biasCorrected ? numbers.size() - 1 : numbers.size()), context);


      }

View Full Code Here

                }
            }
            final BigDecimal nP = new BigDecimal(numberOfPoints, mContext);
            BigDecimal tmp1 = pmc.subtract(c.multiply(pc, mContext), mContext);
            tmp1 = tmp1.multiply(nP);
            tmp1 = tmp1.pow(2, mContext);
            BigDecimal tmp2 = c.pow(2, mContext);
            tmp2 = BigDecimal.ONE.subtract(tmp2, mContext);
            tmp2 = tmp2.multiply(two, mContext);
            tmp2 = tmp2.divide(tmp1, mContext);

View Full Code Here

            }


            // 2 / pow(numberOfPoints * pmc, 2);
            final BigDecimal nP = new BigDecimal(numberOfPoints, mContext);
            BigDecimal tmp1 = pmc.multiply(nP, mContext);
            tmp1 = tmp1.pow(2, mContext);
            BigDecimal tmp2 = two.divide(tmp1, mContext);


            points[iMax] = BigDecimal.ZERO;
            weights[iMax] = tmp2;
        }

View Full Code Here

      Number leftNumber = (Number) leftOperand;
      Number rightNumber = (Number) rightOperand;


      if (leftNumber instanceof BigDecimal) {
        BigDecimal leftBigDecimal = NumberUtils.convertNumberToTargetClass(leftNumber, BigDecimal.class);
        return new TypedValue(leftBigDecimal.pow(rightNumber.intValue()));
      }
      else if (leftNumber instanceof BigInteger) {
        BigInteger leftBigInteger = NumberUtils.convertNumberToTargetClass(leftNumber, BigInteger.class);
        return new TypedValue(leftBigInteger.pow(rightNumber.intValue()));
      }

View Full Code Here

    Scanner cin = new Scanner(System.in);
    
    while (cin.hasNext()) {
      BigDecimal x = cin.nextBigDecimal();
      int n = cin.nextInt();
      String rv = x.pow(n).stripTrailingZeros().toPlainString();
      if (rv.startsWith("0.")) {
        rv = rv.substring(1);
      }
      System.out.println(rv);
    }

View Full Code Here

      BigDecimal gridpt = BigDecimal.ONE.divide(nminus1, mc);
      gridpt = gridpt.multiply(new BigDecimal(""+i), mc);
      b[i] = BigDecimal.ZERO;
      for (int j = 0; j < n; j++)  {
        b[i] = b[i].add(coeffs[j].multiply(evaluate(alpha, beta, j, gridpt, mc), mc), mc);
        A[i][j] = gridpt.pow(j, mc);
      }
    }
    
    LinearSolver.geppLinearSolve(A, b, mc);

View Full Code Here

    for (int i = 0; i < n; i++){
      BigDecimal gridpt = BigDecimal.ONE.divide(nminus1, mc);
      gridpt = gridpt.multiply(new BigDecimal(""+i), mc);
      b[i] = BigDecimal.ZERO;
      for (int j = 0; j < n; j++)  {
        b[i] = b[i].add(coeffs[j].multiply(gridpt.pow(j, mc), mc), mc);
        A[i][j] = evaluate(alpha, beta, j, gridpt, mc);
      }
    }
    
    LinearSolver.geppLinearSolve(A, b, mc);

View Full Code Here

0 1

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.