lundySequence function

List<num> lundySequence(
  1. num tStart,
  2. num tEnd, {
  3. int iterations = 1000,
})

Returns the sequence: tStart, tStart / (1 + beta * tStart), ..., tStart / (1 * (n-1) * beta * tStart) where beta = (1 / tEnd - 1 / tStart) / (n - 1).

Implementation

List<num> lundySequence(num tStart, num tEnd, {int iterations = 1000}) {
  final beta = (1 / tEnd - 1 / tStart) / (iterations - 1);
  return List<num>.generate(
      iterations, (i) => tStart / (1 + i * beta * tStart));
}