def triangularPut(m1d, upper=1, lower=0):
"""Returns 2D masked array with elements of the given 1D array in the strictly upper (lower) triangle.
Elements of the 1D array should be ordered according to the upper triangular part of the 2D matrix.
The lower triangular part (if requested) equals to the transposed upper triangular part.
If upper == lower == 1 a symetric matrix is returned.
"""
assert upper in [0,1] and lower in [0,1], "[0|1] expected for upper / lower"
m1d = MA.asarray(m1d)
assert MA.rank(m1d) == 1, "1D masked array expected"
m2dShape0 = math.ceil(math.sqrt(2*m1d.shape[0]))
assert m1d.shape[0] == m2dShape0*(m2dShape0-1)/2, "the length of m1d does not correspond to n(n-1)/2"
if upper:
if lower:
mask = Numeric.fromfunction(lambda i,j: i==j, (m2dShape0, m2dShape0))
else:
mask = Numeric.fromfunction(lambda i,j: i>=j, (m2dShape0, m2dShape0))
else:
if lower:
mask = Numeric.fromfunction(lambda i,j: i<=j, (m2dShape0, m2dShape0))
else:
mask = Numeric.ones((m2dShape0, m2dShape0))
m2d = MA.ravel(MA.zeros((m2dShape0, m2dShape0), m1d.dtype.char))
condUpperTriang = Numeric.fromfunction(lambda i,j: i<j, (m2dShape0, m2dShape0))
putIndices = Numeric.compress(Numeric.ravel(condUpperTriang), Numeric.arange(0, m2dShape0**2, typecode=Numeric.Int))
MA.put(m2d, putIndices, m1d)
m2d = MA.reshape(m2d, (m2dShape0, m2dShape0))
m2d = MA.where(condUpperTriang, m2d, MA.transpose(m2d))
return MA.array(m2d, mask=Numeric.logical_or(mask, MA.getmaskarray(m2d)))
def triangularGet(m2d, upper=1):
"""Returns 1D masked array with elements from the upper (lower) triangular part of the given matrix.
For a symetric matrix triangularGet(m2d, 0) and triangularGet(m2d, 1) return elements in different order.
"""
assert upper in [0,1], "upper: [0|1] expected"
m2d = MA.asarray(m2d)
assert MA.rank(m2d) == 2, "2D (masked) array expected"
if upper:
takeInd = Numeric.compress(Numeric.ravel(Numeric.fromfunction(lambda i,j: i<j, m2d.shape)), Numeric.arange(0, Numeric.multiply.reduce(m2d.shape), typecode=Numeric.Int))
else:
takeInd = Numeric.compress(Numeric.ravel(Numeric.fromfunction(lambda i,j: i>j, m2d.shape)), Numeric.arange(0, Numeric.multiply.reduce(m2d.shape), typecode=Numeric.Int))
return MA.ravel(m2d).take(takeInd)
def coef_maxCut(self, appxCoef):
"""returns the coefficients different from zero up to the abs. max. coefficient
where the first coefficient is excluded from finding the max.
accepts 2d matrix of coefficients where rows represent different curves
"""
assert len(appxCoef.shape) == 2
k = Numeric.shape(appxCoef)[1]
maxInd = Numeric.argmax(Numeric.absolute(appxCoef[:,1:]),1) + 1
lowDiagOnes = Numeric.fromfunction(lambda i,j: i>=j, (k,k))
coefSelector = Numeric.take(lowDiagOnes, maxInd, 0)
return appxCoef*coefSelector
def coef_maxCut(self, appxCoef):
"""returns the coefficients different from zero up to the abs. max. coefficient
where the first coefficient is excluded from finding the max.
accepts 2d matrix of coefficients where rows represent different curves
"""
assert len(appxCoef.shape) == 2
k = Numeric.shape(appxCoef)[1]
maxInd = Numeric.argmax(Numeric.absolute(appxCoef[:, 1:]), 1) + 1
lowDiagOnes = Numeric.fromfunction(lambda i, j: i >= j, (k, k))
coefSelector = Numeric.take(lowDiagOnes, maxInd, 0)
return appxCoef * coefSelector
def diagonalPut(m1d, m2d):
"""Puts the given 1D masked array into the diagonal of the given 2D masked array and returns a new copy of the 2D array.
"""
m1d = MA.asarray(m1d)
m2d = MA.asarray(m2d)
assert MA.rank(m1d) == 1 and MA.rank(m2d) == 2, "1D and 2D masked array expected"
assert m1d.shape[0] == m2d.shape[0] == m2d.shape[1], "the shape of the given arrays does not match"
putIndices = Numeric.compress(Numeric.ravel(Numeric.fromfunction(lambda i,j: i==j, m2d.shape)), Numeric.arange(0, Numeric.multiply.reduce(m2d.shape), typecode=Numeric.Int))
m2dShape = m2d.shape
m2d = MA.ravel(m2d)
MA.put(m2d, putIndices, m1d)
return MA.reshape(m2d, m2dShape)
