RdCombinatorialVector.java

  1. package org.drip.spaces.tensor;

  2. /*
  3.  * -*- mode: java; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
  4.  */

  5. /*!
  6.  * Copyright (C) 2020 Lakshmi Krishnamurthy
  7.  * Copyright (C) 2019 Lakshmi Krishnamurthy
  8.  * Copyright (C) 2018 Lakshmi Krishnamurthy
  9.  * Copyright (C) 2017 Lakshmi Krishnamurthy
  10.  * Copyright (C) 2016 Lakshmi Krishnamurthy
  11.  * Copyright (C) 2015 Lakshmi Krishnamurthy
  12.  *
  13.  *  This file is part of DROP, an open-source library targeting analytics/risk, transaction cost analytics,
  14.  *      asset liability management analytics, capital, exposure, and margin analytics, valuation adjustment
  15.  *      analytics, and portfolio construction analytics within and across fixed income, credit, commodity,
  16.  *      equity, FX, and structured products. It also includes auxiliary libraries for algorithm support,
  17.  *      numerical analysis, numerical optimization, spline builder, model validation, statistical learning,
  18.  *      and computational support.
  19.  *  
  20.  *      https://lakshmidrip.github.io/DROP/
  21.  *  
  22.  *  DROP is composed of three modules:
  23.  *  
  24.  *  - DROP Product Core - https://lakshmidrip.github.io/DROP-Product-Core/
  25.  *  - DROP Portfolio Core - https://lakshmidrip.github.io/DROP-Portfolio-Core/
  26.  *  - DROP Computational Core - https://lakshmidrip.github.io/DROP-Computational-Core/
  27.  *
  28.  *  DROP Product Core implements libraries for the following:
  29.  *  - Fixed Income Analytics
  30.  *  - Loan Analytics
  31.  *  - Transaction Cost Analytics
  32.  *
  33.  *  DROP Portfolio Core implements libraries for the following:
  34.  *  - Asset Allocation Analytics
  35.  *  - Asset Liability Management Analytics
  36.  *  - Capital Estimation Analytics
  37.  *  - Exposure Analytics
  38.  *  - Margin Analytics
  39.  *  - XVA Analytics
  40.  *
  41.  *  DROP Computational Core implements libraries for the following:
  42.  *  - Algorithm Support
  43.  *  - Computation Support
  44.  *  - Function Analysis
  45.  *  - Model Validation
  46.  *  - Numerical Analysis
  47.  *  - Numerical Optimizer
  48.  *  - Spline Builder
  49.  *  - Statistical Learning
  50.  *
  51.  *  Documentation for DROP is Spread Over:
  52.  *
  53.  *  - Main                     => https://lakshmidrip.github.io/DROP/
  54.  *  - Wiki                     => https://github.com/lakshmiDRIP/DROP/wiki
  55.  *  - GitHub                   => https://github.com/lakshmiDRIP/DROP
  56.  *  - Repo Layout Taxonomy     => https://github.com/lakshmiDRIP/DROP/blob/master/Taxonomy.md
  57.  *  - Javadoc                  => https://lakshmidrip.github.io/DROP/Javadoc/index.html
  58.  *  - Technical Specifications => https://github.com/lakshmiDRIP/DROP/tree/master/Docs/Internal
  59.  *  - Release Versions         => https://lakshmidrip.github.io/DROP/version.html
  60.  *  - Community Credits        => https://lakshmidrip.github.io/DROP/credits.html
  61.  *  - Issues Catalog           => https://github.com/lakshmiDRIP/DROP/issues
  62.  *  - JUnit                    => https://lakshmidrip.github.io/DROP/junit/index.html
  63.  *  - Jacoco                   => https://lakshmidrip.github.io/DROP/jacoco/index.html
  64.  *
  65.  *  Licensed under the Apache License, Version 2.0 (the "License");
  66.  *      you may not use this file except in compliance with the License.
  67.  *  
  68.  *  You may obtain a copy of the License at
  69.  *      http://www.apache.org/licenses/LICENSE-2.0
  70.  *  
  71.  *  Unless required by applicable law or agreed to in writing, software
  72.  *      distributed under the License is distributed on an "AS IS" BASIS,
  73.  *      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  74.  *  
  75.  *  See the License for the specific language governing permissions and
  76.  *      limitations under the License.
  77.  */

  78. /**
  79.  * <i>RdCombinatorialVector</i> exposes the Normed/Non-normed Discrete Spaces with R<sup>d</sup>
  80.  * Combinatorial Vector Elements.
  81.  *
  82.  * <br><br>
  83.  *  <ul>
  84.  *      <li><b>Module </b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/ComputationalCore.md">Computational Core Module</a></li>
  85.  *      <li><b>Library</b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/StatisticalLearningLibrary.md">Statistical Learning Library</a></li>
  86.  *      <li><b>Project</b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/src/main/java/org/drip/spaces/README.md">R<sup>1</sup> and R<sup>d</sup> Vector/Tensor Spaces (Validated and/or Normed), and Function Classes</a></li>
  87.  *      <li><b>Package</b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/src/main/java/org/drip/spaces/tensor/README.md">R<sup>x</sup> Continuous/Combinatorial Tensor Spaces</a></li>
  88.  *  </ul>
  89.  * <br><br>
  90.  *
  91.  * @author Lakshmi Krishnamurthy
  92.  */

  93. public class RdCombinatorialVector extends org.drip.spaces.tensor.RdAggregate {

  94.     /**
  95.      * RdCombinatorialVector Constructor
  96.      *
  97.      * @param aR1CV Array of the Underlying R^1 Combinatorial Vector Spaces
  98.      *
  99.      * @throws java.lang.Exception Thrown if the Inputs are Invalid
  100.      */

  101.     public RdCombinatorialVector (
  102.         final org.drip.spaces.tensor.R1CombinatorialVector[] aR1CV)
  103.         throws java.lang.Exception
  104.     {
  105.         super (aR1CV);
  106.     }

  107.     @Override public org.drip.spaces.tensor.Cardinality cardinality()
  108.     {
  109.         org.drip.spaces.tensor.R1GeneralizedVector[] aR1GV = vectorSpaces();

  110.         int iDimension = aR1GV.length;
  111.         double dblCardinalNumber = 1.;

  112.         for (int i = 0; i < iDimension; ++i)
  113.             dblCardinalNumber *= ((org.drip.spaces.tensor.R1CombinatorialVector)
  114.                 aR1GV[i]).cardinality().number();

  115.         return org.drip.spaces.tensor.Cardinality.CountablyFinite (dblCardinalNumber);
  116.     }

  117.     /**
  118.      * Retrieve the Multidimensional Iterator associated with the Underlying Vector Space
  119.      *
  120.      * @return The Multidimensional Iterator associated with the Underlying Vector Space
  121.      */

  122.     public org.drip.spaces.iterator.RdSpanningCombinatorialIterator iterator()
  123.     {
  124.         org.drip.spaces.tensor.R1GeneralizedVector[] aR1GV = vectorSpaces();

  125.         int iDimension = aR1GV.length;
  126.         org.drip.spaces.tensor.R1CombinatorialVector[] aR1CV = new
  127.             org.drip.spaces.tensor.R1CombinatorialVector[iDimension];

  128.         for (int i = 0; i < iDimension; ++i)
  129.             aR1CV[i] = (org.drip.spaces.tensor.R1CombinatorialVector) aR1GV[i];

  130.         return org.drip.spaces.iterator.RdSpanningCombinatorialIterator.Standard (aR1CV);
  131.     }

  132.     @Override public double[] leftDimensionEdge()
  133.     {
  134.         org.drip.spaces.tensor.R1GeneralizedVector[] aR1GV = vectorSpaces();

  135.         int iDimension = aR1GV.length;
  136.         double[] adblLeftEdge = new double[iDimension];

  137.         for (int i = 0; i < iDimension; ++i)
  138.             adblLeftEdge[i] = ((org.drip.spaces.tensor.R1ContinuousVector) aR1GV[i]).leftEdge();

  139.         return adblLeftEdge;
  140.     }

  141.     @Override public double[] rightDimensionEdge()
  142.     {
  143.         org.drip.spaces.tensor.R1GeneralizedVector[] aR1GV = vectorSpaces();

  144.         int iDimension = aR1GV.length;
  145.         double[] adblRightEdge = new double[iDimension];

  146.         for (int i = 0; i < iDimension; ++i)
  147.             adblRightEdge[i] = ((org.drip.spaces.tensor.R1ContinuousVector) aR1GV[i]).rightEdge();

  148.         return adblRightEdge;
  149.     }

  150.     @Override public double leftEdge()
  151.     {
  152.         double[] adblLeftEdge = leftDimensionEdge();

  153.         int iDimension = adblLeftEdge.length;
  154.         double dblLeftEdge = adblLeftEdge[0];

  155.         for (int i = 1; i < iDimension; ++i) {
  156.             if (dblLeftEdge > adblLeftEdge[i]) dblLeftEdge = adblLeftEdge[i];
  157.         }

  158.         return dblLeftEdge;
  159.     }

  160.     @Override public double rightEdge()
  161.     {
  162.         double[] adblRightEdge = rightDimensionEdge();

  163.         int iDimension = adblRightEdge.length;
  164.         double dblRightEdge = adblRightEdge[0];

  165.         for (int i = 1; i < iDimension; ++i) {
  166.             if (dblRightEdge < adblRightEdge[i]) dblRightEdge = adblRightEdge[i];
  167.         }

  168.         return dblRightEdge;
  169.     }

  170.     @Override public double hyperVolume()
  171.         throws java.lang.Exception
  172.     {
  173.         if (!isPredictorBounded())
  174.             throw new java.lang.Exception ("RdCombinatorialVector::hyperVolume => Space not Bounded");

  175.         double[] adblLeftEdge = leftDimensionEdge();

  176.         double dblHyperVolume = 1.;
  177.         int iDimension = adblLeftEdge.length;

  178.         double[] adblRightEdge = rightDimensionEdge();

  179.         for (int i = 0; i < iDimension; ++i)
  180.             dblHyperVolume *= (adblRightEdge[i] - adblLeftEdge[i]);

  181.         return dblHyperVolume;
  182.     }
  183. }