def hessenberg_reduce_1(ctx, A, T):

    n = A.rows

    if n == 1:
        A[0,0] = 1
        return

    A[0,0] = A[1,1] = 1
    A[0,1] = A[1,0] = 0

    for i in xrange(2, n):
        if T[i] != 0:

            for j in xrange(0, i):
                G = T[i] * A[i-1,j]
                for k in xrange(0, i-1):
                    G += A[i,k] * A[k,j]

                A[i-1,j] -= G * ctx.conj(T[i])
                for k in xrange(0, i-1):
                    A[k,j] -= G * ctx.conj(A[i,k])

        A[i,i] = 1
        for j in xrange(0, i):
            A[j,i] = A[i,j] = 0
stepSize tells the step between values. We need to calculate the
dataset/ETHPy150Open fredrik-johansson/mpmath/mpmath/matrices/eigen.py/hessenberg_reduce_1--crossover with--dataset/ETHPy150Open VisTrails/VisTrails/vistrails/gui/mashups/mashups_widgets.py/QSliderWidget.setSingleStep