Discussion: new operators for numerical computation

[Konrad Hinsen]

hzhu at knowledgetrack.com (Huaiyu Zhu) writes:

> >For "matrix solve", I propose to follow APL and define it in the sense
> >of a least-squares solution, implemented via singular value
> >decomposition (SVD). There are two reasons for this:
> [snip]
> 
> Maybe the algorithm specs should go into the packages instead of operators?
> The same algorithm is unlikely to be optimal for all types of matrix
> classes, sparse, symetric, tridiagonal, complex, positive definite, etc.  If
> these are implemented as subclasses of matrices, should they be allowed to
> choose the algorithm?

Sure, I was thinking about the implementation for plain arrays. Of course
any class can implement any method in any way it likes.
-- 
-------------------------------------------------------------------------------
Konrad Hinsen                            | E-Mail: hinsen at cnrs-orleans.fr
Centre de Biophysique Moleculaire (CNRS) | Tel.: +33-2.38.25.55.69
Rue Charles Sadron                       | Fax:  +33-2.38.63.15.17
45071 Orleans Cedex 2                    | Deutsch/Esperanto/English/
France                                   | Nederlands/Francais
-------------------------------------------------------------------------------