BigR2Array.java

  1. package org.drip.spaces.big;

  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>BigR2Array</i> contains an Implementation Navigation and Processing Algorithms for Big Double
  80.  * R<sup>2</sup> Arrays.
  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/big/README.md">Big-data In-place Manipulator</a></li>
  88.  *  </ul>
  89.  * <br><br>
  90.  *
  91.  * @author Lakshmi Krishnamurthy
  92.  */

  93. public abstract class BigR2Array {
  94.     private int _iXLength = -1;
  95.     private int _iYLength = -1;
  96.     private double[][] _aadblR2 = null;

  97.     /**
  98.      * BigR2Array Constructor
  99.      *
  100.      * @param aadblR2 2D Big Array Inputs
  101.      *
  102.      * @throws java.lang.Exception Thrown if the Inputs are Invalid
  103.      */

  104.     public BigR2Array (
  105.         final double[][] aadblR2)
  106.         throws java.lang.Exception
  107.     {
  108.         if (null == (_aadblR2 = aadblR2))
  109.             throw new java.lang.Exception ("BigR2Array Constructor => Invalid Inputs");

  110.         if (0 == (_iXLength = _aadblR2.length) || 0 == (_iYLength = _aadblR2[0].length))
  111.             throw new java.lang.Exception ("BigR2Array Constructor => Invalid Inputs");
  112.     }

  113.     /**
  114.      * Compute the Path Response Associated with all the Nodes in the Path up to the Current One.
  115.      *  
  116.      * @param iX The Current X Node
  117.      * @param iY The Current Y Node
  118.      * @param dblPriorPathResponse The Path Product Associated with the Given Prior Navigation Sequence
  119.      *
  120.      * @return The Path Response
  121.      *  
  122.      * @throws java.lang.Exception Thrown if Inputs are Invalid
  123.      */

  124.     abstract public double pathResponse (
  125.         final int iX,
  126.         final int iY,
  127.         final double dblPriorPathResponse)
  128.         throws java.lang.Exception;

  129.     /**
  130.      * Compute the Maximum Response Associated with all the Left/Right Adjacent Paths starting from the Top
  131.      *  Left Node.
  132.      *  
  133.      * @return The Maximum Response Associated with all the Left/Right Adjacent Paths starting from the
  134.      *  Current Node
  135.      *  
  136.      * @throws java.lang.Exception Thrown if Inputs are Invalid
  137.      */

  138.     abstract public double maxPathResponse()
  139.         throws java.lang.Exception;

  140.     /**
  141.      * Retrieve the Length of the X R^1 Array
  142.      *
  143.      * @return The Length of the X R^1 Array
  144.      */

  145.     public int xLength()
  146.     {
  147.         return _iXLength;
  148.     }

  149.     /**
  150.      * Retrieve the Length of the Y R^1 Array
  151.      *
  152.      * @return The Length of the Y R^1 Array
  153.      */

  154.     public int yLength()
  155.     {
  156.         return _iYLength;
  157.     }

  158.     /**
  159.      * Retrieve the R^2 Instance Array
  160.      *
  161.      * @return The R^2 Instance Array
  162.      */

  163.     public double[][] instance()
  164.     {
  165.         return _aadblR2;
  166.     }

  167.     /**
  168.      * Validate the Specified Index Pair.
  169.      *  
  170.      * @param iX The Current X Node
  171.      * @param iY The Current Y Node
  172.      *
  173.      * @return TRUE - The Index Pair is Valid
  174.      */

  175.     public boolean validateIndex (
  176.         final int iX,
  177.         final int iY)
  178.     {
  179.         return iX < 0 || iX >= _iXLength || iY < 0 || iY >= _iYLength ? false : true;
  180.     }

  181.     /**
  182.      * Compute the Maximum Response Associated with all the Left/Right Adjacent Paths starting from the
  183.      *  Current Node.
  184.      *  
  185.      * @param iX The Current X Node
  186.      * @param iY The Current Y Node
  187.      * @param dblPriorPathResponse The Path Response Associated with the Given Prior Navigation Sequence
  188.      *
  189.      * @return The Maximum Response Associated with all the Left/Right Adjacent Paths starting from the
  190.      *  Current Node
  191.      *  
  192.      * @throws java.lang.Exception Thrown if Inputs are Invalid
  193.      */

  194.     public double maxPathResponse (
  195.         final int iX,
  196.         final int iY,
  197.         final double dblPriorPathResponse)
  198.         throws java.lang.Exception
  199.     {
  200.         double dblCurrentPathResponse = pathResponse (iX, iY, dblPriorPathResponse);

  201.         if (iY == _iYLength - 1 && iX == _iXLength - 1) return dblCurrentPathResponse;

  202.         double dblXShiftMaxPathResponse = java.lang.Double.NaN;
  203.         double dblYShiftMaxPathResponse = java.lang.Double.NaN;

  204.         if (iX < _iXLength - 1)
  205.             dblXShiftMaxPathResponse = maxPathResponse (iX + 1, iY, dblCurrentPathResponse);

  206.         if (iY < _iYLength - 1)
  207.             dblYShiftMaxPathResponse = maxPathResponse (iX, iY + 1, dblCurrentPathResponse);

  208.         if (iY == _iYLength - 1) return dblXShiftMaxPathResponse;

  209.         if (iX == _iXLength - 1) return dblYShiftMaxPathResponse;

  210.         return dblXShiftMaxPathResponse > dblYShiftMaxPathResponse ? dblXShiftMaxPathResponse :
  211.             dblYShiftMaxPathResponse;
  212.     }
  213. }