[Haskell-cafe] Polynomial and VectorSpace
The DSP package on Hackage seems to contain complex polynomial functions. It seems these functions are completely independent of the other DSP functions, so this package could be split of? Also, polynomials form a vector space, so could be made an instance of VectorSpace class? ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Polynomial and VectorSpace
On Mon, 16 Mar 2009, Peter Verswyvelen wrote: The DSP package on Hackage seems to contain complex polynomial functions. It seems these functions are completely independent of the other DSP functions, so this package could be split of? The matrix stuff is also independent. If you split off the polynomial stuff you might also adapt the identifiers to qualified style. Also, polynomials form a vector space, so could be made an instance of VectorSpace class? Polynomial arithmetic is also contained in http://hackage.haskell.org/packages/archive/numeric-prelude/0.0.5/doc/html/MathObj-Polynomial.html http://darcs.haskell.org/htam/src/Polynomial.hs vector-space seems to be a tough dependency, since it relies on type families. NumericPrelude's VectorSpace class is a multi-parameter type class. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Polynomial and VectorSpace
2009/3/16 Peter Verswyvelen bugf...@gmail.com: The DSP package on Hackage seems to contain complex polynomial functions. It seems these functions are completely independent of the other DSP functions, so this package could be split of? I would be interested in a separate package that deals with polynomials. I am working on a library that does various things with numerals and polynomials are a nice way to represent positional notation systems. Perhaps it would allow me to work with Knuth's quater-imaginary base :-) ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Polynomial and VectorSpace
On Mon, Mar 16, 2009 at 9:50 PM, Henning Thielemann lemm...@henning-thielemann.de wrote: Polynomial arithmetic is also contained in http://hackage.haskell.org/packages/archive/numeric-prelude/0.0.5/doc/html/MathObj-Polynomial.html http://darcs.haskell.org/htam/src/Polynomial.hs Nice. But the above code doen't seem to contain functions to find (or approximate) all complex roots, which is the function I need (maybe with special cases for linear, quadratic, cubic, since these can be done analytically). The DSP package does, albeit only Laguerre's method, which might be good enough, although my old C# code that I wanted to port used Weierstrass method http://darcs.haskell.org/htam/src/Polynomial.hsvector-space seems to be a tough dependency, since it relies on type families. NumericPrelude's VectorSpace class is a multi-parameter type class. NumericPrelude is very impressive, but it scares me a little, since it is so big :-) ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Polynomial and VectorSpace
On Mon, 16 Mar 2009, Matthew Donadio wrote: Thy polynomial and matrix libraries weren't really developed to be stand alone libraries. I was developing some DSP libraries that required polynomial and matrix math, so I implemented what I needed so I could test the DSP. Both libraries work for lower orders, but I suspect they are buggy with big inputs. My long term goal was to interface with LAPACK and/or GSL for the numeric heavy lifting, but that never happened. The same goes for the FFT library. That was written in support of the DSP libraries, and also as a learning exercise for me (to better understand how/why the FFT works). FFTW was the long term goal. In the meantime fftw and gsl-matrix interfaces exist on Hackage. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
