Synopsis
n = gf_spmat_get(spmat S, 'nnz')
Sm = gf_spmat_get(spmat S, 'full'[, list I[, list J]])
MV = gf_spmat_get(spmat S, 'mult', vec V)
MtV = gf_spmat_get(spmat S, 'tmult', vec V)
D = gf_spmat_get(spmat S, 'diag'[, list E])
s = gf_spmat_get(spmat S, 'storage')
{ni,nj} = gf_spmat_get(spmat S, 'size')
b = gf_spmat_get(spmat S, 'is_complex')
{JC, IR} = gf_spmat_get(spmat S, 'csc_ind')
V = gf_spmat_get(spmat S, 'csc_val')
{N, U0} = gf_spmat_get(spmat S, 'dirichlet nullspace', vec R)
gf_spmat_get(spmat S, 'save', string format, string filename)
s = gf_spmat_get(spmat S, 'char')
gf_spmat_get(spmat S, 'display')
{mantissa_r, mantissa_i, exponent} = gf_spmat_get(spmat S, 'determinant')
Description :
Command list :
n = gf_spmat_get(spmat S, 'nnz')
Return the number of non-null values stored in the sparse matrix.Sm = gf_spmat_get(spmat S, 'full'[, list I[, list J]])
Return a full (sub-)matrix.
The optional arguments <literal>I</literal> and <literal>J</literal>, are the sub-intervals for the rows and columns that are to be extracted.
MV = gf_spmat_get(spmat S, 'mult', vec V)
Product of the sparse matrix <literal>M</literal> with a vector <literal>V</literal>.
For matrix-matrix multiplications, see gf_spmat(‘mult’).
MtV = gf_spmat_get(spmat S, 'tmult', vec V)
Product of <literal>M</literal> transposed (conjugated if <literal>M</literal> is complex) with the vector <literal>V</literal>.D = gf_spmat_get(spmat S, 'diag'[, list E])
Return the diagonal of <literal>M</literal> as a vector.
If <literal>E</literal> is used, return the sub-diagonals whose ranks are given in E.
s = gf_spmat_get(spmat S, 'storage')
Return the storage type currently used for the matrix.
The storage is returned as a string, either ‘CSC’ or ‘WSC’.
{ni,nj} = gf_spmat_get(spmat S, 'size')
Return a vector where <literal>ni</literal> and <literal>nj</literal> are the dimensions of the matrix.b = gf_spmat_get(spmat S, 'is_complex')
Return 1 if the matrix contains complex values.{JC, IR} = gf_spmat_get(spmat S, 'csc_ind')
Return the two usual index arrays of CSC storage.
If <literal>M</literal> is not stored as a CSC matrix, it is converted into CSC.
V = gf_spmat_get(spmat S, 'csc_val')
Return the array of values of all non-zero entries of <literal>M</literal>.
If <literal>M</literal> is not stored as a CSC matrix, it is converted into CSC.
{N, U0} = gf_spmat_get(spmat S, 'dirichlet nullspace', vec R)
Solve the dirichlet conditions <literal>M.U=R</literal>.
A solution <literal>U0</literal> which has a minimum L2-norm is returned, with a sparse matrix <literal>N</literal> containing an orthogonal basis of the kernel of the (assembled) constraints matrix <literal>M</literal> (hence, the PDE linear system should be solved on this subspace): the initial problem
<literal>K.U = B</literal> with constraints <literal>M.U = R</literal>
is replaced by
<literal>(N’.K.N).UU = N’.B</literal> with <literal>U = N.UU + U0</literal>
gf_spmat_get(spmat S, 'save', string format, string filename)
Export the sparse matrix.
the format of the file may be ‘hb’ for Harwell-Boeing, or ‘mm’ for Matrix-Market.
s = gf_spmat_get(spmat S, 'char')
Output a (unique) string representation of the spmat.
This can be used to perform comparisons between two different spmat objects. This function is to be completed.
gf_spmat_get(spmat S, 'display')
displays a short summary for a spmat object.{mantissa_r, mantissa_i, exponent} = gf_spmat_get(spmat S, 'determinant')
returns the matrix determinant calculated using MUMPS.