[SPAM] Four questions about Sparse matrix and qpsolve

[Adrien Vogt-Schilb]

Hi everybody

I have a 20k x 20k inferior triangular matrix, that I use in a QPsolve

V = -2* TIS(n,n) + (n-1) * eye(n;n)

This is V= [ (n-1) 0.....................0
                    2     (n-1) 0..............0
                     2      2    (n-1) 0......0
                  ....
                 ]
-Is there any way to get a TI matrix from scilab, without using loops?

I would like to use V as a "cost function" for qpsolve (minimize X'.V.X)
-Is qpsolve smart enough to change the basis, or should i do it myself?

-Should I use sparse matrices? Can I make a sparse trinagular matrix 
quickly?

Some student have implemented faster code for sparse matrices in 2004 
(http://www.iecn.u-nancy.fr/~pincon/scilab/expose_taiwan.pdf).
-Is this implemented in Scilab?


-- 

*Adrien Vogt-Schilb*
Research Fellow
vogt at centre-cired.fr
Tel: (+33) 1 43 94 73 96
Fax: (+33) 1 43 94 73 70

CIRED

	

45 bis, Av de la Belle Gabrielle
F-94736 Nogent-sur-Marne
http://www.centre-cired.fr/

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.scilab.org/pipermail/users/attachments/20110906/b5bc1f6c/attachment.htm>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: logocired.png
Type: image/png
Size: 4092 bytes
Desc: not available
URL: <https://lists.scilab.org/pipermail/users/attachments/20110906/b5bc1f6c/attachment.png>