Class AlmgrenChriss.Trajectory
java.lang.Object
com.quantfinlib.microstructure.AlmgrenChriss.Trajectory
- Enclosing class:
AlmgrenChriss
The optimal schedule:
holdings[j] is the position after
interval j (holdings[0] = X, holdings[N] = 0); trades[j] is
sold in interval j+1. Costs are in price·shares units versus the
arrival price.-
Constructor Summary
ConstructorsConstructorDescriptionTrajectory(double[] holdings, double[] trades, double kappa, double expectedCost, double costVariance) Creates the value; array and collection arguments are copied. -
Method Summary
Modifier and TypeMethodDescriptiondoublecostVariance.booleandoubleexpectedCost.inthashCode()doubleholdings(int i) Elementiofholdings.double[]A fresh copy ofholdings.intLength ofholdings.doublekappa()kappa.toString()doubletrades(int i) Elementioftrades.double[]A fresh copy oftrades.intLength oftrades.
-
Constructor Details
-
Trajectory
public Trajectory(double[] holdings, double[] trades, double kappa, double expectedCost, double costVariance) Creates the value; array and collection arguments are copied.
-
-
Method Details
-
holdings
public double holdings(int i) Elementiofholdings. -
holdingsLength
public int holdingsLength()Length ofholdings. -
holdingsCopy
public double[] holdingsCopy()A fresh copy ofholdings. -
trades
public double trades(int i) Elementioftrades. -
tradesLength
public int tradesLength()Length oftrades. -
tradesCopy
public double[] tradesCopy()A fresh copy oftrades. -
kappa
public double kappa()kappa. -
expectedCost
public double expectedCost()expectedCost. -
costVariance
public double costVariance()costVariance. -
equals
-
hashCode
-
toString
-