Prototypes

void 
LALInspiralCreateCoarseBank(
                LALStatus            *status, 
                InspiralTemplateList **list, 
                INT4                 *nlist,
                InspiralCoarseBankIn coarseIn)

LALInspiralCreateCoarseBank()

• list, Output, an array containing the template bank parameters
• nlist, Output, the number of templates found by the function
• coarseIn, Input, specifies the search space, range of masses, etc.

The coarse grid algorithm works in two stages: After computing the minimum and maximum chirp-times corresponding to the search space: $(\tau_0^{\rm min}, \tau_0^{\rm max}),$ $(\tau_2^{\rm min}, \tau_2^{\rm max})$ (or^38.3 $(\tau_3^{\rm min}, \tau_3^{\rm max})$) the algorithm

1. chooses a lattice of templates along the equal mass curve and then

2. lays a rectangular grid in the rectangular region defined by the minimum and maximum values of the chirp-times and retain only if (a) the point lies in the parameter space, OR (b) one of the vertices defined by the rectangle lies in the parameter space.