Sparse Matrices
A generalization of the function `diag'.
Returns a sparse identity matrix.
Compute `f(X)' for the non-zero values of X.
This function has been deprecated.
This function has been deprecated.
Replace the non-zero entries of X with ones.
Generate a random sparse matrix.
Generate a random sparse matrix.
Generate a symmetric random sparse matrix.
returns a full storage matrix from a sparse one
Returns an empty sparse matrix of size R-by-C.
Create a sparse matrix from the full matrix or row, column, value
triplets.
This function converts for a simple sparse matrix format easily
produced by other programs into Octave's internal sparse format.
Return 1 if the value of the expression EXPR is a sparse matrix.
Returns the number of non zero elements in A.
Returns a vector of the non-zero values of the sparse matrix S.
Return the amount of storage allocated to the sparse matrix SM.
Return the stats for the non-zero elements of the sparse matrix S.
Plot the sparsity pattern of the sparse matrix X.
Returns the elimination tree for the matrix S.
Plot the elimination tree of the matrix S or `S+S'' if S in
non-symmetric.
Plot a graph defined by A and XY in the graph theory sense.
Produces a graph of tree or forest.
Query or set the internal variable that controls whether Octave will
automatically mutate sparse matrices to real matrices to save memory.
Returns the approximate minimum degree permutation of a matrix.
Constrained column approximate minimum degree permutation.
Column approximate minimum degree permutation.
Returns the column permutations such that the columns of `S (:, P)' are
ordered in terms of increase number of non-zero elements.
For a symmetric positive definite matrix S, returns the permutation
vector P such that `S(P,P)' tends to have a sparser Cholesky factor
than S.
Perform a Dulmage-Mendelsohn permutation on the sparse matrix S.
For a symmetric positive definite matrix S, returns the permutation
vector p such that `S (P, P)' tends to have a sparser Cholesky factor
than S.
Symmetric reverse Cuthill-McKee permutation of S.
Estimate the 2-norm of the matrix A using a power series analysis.
Estimate the 1-norm condition number of a matrix matrix A using T test
vectors using a randomized 1-norm estimator.
Sets or displays the parameters used by the sparse solvers and
factorization functions.
Calculates the structural rank of a sparse matrix S.
Performs a symbolic factorization analysis on the sparse matrix S.
Creates the augmented matrix of A.
Solves the linear system of equations `A * X = B' by means of the
Preconditioned Conjugate Gradient iterative method.
Solves the linear system of equations `A * X = B' by means of the
Preconditioned Conjugate Residuals iterative method.
Produce the incomplete LU factorization of the sparse matrix A.