File: sparse_full.html

package info (click to toggle)
freemat 4.0-3
  • links: PTS, VCS
  • area: main
  • in suites: squeeze
  • size: 174,756 kB
  • ctags: 67,023
  • sloc: cpp: 351,059; ansic: 255,892; sh: 40,590; makefile: 4,387; perl: 4,058; asm: 3,313; pascal: 2,718; fortran: 1,722; ada: 1,681; ml: 1,360; cs: 879; csh: 795; python: 430; sed: 162; lisp: 160; awk: 5
file content (51 lines) | stat: -rw-r--r-- 923 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">

<HTML>
<HEAD>
<TITLE>FULL Convert Sparse Matrix to Full Matrix
</TITLE>
</HEAD>
<BODY>
<H2>FULL Convert Sparse Matrix to Full Matrix
</H2>
<P>
Section: <A HREF=sec_sparse.html> Sparse Matrix Support </A>
<H3>Usage</H3>
Converts a sparse matrix to a full matrix.  The syntax for
its use is
<PRE>
   y = full(x)
</PRE>
<P>
The type of <code>x</code> is preserved.  Be careful with the function.
As a general rule of thumb, if you can work with the <code>full</code>
representation of a function, you probably do not need the
sparse representation.
<H3>Example</H3>
Here we convert a full matrix to a sparse one, and back again.
<PRE>
--&gt; a = [1,0,4,2,0;0,0,0,0,0;0,1,0,0,2]

a = 
 1 0 4 2 0 
 0 0 0 0 0 
 0 1 0 0 2 

--&gt; A = sparse(a)

A = 
 1 1 1
 3 2 1
 1 3 4
 1 4 2
 3 5 2
--&gt; full(A)

ans = 
 1 0 4 2 0 
 0 0 0 0 0 
 0 1 0 0 2 
</PRE>
<P>
</BODY>
</HTML>