Mercurial > hg > octave-thorsten

comparison PROJECTS @ 5610:9761b7d24e9e

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
[project @ 2006-02-09 09:12:02 by dbateman]
author dbateman
date Thu, 09 Feb 2006 09:12:03 +0000
parents b4cfbb0ec8c4
children 3ef490336b4d
comparison
equal deleted inserted replaced
5609:bf96b0f9dbd7 5610:9761b7d24e9e
105 105
106 --------------- 106 ---------------
107 Sparse Matrices: 107 Sparse Matrices:
108 --------------- 108 ---------------
109 109
110 * QR factorization functions, also for use in lssolve functions. Write 110 * Improve QR factorization functions, using idea based on CSPARSE
111 svds function based on this. Write sprank function based on svds. 111 cs_dmsol.m
112 112
113 * Once dmperm is implemented, perhaps use the technique to detect permuted 113 * Implement fourth argument to the sprand and sprandn, and addition
114 triangular matrices with permutations in both rows and cols. 114 arguments to sprandsym that the leading brand implements.
115
116 * Implement fourth argument to the sprand and sprandn that the leading
117 brand implements.
118 115
119 * Sparse logical indexing in idx_vector class so that something like 116 * Sparse logical indexing in idx_vector class so that something like
120 "a=sprandn(1e6,1e6,1e-6); a(a<1) = 0" won't cause a memory overflow. 117 "a=sprandn(1e6,1e6,1e-6); a(a<1) = 0" won't cause a memory overflow.
121 118
122 * Write the rest of the sparse docs 119 * Write the rest of the sparse docs
123 120
124 * The algo in TOMS 582 is perfect for symrcm function. However, this is 121 * The algo in TOMS 582 is perfect for symrcm function. However, this is
125 under the ACM license and can't be used in a GPL program. 122 under the ACM license and can't be used in a GPL program.
126 123
127 An alternative is that PETSC is GPL compatiable and has a symrcm 124 An alternative is that PETSC is GPL compatiable and has a symrcm
128 implemented from the original SPARSPAK. Its not clear that this is 125 implemented from the original SPARSPAK. Its not clear that this is
129 legal to me as I have found no clarification of the original license 126 legal to me as I have found no clarification of the original license
130 of SPARSPAK. As PETSC has had this code for over 10 years without 127 of SPARSPAK. As PETSC has had this code for over 10 years without
131 problem, we can perhaps assume that there is no issues. Maybe need 128 problem, we can perhaps assume that there are no issues. Maybe need
132 to contact PETSC people or the SPARSPAK people at uni of waterloo 129 to contact PETSC people or the SPARSPAK people at uni of waterloo
133 to check issues. 130 to check issues.
134 131
135 * Make spalloc(r,c,n) actually create an empty sparse with n non-zero 132 * Make spalloc(r,c,n) actually create an empty sparse with n non-zero
136 elements? This allows something like 133 elements? This allows something like
153 might easily be made to have the correct behaviour, the first assign 150 might easily be made to have the correct behaviour, the first assign
154 will cause the matrix to be resized !!! There seems to be no simple 151 will cause the matrix to be resized !!! There seems to be no simple
155 way to treat this but a complete rewrite of the sparse assignment 152 way to treat this but a complete rewrite of the sparse assignment
156 functions... 153 functions...
157 154
158 * Port the sparse testing code into the DejaGNU testing code. Add tests
159 for spkron, matrix_type, luinc..
160
161 * Other missing Functions 155 * Other missing Functions
162 - eigs 156 - eigs
163 - dmperm Use Tim Davis' BTF code when available
164 - symmmd Superseded by symamd 157 - symmmd Superseded by symamd
165 - colmmd Superseded by colamd 158 - colmmd Superseded by colamd
166 - sprandsym
167 - etreeplot
168 - treeplot
169 - gplot
170 - treelayout 159 - treelayout
171 - cholinc 160 - cholinc
172 - condest 161 - condest
173 - normest 162 - normest
174 - bicg 163 - bicg