Trivial operators - improve documentation

Wrappers/Python/cil/optimisation/operators/IdentityOperator.py

@@ -23,11 +23,17 @@
 
 class IdentityOperator(LinearOperator):
 
-    '''IdentityOperator:  Id: X -> Y,  Id(x) = x\in Y
+    r''' `IdentityOperator`: :math:`\mathrm{Id}: X \rightarrow Y`,  :math:`\mathrm{Id}(x) = x`
 
-                   X : gm_domain
-                   Y : gm_range ( Default: Y = X )
+                   :math:`X` : domain
+                   :math:`Y` : range ( Default: :math:`Y = X` )
 
+    Parameters
+    ----------
+    domain_geometry: CIL Geometry
+        domain of the operator
+    range_geometry: CIL Geometry, optional
+        range of the operator, default: same as domain
     '''
 
 
@@ -42,7 +48,7 @@ def __init__(self, domain_geometry, range_geometry=None):
 
     def direct(self,x,out=None):
 
-        '''Returns Id(x)'''
+        r'''Returns :math:`\mathrm{Id}(x)` '''
 
         if out is None:
             return x.copy()
@@ -52,7 +58,7 @@ def direct(self,x,out=None):
 
     def adjoint(self,x, out=None):
 
-        '''Returns Id(x)'''
+        r'''Returns :math:`\mathrm{Id}(x)=x` '''
 
 
         if out is None:
@@ -63,7 +69,7 @@ def adjoint(self,x, out=None):
 
     def calculate_norm(self, **kwargs):
 
-        '''Evaluates operator norm of IdentityOperator'''
+        '''Evaluates operator norm of  `IdentityOperator`'''
 
         return 1.0
 
@@ -85,8 +91,10 @@ def sum_abs_col(self):
 
     def is_orthogonal(self):
         '''Returns if the operator is orthogonal
+
         Returns
         -------
         `Bool`
+            Always returns `True` for `IdentityOperator`
         '''
         return True 

Wrappers/Python/cil/optimisation/operators/MatrixOperator.py

@@ -22,27 +22,39 @@
 from cil.optimisation.operators import LinearOperator
 
 class MatrixOperator(LinearOperator):
-    """ Matrix wrapped into a LinearOperator
+    r""" Matrix wrapped in a CIL Operator to be used in optimisation algorithms. 
 
-    :param: a numpy matrix
+    Parameters      
+    ----------
+    A: a numpy matrix
+        The matrix to be wrapped into a CIL Operator
 
     """
 
     def __init__(self,A):
-        '''creator
-
-        :param A: numpy ndarray representing a matrix
-        '''
+        """Constructor"""
         self.A = A
         M_A, N_A = self.A.shape
         domain_geometry = VectorGeometry(N_A, dtype=A.dtype)
         range_geometry = VectorGeometry(M_A, dtype=A.dtype)
-        self.s1 = None   # Largest singular value, initially unknown
         super(MatrixOperator, self).__init__(domain_geometry=domain_geometry,
                                                    range_geometry=range_geometry)
 
     def direct(self,x, out=None):
-
+        r"""Returns :math:`Ax`
+
+        Parameters
+        ----------
+        x : DataContainer
+            Input data
+        out : DataContainer, optional
+            Output data, default is None
+        Returns
+        -------
+        DataContainer
+            :math:`Ax`
+        """
+
         if out is None:
             tmp = self.range_geometry().allocate()
             tmp.fill(numpy.dot(self.A,x.as_array()))
@@ -55,6 +67,21 @@ def direct(self,x, out=None):
             return out
 
     def adjoint(self,x, out=None):
+        r"""Returns :math:`A^{T}x`
+
+        Parameters
+        ----------
+        x : DataContainer
+            Input data
+        out : DataContainer, optional
+            Output data, default is None
+
+        Returns
+        -------
+        DataContainer
+            :math:`A^{T}x`
+        """
+
         if out is None:
             tmp = self.domain_geometry().allocate()
             tmp.fill(numpy.dot(self.A.transpose().conjugate(),x.as_array()))
@@ -64,4 +91,6 @@ def adjoint(self,x, out=None):
             return out
 
     def size(self):
+        r"""Returns the shape of the matrix
+        """
         return self.A.shape

Wrappers/Python/cil/optimisation/operators/ZeroOperator.py

@@ -21,16 +21,22 @@
 from cil.optimisation.operators import LinearOperator
 
 class ZeroOperator(LinearOperator):
-    r'''ZeroOperator:  O: X -> Y,  maps any element of :math:`x\in X` into the zero element :math:`\in Y,  O(x) = O_{Y}`
+    r''' `ZeroOperator`:  :math:`\mathrm{O}: X \rightarrow Y`,  maps any element of :math:`x\in X` into the zero element in the space :math:`Y`, so  :math:`\mathrm{O}(x) = \mathrm{O}_{Y}`.
 
-        :param gm_domain: domain of the operator
-        :param gm_range: range of the operator, default: same as domain
+        Parameters
+        ----------
+
+        domain_geometry: CIL Geometry
+            domain of the operator
+        range_geometry: CIL Geometry, optional
+            range of the operator, default: same as domain
 
-        Note:
+        Note
+        -----
 
         .. math::
-                O^{*}: Y^{*} -> X^{*} \text{(Adjoint)}
-                < O(x), y > = < x, O^{*}(y) >
+                O^{*}: Y^{*} -> X^{*} \text{(Adjoint)} \quad \text{such that} \quad
+                \langle O(x), y \rangle = \langle x, O^{*}(y) \rangle
      '''
     def __init__(self, domain_geometry, range_geometry=None):
         if range_geometry is None:
@@ -39,21 +45,21 @@ def __init__(self, domain_geometry, range_geometry=None):
                                            range_geometry=range_geometry)
 
     def direct(self,x,out=None):
-        '''Returns O(x)'''
+        r'''Returns :math:`\mathrm{O}(x)`'''
         if out is None:
             return self.range_geometry().allocate(value=0)
         else:
             out.fill(self.range_geometry().allocate(value=0))
             return out
 
     def adjoint(self,x, out=None):
-        '''Returns O^{*}(y)'''
+        r'''Returns :math:`\mathrm{O}^{*}(y)` '''
         if out is None:
             return self.domain_geometry().allocate(value=0)
         else:
             out.fill(self.domain_geometry().allocate(value=0))
             return out
 
     def calculate_norm(self, **kwargs):
-        '''Evaluates operator norm of ZeroOperator'''
+        r'''Evaluates operator norm of `ZeroOperator`'''
         return 0