All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.opengamma.strata.math.impl.function.special.InverseIncompleteGammaFunction Maven / Gradle / Ivy

There is a newer version: 2.12.46
Show newest version
/*
 * Copyright (C) 2009 - present by OpenGamma Inc. and the OpenGamma group of companies
 *
 * Please see distribution for license.
 */
package com.opengamma.strata.math.impl.function.special;

import java.util.function.DoubleBinaryOperator;
import java.util.function.Function;

import com.opengamma.strata.collect.ArgChecker;

/**
 * 
 */
public class InverseIncompleteGammaFunction implements DoubleBinaryOperator {
//TODO either find another implementation or delete this class

  private final Function _lnGamma = new NaturalLogGammaFunction();
  private static final double EPS = 1e-8;

  //-------------------------------------------------------------------------
  @Override
  public double applyAsDouble(double a, double p) {
    ArgChecker.notNegativeOrZero(a, "a");
    ArgChecker.inRangeExclusive(p, 0d, 1d, "p");
    double x;
    double err;
    double t;
    double u;
    double pp, lna1 = 0, afac = 0;
    double a1 = a - 1;
    Function gammaIncomplete = new IncompleteGammaFunction(a);
    double gln = _lnGamma.apply(a);
    if (a > 1) {
      lna1 = Math.log(a1);
      afac = Math.exp(a1 * (lna1 - 1) - gln);
      pp = p < 0.5 ? p : 1 - p;
      t = Math.sqrt(-2 * Math.log(pp));
      x = (2.30753 + t * 0.27061) / (1 + t * (0.99229 + t * 0.04481)) - t;
      if (p < 0.5) {
        x = -x;
      }
      x = Math.max(0.001, a * Math.pow(1 - 1. / (9 * a) - x / (3 * Math.sqrt(a)), 3));
    } else {
      t = 1 - a * (0.253 + a * 0.12);
      if (p < t) {
        x = Math.pow(p / t, 1. / a);
      } else {
        x = 1. - Math.log(1 - (p - t) / (1. - t));
      }
    }
    for (int i = 0; i < 12; i++) {
      if (x <= 0) {
        return 0.;
      }
      err = gammaIncomplete.apply(x) - p;
      if (a > 1) {
        t = afac * Math.exp(-(x - a1) + a1 * (Math.log(x) - lna1));
      } else {
        t = Math.exp(-x + a1 * Math.log(x) - gln);
      }
      u = err / t;
      t = u / (1 - 0.5 * Math.min(1, u * ((a - 1) / x - 1)));
      x -= t;
      if (x <= 0) {
        x = 0.05 * (x + t);
      }
      if (Math.abs(t) < EPS * x) {
        break;
      }
    }
    return x;
  }

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy