Interval package: Difference between revisions

110 bytes removed ,  27 June 2016
m
→‎Development status: QR decomposition has been implemented from the Wikipedia description of the algorithm
(→‎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>
** The [http://capd.ii.uj.edu.pl/ CAPD package] contains an algorithm for QR factorization. Analyze. Migrate.
** 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]");
240

edits