Package sage :: Package linalg :: Module sparse_matrix_pyx :: Class Matrix_modint
[show private | hide private]
[frames | no frames]

Type Matrix_modint

object --+
         |
        Matrix_modint


Method Summary
  __init__(...)
x.__init__(...) initializes x; see x.__class__.__doc__ for signature
  __delitem__(x, y)
x.__delitem__(y) <==> del x[y]
  __getitem__(x, y)
x.__getitem__(y) <==> x[y]
  __new__(T, S, ...)
T.__new__(S, ...) -> a new object with type S, a subtype of T
  __repr__(x)
x.__repr__() <==> repr(x)
  __setitem__(x, i, y)
x.__setitem__(i, y) <==> x[i]=y
  echelon(...)
Replace self by its reduction to reduced row echelon form.
  lift_row_to_dict(...)
Return an associative arrow of pairs n:x where the keys n run through the nonzero positions of the row, and the x are nonzero and of type Integer.
  lift_to_dict(...)
Return an associative arrow of pairs (i,j):x where the keys (i,j) run through the nonzero positions of the matrix and the x are nonzero and of type Integer.
  linear_combination_of_rows(...)
  list(...)
  ncols(...)
  nrows(...)
  pivots(...)
  prime(...)
  randomize(...)
randomize(self, int sparcity, exact=False):
  swap_rows(...)
Swap the rows in positions n1 and n2
    Inherited from object
  __delattr__(...)
x.__delattr__('name') <==> del x.name
  __getattribute__(...)
x.__getattribute__('name') <==> x.name
  __hash__(x)
x.__hash__() <==> hash(x)
  __reduce__(...)
helper for pickle
  __reduce_ex__(...)
helper for pickle
  __setattr__(...)
x.__setattr__('name', value) <==> x.name = value
  __str__(x)
x.__str__() <==> str(x)

Class Variable Summary
member_descriptor nc = <member 'nc' of 'sparse_matrix_pyx.Matrix_modint' o...
member_descriptor nr = <member 'nr' of 'sparse_matrix_pyx.Matrix_modint' o...
member_descriptor p = <member 'p' of 'sparse_matrix_pyx.Matrix_modint' obj...

Method Details

__init__(...)
(Constructor)

x.__init__(...) initializes x; see x.__class__.__doc__ for signature
Overrides:
__builtin__.object.__init__

__delitem__(x, y)
(Index deletion operator)

x.__delitem__(y) <==> del x[y]
Returns:
del x[y]

__getitem__(x, y)
(Indexing operator)

x.__getitem__(y) <==> x[y]
Returns:
x[y]

__new__(T, S, ...)

T.__new__(S, ...) -> a new object with type S, a subtype of T
Returns:
a new object with type S, a subtype of T
Overrides:
__builtin__.object.__new__

__repr__(x)
(Representation operator)

x.__repr__() <==> repr(x)
Returns:
repr(x)
Overrides:
__builtin__.object.__repr__

__setitem__(x, i, y)
(Index assignment operator)

x.__setitem__(i, y) <==> x[i]=y
Returns:
x[i]=y

echelon(...)

Replace self by its reduction to reduced row echelon form. ALGORITHM: We use Gauss elimination, which is slightly intelligent, in these sense that we clear each column using a row with the minimum number of nonzero entries.

lift_row_to_dict(...)

Return an associative arrow of pairs
       n:x
where the keys n run through the nonzero positions of the row,
and the x are nonzero and of type Integer.

lift_to_dict(...)

Return an associative arrow of pairs
       (i,j):x
where the keys (i,j) run through the nonzero positions of the matrix
and the x are nonzero and of type Integer.

randomize(...)

randomize(self, int sparcity, exact=False):

The sparcity is a bound on the number of nonzeros per row.

swap_rows(...)

Swap the rows in positions n1 and n2

Class Variable Details

nc

Type:
member_descriptor
Value:
<member 'nc' of 'sparse_matrix_pyx.Matrix_modint' objects>             

nr

Type:
member_descriptor
Value:
<member 'nr' of 'sparse_matrix_pyx.Matrix_modint' objects>             

p

Type:
member_descriptor
Value:
<member 'p' of 'sparse_matrix_pyx.Matrix_modint' objects>              

Generated by Epydoc 2.1 on Wed May 4 18:06:57 2005 http://epydoc.sf.net