CompressedSparseForm - Maple Help

Online Help

All Products    Maple    MapleSim


LinearAlgebra

  

CompressedSparseForm

  

compute compressed sparse row and column forms

 

Calling Sequence

Parameters

Options

Description

Examples

Compatibility

Calling Sequence

CompressedSparseForm(A, opts)

Parameters

A

-

sparse Matrix with hardware data type

opts

-

optional equations controlling the details of the computation

Options

• 

form = row or form = column

  

This option determines whether the compressed sparse column form or the compressed sparse row form is returned. The default is compressed sparse column form.

• 

output = CB or R or X or a list of these values

  

If output is set to CB, then only CB is returned. Similarly for R and X. If a list of these values is selected, then Maple returns the corresponding values in that order, as an expression sequence. The default value is [CB, R, X]: return the sequence of all three Vectors.

• 

cbbase = posint

• 

rbase = posint

  

These options determines at what number Maple starts numbering the rows and columns. The default is 1, corresponding to the standard Maple convention. Other values, in particular 0, are mainly useful if the result is passed to external code.

  

The setting of cbbase changes the values in CB: it changes the start of indexing into R and X. The setting of rbase changes the values in R: it changes the start of indexing into A.

Description

• 

The CompressedSparseForm function computes either the compressed sparse row form or the compressed sparse column form of the input Matrix A, which needs to have one of the hardware data types. It thus performs the opposite function to FromCompressedSparseForm.

• 

The compressed sparse column form of an n by m Matrix A with k nonzero entries consists of three Vectors, CB, R, and X. These are obtained by sorting the k nonzero entries of A first by column, and then within each column sorting the entries by row. Now X is the k-element Vector of these nonzero values in A in this order, and R is the k-element Vector of row indices at which these values occur. CB is an n+1-element Vector; CBi is the index in both X and R where the ith column starts. We always have CB1=1 and CBn+1=k+1, so that the entries in column i have indices CBi up to, but not including, CBi+1. (If the cbbase option below is used, then CB1=cbbase and CBn+1=k+cbbase and a similar statement holds.)

• 

The compressed sparse row form is very similar, but with the roles of rows and columns interchanged. Specifically, we first sort A by row and then within each row by column; X is still the nonzero values occurring in A. However, R is the k-element Vector of column indices. Similarly, CBi is the index in X and R where the ith row starts.

• 

The compressed sparse forms are most useful for sparse Matrices. If A does not have sparse storage (as determined by rtable_optionX,storage being either sparse or sparseupper or sparselower), then a sparse storage copy is made before determining the compressed sparse form.

• 

If A has any indexing functions (as determined by rtable_indfnsA), then these are bypassed when determining the compressed sparse row or column form: since CompressedSparseForm is a low level command, Maple returns the compressed sparse form of the stored entries only. For example, if a Matrix is defined with option shape=symmetric and storage=sparseupper, then only one of each pair of off-diagonal entries will be represented in the compressed sparse form. However, if A has indexing functions but no sparse storage, then the copy made to give it sparse storage, as explained above, typically gets rid of the indexing function and stores all nonzero entries.

• 

The code for CompressedSparseForm relies on A being a NAG-sparse Matrix (potentially after copying it to give it sparse storage); that is, its datatype as returned by rtable_options needs to be one of these values:

  

sfloat,complexsfloat,integer1,integer2,integer4,integer8,float4,float8,complex8

Examples

withLinearAlgebra:

Let us examine the compressed sparse row and column form of an arbitrary matrix.

mMatrix6,6,1,2=81,2,3=55,2,4=15,3,1=46,3,3=17,3,4=99,3,5=61,4,2=18,4,5=78,5,6=22,datatype=integer4

m0−81000000−55−1500−460−1799−61001800−7800000022000000

(1)

CompressedSparseFormm

124681011,3142323345,−46−8118−55−17−1599−61−7822

(2)

CompressedSparseFormm,form=row

1248101111,2341345256,−81−55−15−46−1799−6118−7822

(3)

CompressedSparseFormm,cbbase=0

01357910,3142323345,−46−8118−55−17−1599−61−7822

(4)

CompressedSparseFormm,rbase=0

124681011,2031212234,−46−8118−55−17−1599−61−7822

(5)

m2Matrix0,1,0,2,0,0,3,0,4,5,6,7,datatype=float

m20.1.0.2.0.0.3.0.4.5.6.7.

(6)

cb,r,xCompressedSparseFormm2

cb,r,x1468,2341434,2.3.5.1.6.4.7.

(7)

We can obtain the entries of r corresponding to the second column as follows.

column2

column2

(8)

rcbcolumn..cbcolumn+11

14

(9)

Similarly for the entries of x.

xcbcolumn..cbcolumn+11

1.6.

(10)

CompressedSparseForm does not work with Matrices that are not of a hardware data type.

m3Matrix3,3,i,jij

m30−1−210−1210

(11)

CompressedSparseFormm3

Error, (in LinearAlgebra:-CompressedSparseForm) cannot compute compressed sparse form of a Matrix with non-hardware datatype anything

To make this work, we need to recreate m3 with, for example, option datatype=integer4.

m3Matrixm3,datatype=integer4

m30−1−210−1210

(12)

cb,r,xCompressedSparseFormm3

cb,r,x1357,231312,12−11−2−1

(13)

Here is an example of the antisymmetric indexing function being ignored.

m4Matrix6,datatype=integer4,shape=antisymmetric,storage=sparselower,i,j`if`iremi+j,2=1,ij,0

m40−10−30−510−10−30010−10−33010−1003010−1503010

(14)

CompressedSparseFormm4

146891010,246354656,135131311

(15)

Compatibility

• 

The LinearAlgebra[CompressedSparseForm] command was introduced in Maple 17.

• 

For more information on Maple 17 changes, see Updates in Maple 17.

See Also

LinearAlgebra[FromCompressedSparseForm]

LinearAlgebra[FromSplitForm]

LinearAlgebra[SplitForm]

rtable_indfns

rtable_options