[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: logm, sqrtm, funm
From: |
Philip Nienhuis |
Subject: |
Re: logm, sqrtm, funm |
Date: |
Wed, 21 Apr 2010 12:46:01 -0800 (PST) |
"Tommy Guy" wrote:
> funm and logm do have the same problems. Using a Schur decomposition
> followed by an algorithm to calculate the function of the upper
> triangular algorithm is probably what the competition is using, but it
> is also an openly published algorithm with good results. sqrtm (in
> Octave source) has been converted to use the Schur decomposition
> method and implemented in c++. This provides a guide to anyone
> wanting to try to fix logm.
FWIW, one of the authors of your literature ref provides a (basic) matrix
functions toolbox under the GPL v. 3 license:
http://www.maths.manchester.ac.uk/~higham/mftoolbox/
Another (significantly more involved) one is on this web page:
http://www.maths.manchester.ac.uk/~higham/NAMF/
There's no mentioning of any license, only a note on the web page of the
institution that supplied the grant for the research that led to this
toolbox, that Intellectual Property is a responsibility of the researchers
in question.
Philip
--
View this message in context:
http://n4.nabble.com/logm-sqrtm-funm-tp2018829p2019646.html
Sent from the Octave - General mailing list archive at Nabble.com.