Spencer Ogden wrote:
I have a collection of functions for using numerical computation to
approximate the roots of arbitrary functions. It is a function
library, no OO. I am wondering where to put it, either Algorithm:: or
Math::
I think Math::RootFind would be best, since the package is of
spe
# The following was supposedly scribed by
# Sam Vilain
# on Monday 14 February 2005 04:12 pm:
>Something like a Directed Acyclic Graph? (see Tree::DAG_Node)
Thanks for the lead. That describes the directory side of things (and
maybe describes the files too...) The Tree::DAG_Node module does h
Eric Wilhelm wrote:
associative arrays. This module uses tied associative arrays and some
conventions to represent ordered trees where each node of the tree has
both contents (deeper nodes) and properties (things about the node.)
It's not exactly homogeneous (like an n-ary tree) because it use
Given my druthers, I'd expect Math::RootFind but either would work.
--hsm
> -Original Message-
> From: Spencer Ogden [mailto:[EMAIL PROTECTED]
> Sent: Monday, February 14, 2005 10:14 AM
> To: module-authors@perl.org
> Subject: Algorithm::RootFind Request for Comments
>
> I have a collect
I have a collection of functions for using numerical computation to
approximate the roots of arbitrary functions. It is a function library,
no OO. I am wondering where to put it, either Algorithm:: or Math::
Each different algorithm will be a function within the library, but they
all are root f
