comparison liboctave/SparseQR.cc @ 5775:ace8d8d26933

[project @ 2006-04-24 19:13:06 by jwe]
author jwe
date Mon, 24 Apr 2006 19:13:11 +0000
parents 233d98d95659
children eb90c83b4f91
comparison
equal deleted inserted replaced
5774:e7af222e98b0 5775:ace8d8d26933
66 SparseMatrix 66 SparseMatrix
67 SparseQR::SparseQR_rep::V (void) const 67 SparseQR::SparseQR_rep::V (void) const
68 { 68 {
69 #ifdef HAVE_CXSPARSE 69 #ifdef HAVE_CXSPARSE
70 // Drop zeros from V and sort 70 // Drop zeros from V and sort
71 // XXX FIXME XXX Is the double transpose to sort necessary? 71 // FIXME Is the double transpose to sort necessary?
72 BEGIN_INTERRUPT_IMMEDIATELY_IN_FOREIGN_CODE; 72 BEGIN_INTERRUPT_IMMEDIATELY_IN_FOREIGN_CODE;
73 CXSPARSE_DNAME (_dropzeros) (N->L); 73 CXSPARSE_DNAME (_dropzeros) (N->L);
74 CXSPARSE_DNAME () *D = CXSPARSE_DNAME (_transpose) (N->L, 1); 74 CXSPARSE_DNAME () *D = CXSPARSE_DNAME (_transpose) (N->L, 1);
75 CXSPARSE_DNAME (_spfree) (N->L); 75 CXSPARSE_DNAME (_spfree) (N->L);
76 N->L = CXSPARSE_DNAME (_transpose) (D, 1); 76 N->L = CXSPARSE_DNAME (_transpose) (D, 1);
122 SparseMatrix 122 SparseMatrix
123 SparseQR::SparseQR_rep::R (const bool econ) const 123 SparseQR::SparseQR_rep::R (const bool econ) const
124 { 124 {
125 #ifdef HAVE_CXSPARSE 125 #ifdef HAVE_CXSPARSE
126 // Drop zeros from R and sort 126 // Drop zeros from R and sort
127 // XXX FIXME XXX Is the double transpose to sort necessary? 127 // FIXME Is the double transpose to sort necessary?
128 BEGIN_INTERRUPT_IMMEDIATELY_IN_FOREIGN_CODE; 128 BEGIN_INTERRUPT_IMMEDIATELY_IN_FOREIGN_CODE;
129 CXSPARSE_DNAME (_dropzeros) (N->U); 129 CXSPARSE_DNAME (_dropzeros) (N->U);
130 CXSPARSE_DNAME () *D = CXSPARSE_DNAME (_transpose) (N->U, 1); 130 CXSPARSE_DNAME () *D = CXSPARSE_DNAME (_transpose) (N->U, 1);
131 CXSPARSE_DNAME (_spfree) (N->U); 131 CXSPARSE_DNAME (_spfree) (N->U);
132 N->U = CXSPARSE_DNAME (_transpose) (D, 1); 132 N->U = CXSPARSE_DNAME (_transpose) (D, 1);