| | |
- __builtin__.list(__builtin__.object)
-
- Table
-
- Matrix
-
- Square
-
- Triangular
-
- LowerTri
- UpperTri
- Vec
class LowerTri(Triangular) |
| | |
- Method resolution order:
- LowerTri
- Triangular
- Square
- Matrix
- Table
- __builtin__.list
- __builtin__.object
Methods inherited from Triangular:
- det(self)
- eigs(self)
Methods inherited from Square:
- __pow__(self, exp)
- Raise a square matrix to an integer power (i.e. A**3 is the same as A.mmul(A.mmul(A))
- hessenberg(self)
- Householder reduction to Hessenberg Form (zeroes below the diagonal)
while keeping the same eigenvalues as self.
- inverse(self)
- lu(self)
- Factor a square matrix into lower and upper triangular form such that L.mmul(U)==A
Methods inherited from Matrix:
- __init__(self, elems)
- Form a matrix from a list of lists or a list of Vecs
- augment(self, otherMat)
- Make a new matrix with the two original matrices laid side by side
- diag(self)
- Return a vector composed of elements on the matrix diagonal
- mmul(self, other)
- Matrix multiply by another matrix or a column vector
- qr(self, ROnly=0)
- QR decomposition using Householder reflections: Q*R==self, Q.tr()*Q==I(n), R upper triangular
- rank(self)
- solve(self, b)
- Divide matrix into a column vector or matrix and iterate to improve the solution
- star(self)
- Return the Hermetian adjoint so that Star[i][j] = Original[j][i].conjugate()
- tr(self)
- Tranpose elements so that Transposed[i][j] = Original[j][i]
- trace(self)
Data descriptors inherited from Matrix:
- cols
- rows
- size
Methods inherited from Table:
- __abs__(self)
- __add__(self, rhs)
- __div__(self, rhs)
- __eq__(self, rhs)
- __getslice__(self, i, j)
- __hash__(self)
- __mul__(self, rhs)
- __neg__(self)
- __radd__(self, lhs)
- __rdiv__(self, lhs)
- __rmul__(self, lhs)
- __rsub__(self, lhs)
- __str__(self)
- __sub__(self, rhs)
- conjugate(self)
- exists(self, predicate)
- flatten(self)
- forall(self, predicate)
- imag(self)
- makehash(self)
- # by Rick van der Meiden 2007-01-25
# Tables and it's subclasses can now be used
# in sets and dictionaries, but please be
# careful with mutations. It is possible
# to compute a new __hash__ by calling
# makehash()
- map(self, op, rhs=None)
- Apply a unary operator to every element in the matrix or a binary operator to corresponding
elements in two arrays. If the dimensions are different, broadcast the smaller dimension over
the larger (i.e. match a scalar to every element in a vector or a vector to a matrix).
- prod(self)
- real(self)
- sum(self)
Data descriptors inherited from Table:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
Data and other attributes inherited from Table:
- dim = 1
Methods inherited from __builtin__.list:
- __contains__(...)
- x.__contains__(y) <==> y in x
- __delitem__(...)
- x.__delitem__(y) <==> del x[y]
- __delslice__(...)
- x.__delslice__(i, j) <==> del x[i:j]
Use of negative indices is not supported.
- __ge__(...)
- x.__ge__(y) <==> x>=y
- __getattribute__(...)
- x.__getattribute__('name') <==> x.name
- __getitem__(...)
- x.__getitem__(y) <==> x[y]
- __gt__(...)
- x.__gt__(y) <==> x>y
- __iadd__(...)
- x.__iadd__(y) <==> x+=y
- __imul__(...)
- x.__imul__(y) <==> x*=y
- __iter__(...)
- x.__iter__() <==> iter(x)
- __le__(...)
- x.__le__(y) <==> x<=y
- __len__(...)
- x.__len__() <==> len(x)
- __lt__(...)
- x.__lt__(y) <==> x<y
- __ne__(...)
- x.__ne__(y) <==> x!=y
- __repr__(...)
- x.__repr__() <==> repr(x)
- __reversed__(...)
- L.__reversed__() -- return a reverse iterator over the list
- __setitem__(...)
- x.__setitem__(i, y) <==> x[i]=y
- __setslice__(...)
- x.__setslice__(i, j, y) <==> x[i:j]=y
Use of negative indices is not supported.
- append(...)
- L.append(object) -- append object to end
- concat = __add__(...)
- x.__add__(y) <==> x+y
- count(...)
- L.count(value) -> integer -- return number of occurrences of value
- extend(...)
- L.extend(iterable) -- extend list by appending elements from the iterable
- index(...)
- L.index(value, [start, [stop]]) -> integer -- return first index of value
- insert(...)
- L.insert(index, object) -- insert object before index
- pop(...)
- L.pop([index]) -> item -- remove and return item at index (default last)
- remove(...)
- L.remove(value) -- remove first occurrence of value
- reverse(...)
- L.reverse() -- reverse *IN PLACE*
- sort(...)
- L.sort(cmp=None, key=None, reverse=False) -- stable sort *IN PLACE*;
cmp(x, y) -> -1, 0, 1
Data and other attributes inherited from __builtin__.list:
- __new__ = <built-in method __new__ of type object at 0x814a120>
- T.__new__(S, ...) -> a new object with type S, a subtype of T
|
class Matrix(Table) |
| | |
- Method resolution order:
- Matrix
- Table
- __builtin__.list
- __builtin__.object
Methods defined here:
- __init__(self, elems)
- Form a matrix from a list of lists or a list of Vecs
- augment(self, otherMat)
- Make a new matrix with the two original matrices laid side by side
- diag(self)
- Return a vector composed of elements on the matrix diagonal
- mmul(self, other)
- Matrix multiply by another matrix or a column vector
- qr(self, ROnly=0)
- QR decomposition using Householder reflections: Q*R==self, Q.tr()*Q==I(n), R upper triangular
- rank(self)
- solve(self, b)
- Divide matrix into a column vector or matrix and iterate to improve the solution
- star(self)
- Return the Hermetian adjoint so that Star[i][j] = Original[j][i].conjugate()
- tr(self)
- Tranpose elements so that Transposed[i][j] = Original[j][i]
- trace(self)
Data descriptors defined here:
- cols
- rows
- size
Methods inherited from Table:
- __abs__(self)
- __add__(self, rhs)
- __div__(self, rhs)
- __eq__(self, rhs)
- __getslice__(self, i, j)
- __hash__(self)
- __mul__(self, rhs)
- __neg__(self)
- __radd__(self, lhs)
- __rdiv__(self, lhs)
- __rmul__(self, lhs)
- __rsub__(self, lhs)
- __str__(self)
- __sub__(self, rhs)
- conjugate(self)
- exists(self, predicate)
- flatten(self)
- forall(self, predicate)
- imag(self)
- makehash(self)
- # by Rick van der Meiden 2007-01-25
# Tables and it's subclasses can now be used
# in sets and dictionaries, but please be
# careful with mutations. It is possible
# to compute a new __hash__ by calling
# makehash()
- map(self, op, rhs=None)
- Apply a unary operator to every element in the matrix or a binary operator to corresponding
elements in two arrays. If the dimensions are different, broadcast the smaller dimension over
the larger (i.e. match a scalar to every element in a vector or a vector to a matrix).
- prod(self)
- real(self)
- sum(self)
Data descriptors inherited from Table:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
Data and other attributes inherited from Table:
- dim = 1
Methods inherited from __builtin__.list:
- __contains__(...)
- x.__contains__(y) <==> y in x
- __delitem__(...)
- x.__delitem__(y) <==> del x[y]
- __delslice__(...)
- x.__delslice__(i, j) <==> del x[i:j]
Use of negative indices is not supported.
- __ge__(...)
- x.__ge__(y) <==> x>=y
- __getattribute__(...)
- x.__getattribute__('name') <==> x.name
- __getitem__(...)
- x.__getitem__(y) <==> x[y]
- __gt__(...)
- x.__gt__(y) <==> x>y
- __iadd__(...)
- x.__iadd__(y) <==> x+=y
- __imul__(...)
- x.__imul__(y) <==> x*=y
- __iter__(...)
- x.__iter__() <==> iter(x)
- __le__(...)
- x.__le__(y) <==> x<=y
- __len__(...)
- x.__len__() <==> len(x)
- __lt__(...)
- x.__lt__(y) <==> x<y
- __ne__(...)
- x.__ne__(y) <==> x!=y
- __repr__(...)
- x.__repr__() <==> repr(x)
- __reversed__(...)
- L.__reversed__() -- return a reverse iterator over the list
- __setitem__(...)
- x.__setitem__(i, y) <==> x[i]=y
- __setslice__(...)
- x.__setslice__(i, j, y) <==> x[i:j]=y
Use of negative indices is not supported.
- append(...)
- L.append(object) -- append object to end
- concat = __add__(...)
- x.__add__(y) <==> x+y
- count(...)
- L.count(value) -> integer -- return number of occurrences of value
- extend(...)
- L.extend(iterable) -- extend list by appending elements from the iterable
- index(...)
- L.index(value, [start, [stop]]) -> integer -- return first index of value
- insert(...)
- L.insert(index, object) -- insert object before index
- pop(...)
- L.pop([index]) -> item -- remove and return item at index (default last)
- remove(...)
- L.remove(value) -- remove first occurrence of value
- reverse(...)
- L.reverse() -- reverse *IN PLACE*
- sort(...)
- L.sort(cmp=None, key=None, reverse=False) -- stable sort *IN PLACE*;
cmp(x, y) -> -1, 0, 1
Data and other attributes inherited from __builtin__.list:
- __new__ = <built-in method __new__ of type object at 0x814a120>
- T.__new__(S, ...) -> a new object with type S, a subtype of T
|
class Square(Matrix) |
| | |
- Method resolution order:
- Square
- Matrix
- Table
- __builtin__.list
- __builtin__.object
Methods defined here:
- __pow__(self, exp)
- Raise a square matrix to an integer power (i.e. A**3 is the same as A.mmul(A.mmul(A))
- det(self)
- eigs(self)
- Estimate principal eigenvalues using the QR with shifts method
- hessenberg(self)
- Householder reduction to Hessenberg Form (zeroes below the diagonal)
while keeping the same eigenvalues as self.
- inverse(self)
- lu(self)
- Factor a square matrix into lower and upper triangular form such that L.mmul(U)==A
Methods inherited from Matrix:
- __init__(self, elems)
- Form a matrix from a list of lists or a list of Vecs
- augment(self, otherMat)
- Make a new matrix with the two original matrices laid side by side
- diag(self)
- Return a vector composed of elements on the matrix diagonal
- mmul(self, other)
- Matrix multiply by another matrix or a column vector
- qr(self, ROnly=0)
- QR decomposition using Householder reflections: Q*R==self, Q.tr()*Q==I(n), R upper triangular
- rank(self)
- solve(self, b)
- Divide matrix into a column vector or matrix and iterate to improve the solution
- star(self)
- Return the Hermetian adjoint so that Star[i][j] = Original[j][i].conjugate()
- tr(self)
- Tranpose elements so that Transposed[i][j] = Original[j][i]
- trace(self)
Data descriptors inherited from Matrix:
- cols
- rows
- size
Methods inherited from Table:
- __abs__(self)
- __add__(self, rhs)
- __div__(self, rhs)
- __eq__(self, rhs)
- __getslice__(self, i, j)
- __hash__(self)
- __mul__(self, rhs)
- __neg__(self)
- __radd__(self, lhs)
- __rdiv__(self, lhs)
- __rmul__(self, lhs)
- __rsub__(self, lhs)
- __str__(self)
- __sub__(self, rhs)
- conjugate(self)
- exists(self, predicate)
- flatten(self)
- forall(self, predicate)
- imag(self)
- makehash(self)
- # by Rick van der Meiden 2007-01-25
# Tables and it's subclasses can now be used
# in sets and dictionaries, but please be
# careful with mutations. It is possible
# to compute a new __hash__ by calling
# makehash()
- map(self, op, rhs=None)
- Apply a unary operator to every element in the matrix or a binary operator to corresponding
elements in two arrays. If the dimensions are different, broadcast the smaller dimension over
the larger (i.e. match a scalar to every element in a vector or a vector to a matrix).
- prod(self)
- real(self)
- sum(self)
Data descriptors inherited from Table:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
Data and other attributes inherited from Table:
- dim = 1
Methods inherited from __builtin__.list:
- __contains__(...)
- x.__contains__(y) <==> y in x
- __delitem__(...)
- x.__delitem__(y) <==> del x[y]
- __delslice__(...)
- x.__delslice__(i, j) <==> del x[i:j]
Use of negative indices is not supported.
- __ge__(...)
- x.__ge__(y) <==> x>=y
- __getattribute__(...)
- x.__getattribute__('name') <==> x.name
- __getitem__(...)
- x.__getitem__(y) <==> x[y]
- __gt__(...)
- x.__gt__(y) <==> x>y
- __iadd__(...)
- x.__iadd__(y) <==> x+=y
- __imul__(...)
- x.__imul__(y) <==> x*=y
- __iter__(...)
- x.__iter__() <==> iter(x)
- __le__(...)
- x.__le__(y) <==> x<=y
- __len__(...)
- x.__len__() <==> len(x)
- __lt__(...)
- x.__lt__(y) <==> x<y
- __ne__(...)
- x.__ne__(y) <==> x!=y
- __repr__(...)
- x.__repr__() <==> repr(x)
- __reversed__(...)
- L.__reversed__() -- return a reverse iterator over the list
- __setitem__(...)
- x.__setitem__(i, y) <==> x[i]=y
- __setslice__(...)
- x.__setslice__(i, j, y) <==> x[i:j]=y
Use of negative indices is not supported.
- append(...)
- L.append(object) -- append object to end
- concat = __add__(...)
- x.__add__(y) <==> x+y
- count(...)
- L.count(value) -> integer -- return number of occurrences of value
- extend(...)
- L.extend(iterable) -- extend list by appending elements from the iterable
- index(...)
- L.index(value, [start, [stop]]) -> integer -- return first index of value
- insert(...)
- L.insert(index, object) -- insert object before index
- pop(...)
- L.pop([index]) -> item -- remove and return item at index (default last)
- remove(...)
- L.remove(value) -- remove first occurrence of value
- reverse(...)
- L.reverse() -- reverse *IN PLACE*
- sort(...)
- L.sort(cmp=None, key=None, reverse=False) -- stable sort *IN PLACE*;
cmp(x, y) -> -1, 0, 1
Data and other attributes inherited from __builtin__.list:
- __new__ = <built-in method __new__ of type object at 0x814a120>
- T.__new__(S, ...) -> a new object with type S, a subtype of T
|
class Table(__builtin__.list) |
| | |
- Method resolution order:
- Table
- __builtin__.list
- __builtin__.object
Methods defined here:
- __abs__(self)
- __add__(self, rhs)
- __div__(self, rhs)
- __eq__(self, rhs)
- __getslice__(self, i, j)
- __hash__(self)
- __init__(self, elems)
- __mul__(self, rhs)
- __neg__(self)
- __radd__(self, lhs)
- __rdiv__(self, lhs)
- __rmul__(self, lhs)
- __rsub__(self, lhs)
- __str__(self)
- __sub__(self, rhs)
- conjugate(self)
- exists(self, predicate)
- flatten(self)
- forall(self, predicate)
- imag(self)
- makehash(self)
- # by Rick van der Meiden 2007-01-25
# Tables and it's subclasses can now be used
# in sets and dictionaries, but please be
# careful with mutations. It is possible
# to compute a new __hash__ by calling
# makehash()
- map(self, op, rhs=None)
- Apply a unary operator to every element in the matrix or a binary operator to corresponding
elements in two arrays. If the dimensions are different, broadcast the smaller dimension over
the larger (i.e. match a scalar to every element in a vector or a vector to a matrix).
- prod(self)
- real(self)
- sum(self)
Data descriptors defined here:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
Data and other attributes defined here:
- dim = 1
Methods inherited from __builtin__.list:
- __contains__(...)
- x.__contains__(y) <==> y in x
- __delitem__(...)
- x.__delitem__(y) <==> del x[y]
- __delslice__(...)
- x.__delslice__(i, j) <==> del x[i:j]
Use of negative indices is not supported.
- __ge__(...)
- x.__ge__(y) <==> x>=y
- __getattribute__(...)
- x.__getattribute__('name') <==> x.name
- __getitem__(...)
- x.__getitem__(y) <==> x[y]
- __gt__(...)
- x.__gt__(y) <==> x>y
- __iadd__(...)
- x.__iadd__(y) <==> x+=y
- __imul__(...)
- x.__imul__(y) <==> x*=y
- __iter__(...)
- x.__iter__() <==> iter(x)
- __le__(...)
- x.__le__(y) <==> x<=y
- __len__(...)
- x.__len__() <==> len(x)
- __lt__(...)
- x.__lt__(y) <==> x<y
- __ne__(...)
- x.__ne__(y) <==> x!=y
- __repr__(...)
- x.__repr__() <==> repr(x)
- __reversed__(...)
- L.__reversed__() -- return a reverse iterator over the list
- __setitem__(...)
- x.__setitem__(i, y) <==> x[i]=y
- __setslice__(...)
- x.__setslice__(i, j, y) <==> x[i:j]=y
Use of negative indices is not supported.
- append(...)
- L.append(object) -- append object to end
- concat = __add__(...)
- x.__add__(y) <==> x+y
- count(...)
- L.count(value) -> integer -- return number of occurrences of value
- extend(...)
- L.extend(iterable) -- extend list by appending elements from the iterable
- index(...)
- L.index(value, [start, [stop]]) -> integer -- return first index of value
- insert(...)
- L.insert(index, object) -- insert object before index
- pop(...)
- L.pop([index]) -> item -- remove and return item at index (default last)
- remove(...)
- L.remove(value) -- remove first occurrence of value
- reverse(...)
- L.reverse() -- reverse *IN PLACE*
- sort(...)
- L.sort(cmp=None, key=None, reverse=False) -- stable sort *IN PLACE*;
cmp(x, y) -> -1, 0, 1
Data and other attributes inherited from __builtin__.list:
- __new__ = <built-in method __new__ of type object at 0x814a120>
- T.__new__(S, ...) -> a new object with type S, a subtype of T
|
class Triangular(Square) |
| | |
- Method resolution order:
- Triangular
- Square
- Matrix
- Table
- __builtin__.list
- __builtin__.object
Methods defined here:
- det(self)
- eigs(self)
Methods inherited from Square:
- __pow__(self, exp)
- Raise a square matrix to an integer power (i.e. A**3 is the same as A.mmul(A.mmul(A))
- hessenberg(self)
- Householder reduction to Hessenberg Form (zeroes below the diagonal)
while keeping the same eigenvalues as self.
- inverse(self)
- lu(self)
- Factor a square matrix into lower and upper triangular form such that L.mmul(U)==A
Methods inherited from Matrix:
- __init__(self, elems)
- Form a matrix from a list of lists or a list of Vecs
- augment(self, otherMat)
- Make a new matrix with the two original matrices laid side by side
- diag(self)
- Return a vector composed of elements on the matrix diagonal
- mmul(self, other)
- Matrix multiply by another matrix or a column vector
- qr(self, ROnly=0)
- QR decomposition using Householder reflections: Q*R==self, Q.tr()*Q==I(n), R upper triangular
- rank(self)
- solve(self, b)
- Divide matrix into a column vector or matrix and iterate to improve the solution
- star(self)
- Return the Hermetian adjoint so that Star[i][j] = Original[j][i].conjugate()
- tr(self)
- Tranpose elements so that Transposed[i][j] = Original[j][i]
- trace(self)
Data descriptors inherited from Matrix:
- cols
- rows
- size
Methods inherited from Table:
- __abs__(self)
- __add__(self, rhs)
- __div__(self, rhs)
- __eq__(self, rhs)
- __getslice__(self, i, j)
- __hash__(self)
- __mul__(self, rhs)
- __neg__(self)
- __radd__(self, lhs)
- __rdiv__(self, lhs)
- __rmul__(self, lhs)
- __rsub__(self, lhs)
- __str__(self)
- __sub__(self, rhs)
- conjugate(self)
- exists(self, predicate)
- flatten(self)
- forall(self, predicate)
- imag(self)
- makehash(self)
- # by Rick van der Meiden 2007-01-25
# Tables and it's subclasses can now be used
# in sets and dictionaries, but please be
# careful with mutations. It is possible
# to compute a new __hash__ by calling
# makehash()
- map(self, op, rhs=None)
- Apply a unary operator to every element in the matrix or a binary operator to corresponding
elements in two arrays. If the dimensions are different, broadcast the smaller dimension over
the larger (i.e. match a scalar to every element in a vector or a vector to a matrix).
- prod(self)
- real(self)
- sum(self)
Data descriptors inherited from Table:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
Data and other attributes inherited from Table:
- dim = 1
Methods inherited from __builtin__.list:
- __contains__(...)
- x.__contains__(y) <==> y in x
- __delitem__(...)
- x.__delitem__(y) <==> del x[y]
- __delslice__(...)
- x.__delslice__(i, j) <==> del x[i:j]
Use of negative indices is not supported.
- __ge__(...)
- x.__ge__(y) <==> x>=y
- __getattribute__(...)
- x.__getattribute__('name') <==> x.name
- __getitem__(...)
- x.__getitem__(y) <==> x[y]
- __gt__(...)
- x.__gt__(y) <==> x>y
- __iadd__(...)
- x.__iadd__(y) <==> x+=y
- __imul__(...)
- x.__imul__(y) <==> x*=y
- __iter__(...)
- x.__iter__() <==> iter(x)
- __le__(...)
- x.__le__(y) <==> x<=y
- __len__(...)
- x.__len__() <==> len(x)
- __lt__(...)
- x.__lt__(y) <==> x<y
- __ne__(...)
- x.__ne__(y) <==> x!=y
- __repr__(...)
- x.__repr__() <==> repr(x)
- __reversed__(...)
- L.__reversed__() -- return a reverse iterator over the list
- __setitem__(...)
- x.__setitem__(i, y) <==> x[i]=y
- __setslice__(...)
- x.__setslice__(i, j, y) <==> x[i:j]=y
Use of negative indices is not supported.
- append(...)
- L.append(object) -- append object to end
- concat = __add__(...)
- x.__add__(y) <==> x+y
- count(...)
- L.count(value) -> integer -- return number of occurrences of value
- extend(...)
- L.extend(iterable) -- extend list by appending elements from the iterable
- index(...)
- L.index(value, [start, [stop]]) -> integer -- return first index of value
- insert(...)
- L.insert(index, object) -- insert object before index
- pop(...)
- L.pop([index]) -> item -- remove and return item at index (default last)
- remove(...)
- L.remove(value) -- remove first occurrence of value
- reverse(...)
- L.reverse() -- reverse *IN PLACE*
- sort(...)
- L.sort(cmp=None, key=None, reverse=False) -- stable sort *IN PLACE*;
cmp(x, y) -> -1, 0, 1
Data and other attributes inherited from __builtin__.list:
- __new__ = <built-in method __new__ of type object at 0x814a120>
- T.__new__(S, ...) -> a new object with type S, a subtype of T
|
class UpperTri(Triangular) |
| | |
- Method resolution order:
- UpperTri
- Triangular
- Square
- Matrix
- Table
- __builtin__.list
- __builtin__.object
Methods inherited from Triangular:
- det(self)
- eigs(self)
Methods inherited from Square:
- __pow__(self, exp)
- Raise a square matrix to an integer power (i.e. A**3 is the same as A.mmul(A.mmul(A))
- hessenberg(self)
- Householder reduction to Hessenberg Form (zeroes below the diagonal)
while keeping the same eigenvalues as self.
- inverse(self)
- lu(self)
- Factor a square matrix into lower and upper triangular form such that L.mmul(U)==A
Methods inherited from Matrix:
- __init__(self, elems)
- Form a matrix from a list of lists or a list of Vecs
- augment(self, otherMat)
- Make a new matrix with the two original matrices laid side by side
- diag(self)
- Return a vector composed of elements on the matrix diagonal
- mmul(self, other)
- Matrix multiply by another matrix or a column vector
- qr(self, ROnly=0)
- QR decomposition using Householder reflections: Q*R==self, Q.tr()*Q==I(n), R upper triangular
- rank(self)
- solve(self, b)
- Divide matrix into a column vector or matrix and iterate to improve the solution
- star(self)
- Return the Hermetian adjoint so that Star[i][j] = Original[j][i].conjugate()
- tr(self)
- Tranpose elements so that Transposed[i][j] = Original[j][i]
- trace(self)
Data descriptors inherited from Matrix:
- cols
- rows
- size
Methods inherited from Table:
- __abs__(self)
- __add__(self, rhs)
- __div__(self, rhs)
- __eq__(self, rhs)
- __getslice__(self, i, j)
- __hash__(self)
- __mul__(self, rhs)
- __neg__(self)
- __radd__(self, lhs)
- __rdiv__(self, lhs)
- __rmul__(self, lhs)
- __rsub__(self, lhs)
- __str__(self)
- __sub__(self, rhs)
- conjugate(self)
- exists(self, predicate)
- flatten(self)
- forall(self, predicate)
- imag(self)
- makehash(self)
- # by Rick van der Meiden 2007-01-25
# Tables and it's subclasses can now be used
# in sets and dictionaries, but please be
# careful with mutations. It is possible
# to compute a new __hash__ by calling
# makehash()
- map(self, op, rhs=None)
- Apply a unary operator to every element in the matrix or a binary operator to corresponding
elements in two arrays. If the dimensions are different, broadcast the smaller dimension over
the larger (i.e. match a scalar to every element in a vector or a vector to a matrix).
- prod(self)
- real(self)
- sum(self)
Data descriptors inherited from Table:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
Data and other attributes inherited from Table:
- dim = 1
Methods inherited from __builtin__.list:
- __contains__(...)
- x.__contains__(y) <==> y in x
- __delitem__(...)
- x.__delitem__(y) <==> del x[y]
- __delslice__(...)
- x.__delslice__(i, j) <==> del x[i:j]
Use of negative indices is not supported.
- __ge__(...)
- x.__ge__(y) <==> x>=y
- __getattribute__(...)
- x.__getattribute__('name') <==> x.name
- __getitem__(...)
- x.__getitem__(y) <==> x[y]
- __gt__(...)
- x.__gt__(y) <==> x>y
- __iadd__(...)
- x.__iadd__(y) <==> x+=y
- __imul__(...)
- x.__imul__(y) <==> x*=y
- __iter__(...)
- x.__iter__() <==> iter(x)
- __le__(...)
- x.__le__(y) <==> x<=y
- __len__(...)
- x.__len__() <==> len(x)
- __lt__(...)
- x.__lt__(y) <==> x<y
- __ne__(...)
- x.__ne__(y) <==> x!=y
- __repr__(...)
- x.__repr__() <==> repr(x)
- __reversed__(...)
- L.__reversed__() -- return a reverse iterator over the list
- __setitem__(...)
- x.__setitem__(i, y) <==> x[i]=y
- __setslice__(...)
- x.__setslice__(i, j, y) <==> x[i:j]=y
Use of negative indices is not supported.
- append(...)
- L.append(object) -- append object to end
- concat = __add__(...)
- x.__add__(y) <==> x+y
- count(...)
- L.count(value) -> integer -- return number of occurrences of value
- extend(...)
- L.extend(iterable) -- extend list by appending elements from the iterable
- index(...)
- L.index(value, [start, [stop]]) -> integer -- return first index of value
- insert(...)
- L.insert(index, object) -- insert object before index
- pop(...)
- L.pop([index]) -> item -- remove and return item at index (default last)
- remove(...)
- L.remove(value) -- remove first occurrence of value
- reverse(...)
- L.reverse() -- reverse *IN PLACE*
- sort(...)
- L.sort(cmp=None, key=None, reverse=False) -- stable sort *IN PLACE*;
cmp(x, y) -> -1, 0, 1
Data and other attributes inherited from __builtin__.list:
- __new__ = <built-in method __new__ of type object at 0x814a120>
- T.__new__(S, ...) -> a new object with type S, a subtype of T
|
class Vec(Table) |
| | |
- Method resolution order:
- Vec
- Table
- __builtin__.list
- __builtin__.object
Methods defined here:
- cross(self, otherVec)
- Compute a Vector or Cross Product with another vector
- dot(self, otherVec)
- house(self, index)
- Compute a Householder vector which zeroes all but the index element after a reflection
- norm(self)
- normSquared(self)
- normalize(self)
- outer(self, otherVec)
- polyval(self, x)
- Vec([6,3,4]).polyval(5) evaluates to 6*x**2 + 3*x + 4 at x=5
- ratval(self, x)
- Vec([10,20,30,40,50]).ratfit(5) evaluates to (10*x**2 + 20*x + 30) / (40*x**2 + 50*x + 1) at x=5.
Methods inherited from Table:
- __abs__(self)
- __add__(self, rhs)
- __div__(self, rhs)
- __eq__(self, rhs)
- __getslice__(self, i, j)
- __hash__(self)
- __init__(self, elems)
- __mul__(self, rhs)
- __neg__(self)
- __radd__(self, lhs)
- __rdiv__(self, lhs)
- __rmul__(self, lhs)
- __rsub__(self, lhs)
- __str__(self)
- __sub__(self, rhs)
- conjugate(self)
- exists(self, predicate)
- flatten(self)
- forall(self, predicate)
- imag(self)
- makehash(self)
- # by Rick van der Meiden 2007-01-25
# Tables and it's subclasses can now be used
# in sets and dictionaries, but please be
# careful with mutations. It is possible
# to compute a new __hash__ by calling
# makehash()
- map(self, op, rhs=None)
- Apply a unary operator to every element in the matrix or a binary operator to corresponding
elements in two arrays. If the dimensions are different, broadcast the smaller dimension over
the larger (i.e. match a scalar to every element in a vector or a vector to a matrix).
- prod(self)
- real(self)
- sum(self)
Data descriptors inherited from Table:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
Data and other attributes inherited from Table:
- dim = 1
Methods inherited from __builtin__.list:
- __contains__(...)
- x.__contains__(y) <==> y in x
- __delitem__(...)
- x.__delitem__(y) <==> del x[y]
- __delslice__(...)
- x.__delslice__(i, j) <==> del x[i:j]
Use of negative indices is not supported.
- __ge__(...)
- x.__ge__(y) <==> x>=y
- __getattribute__(...)
- x.__getattribute__('name') <==> x.name
- __getitem__(...)
- x.__getitem__(y) <==> x[y]
- __gt__(...)
- x.__gt__(y) <==> x>y
- __iadd__(...)
- x.__iadd__(y) <==> x+=y
- __imul__(...)
- x.__imul__(y) <==> x*=y
- __iter__(...)
- x.__iter__() <==> iter(x)
- __le__(...)
- x.__le__(y) <==> x<=y
- __len__(...)
- x.__len__() <==> len(x)
- __lt__(...)
- x.__lt__(y) <==> x<y
- __ne__(...)
- x.__ne__(y) <==> x!=y
- __repr__(...)
- x.__repr__() <==> repr(x)
- __reversed__(...)
- L.__reversed__() -- return a reverse iterator over the list
- __setitem__(...)
- x.__setitem__(i, y) <==> x[i]=y
- __setslice__(...)
- x.__setslice__(i, j, y) <==> x[i:j]=y
Use of negative indices is not supported.
- append(...)
- L.append(object) -- append object to end
- concat = __add__(...)
- x.__add__(y) <==> x+y
- count(...)
- L.count(value) -> integer -- return number of occurrences of value
- extend(...)
- L.extend(iterable) -- extend list by appending elements from the iterable
- index(...)
- L.index(value, [start, [stop]]) -> integer -- return first index of value
- insert(...)
- L.insert(index, object) -- insert object before index
- pop(...)
- L.pop([index]) -> item -- remove and return item at index (default last)
- remove(...)
- L.remove(value) -- remove first occurrence of value
- reverse(...)
- L.reverse() -- reverse *IN PLACE*
- sort(...)
- L.sort(cmp=None, key=None, reverse=False) -- stable sort *IN PLACE*;
cmp(x, y) -> -1, 0, 1
Data and other attributes inherited from __builtin__.list:
- __new__ = <built-in method __new__ of type object at 0x814a120>
- T.__new__(S, ...) -> a new object with type S, a subtype of T
| |