Mercurial > hg > octave-nkf

comparison PROJECTS @ 5282:5bdc3f24cd5f

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
[project @ 2005-04-14 22:17:26 by dbateman]
author dbateman
date Thu, 14 Apr 2005 22:17:27 +0000
parents 189fe4f85c77
children 22994a5730f9
comparison
equal deleted inserted replaced
5281:f3266e7dbb99 5282:5bdc3f24cd5f
114 svds function based on this. Write sprank function based on svds. 114 svds function based on this. Write sprank function based on svds.
115 115
116 * Once dmperm is implemented, use the technique to detect permuted 116 * Once dmperm is implemented, use the technique to detect permuted
117 triangular matrices. Test the permuted triangular matrix solver code 117 triangular matrices. Test the permuted triangular matrix solver code
118 118
119 * Accelerate the copying of the data from a sparse matrix to a banded matrix
120 in the solvers, that takes a significant portion of the computation time
121 for narrow matrices. This is not obvious, due to the treatment of zero
122 elements in the matrix. Maybe current solution is optimal.
123
124 * Perhaps split the overly long ::solve functions up, either by the type
125 of solver, or seperate factorization functions, so that they can be
126 reused in each of 4 different ::solve functions.
127
128 * Sparse inverse function, based on Andy's code from octave-forge. 119 * Sparse inverse function, based on Andy's code from octave-forge.
129 120
130 * Implement fourth argument to the sprand and sprandn that the leading 121 * Implement fourth argument to the sprand and sprandn that the leading
131 brand implements. 122 brand implements.
132 123
133 * Mapper functions such as real, imag, abs, etc need to be treated, either 124 * Sparse logical indexing in idx_vector class so that something like
134 with a dispatch or by changing the mapper function code. 125 "a=sprandn(1e6,1e6,1e-6); a(a<1) = 0" won't cause a memory overflow.
135 126
136 * Write the rest of the sparse docs 127 * Write the rest of the sparse docs
137 128
138 * The algo in TOMS 582 is perfect for symrcm function. However, this is 129 * The algo in TOMS 582 is perfect for symrcm function. However, this is
139 under the ACM license and can't be used in a GPL program. 130 under the ACM license and can't be used in a GPL program.