Interval package: Difference between revisions
Jump to navigation
Jump to search
m (→Build) |
(→Development status: Added TODOs) |
||
Line 24: | Line 24: | ||
** 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 properties. | |||
>> A = infsup ("[2, 4]"); | |||
>> A.inf = infsup ("[1, 3]") | |||
A = [1, 4] | |||
>> A.inf = 5 | |||
A = [Empty] | |||
** While at it, also allow multiple subscripts in <code>subsasgn</code> | |||
>> A(:)(2:4)(2) = 42; # equivalent to A(3) = 42 | |||
>> A.inf(3) = 42; # also A(3).inf = 42 | |||
>> A.inf.inf = 42 # should produce error? | |||
>> A.inf.sup = 42 # should produce error? | |||
== Compatibility == | == Compatibility == |