def _initial_nodes(n):
 fit = ((0.49082003 * n) - 4.37859653)
 turnover = around(fit).astype(int)
 ia = arange(1, int((floor((n * 0.5)) + 1)))
 ib = ia[::(-1)]
 xasq = _initial_nodes_a(n, ia[:(turnover + 1)])
 xbsq = _initial_nodes_b(n, ib[(turnover + 1):])
 iv = sqrt(hstack([xasq, xbsq]))
 if ((n % 2) == 1):
  iv = hstack([0.0, iv])
 return iv

def _initial_nodes ( n ) : fit = ( ( 0.49082003 * n ) - 4.37859653 ) turnover = around ( fit ) . astype ( int ) ia = arange ( 1 , int ( ( floor ( ( n * 0.5 ) ) + 1 ) ) ) ib = ia [ : : ( - 1 ) ] xasq = _initial_nodes_a ( n , ia [ : ( turnover + 1 ) ] ) xbsq = _initial_nodes_b ( n , ib [ ( turnover + 1 ) : ] ) iv = sqrt ( hstack ( [ xasq , xbsq ] ) ) if ( ( n % 2 ) == 1 ) : iv = hstack ( [ 0.0 , iv ] ) return iv
initial guesses for the hermite roots computes an initial approximation to the non-negative roots :math:x_k of the hermite polynomial :math:h_n of order :math:n .