240
edits
(→Development status: added more todos from SWIM2015) |
m (→Development status: QR decomposition has been implemented from the Wikipedia description of the algorithm) |
||
Line 30: | Line 30: | ||
** To be considered in the future: Algorithms can be migrated from the C-XSC Toolbox (C++ code) from [http://www2.math.uni-wuppertal.de/wrswt/xsc/cxsc_new.html] (nlinsys.cpp and cpzero.cpp), however these would need gradient arithmetic and complex arithmetic. | ** To be considered in the future: Algorithms can be migrated from the C-XSC Toolbox (C++ code) from [http://www2.math.uni-wuppertal.de/wrswt/xsc/cxsc_new.html] (nlinsys.cpp and cpzero.cpp), however these would need gradient arithmetic and complex arithmetic. | ||
** Interval version of <code>interp1</code> | ** Interval version of <code>interp1</code> | ||
** Extend <code>subsasgn</code> to allow direct manipulation of inf and sup (and dec) properties. | ** Extend <code>subsasgn</code> to allow direct manipulation of inf and sup (and dec) properties. | ||
>> A = infsup ("[2, 4]"); | >> A = infsup ("[2, 4]"); |
edits