/**
* Set the element (<i>i,j</i>)
- * to <tt>value</tt>. Throws an
+ * to @arg value. Throws an
* error if the entry does not
* exist. Still, it is allowed to
* store zero values in
const PetscScalar value);
/**
- * Add <tt>value</tt> to the
+ * Add @arg value to the
* element (<i>i,j</i>). Throws
* an error if the entry does not
* exist. Still, it is allowed to
* the residual is defined to be
* <i>r=b-Mx</i>. Write the
* residual into
- * <tt>dst</tt>. The
+ * @arg dst. The
* <i>l<sub>2</sub></i> norm of
* the residual vector is
* returned.
/**
* STL-like iterator with the
- * first entry of row <tt>r</tt>.
+ * first entry of row @arg r.
*/
const_iterator begin (const unsigned int r) const;
/**
* Final iterator of row
- * <tt>r</tt>.
+ * @arg r.
*/
const_iterator end (const unsigned int r) const;
/**
* Create a sparse matrix of dimensions
- * <tt>m</tt> times <tt>n</tt>, with an
+ * @arg m times @arg n, with an
* initial guess of
- * <tt>n_nonzero_per_row</tt> nonzero
+ * @arg n_nonzero_per_row nonzero
* elements per row. PETSc is able to
* cope with the situation that more
* than this number of elements is
/**
* Initialize a rectangular matrix with
- * <tt>m</tt> rows and <tt>n</tt>
+ * @arg m rows and @arg n
* columns. The maximal number of
* nonzero entries for each row
* separately is given by the
- * <tt>row_lengths</tt> array.
+ * @arg row_lengths array.
*
* Just as for the other constructors:
* PETSc is able to cope with the