June 26th, 2014, 2:12 pm
QuoteOriginally posted by: outrunQuoteOriginally posted by: CuchulainnQuoteOriginally posted by: outrunand I'm sure there is need for complex<double, long> somewhereand Matrix<complex<double>, complex<long> >complex<Matrix<double>, Matrix<long> >could both be relenant for their different memory layouts.Indeed. The polar form for complex numbers is complex<double, Degree> and in 3d we have curvilinear coordinates Point<T1, T2, T3> e.g. Point<double, Degree, Degree> etc.AlsoPolynomial<Matrix> e.g. Cayley-Hamilton theoremMatrix<Polynomial> aka matrix polynomialsI wonder if anyone has developed efficient data structures for these in C++?Efficient could be defined be in the contect of algorithms that act on them, ... and that could be expressed as performance measures of the algorithms (speed, memory usage, parallel friendly)Time: how long does the algorithm take to complete.Space: how much working memory (typically RAM) is needed by the algorithm. This has two aspects: the amount of memory needed by the code, and the amount of memory needed for the data on which the code operates.
Leftist, Alt Right, Marxist, Nihilist, Neo Celtic Reconstructionists, and splitters, all opinions appreciated. (Obviously that doesn't include Liberal Democrats.)