| Re: [eigen] Non linear equations solver |
[ Thread Index |
Date Index
| More lists.tuxfamily.org/eigen Archives
]
- To: eigen@xxxxxxxxxxxxxxxxxxx
- Subject: Re: [eigen] Non linear equations solver
- From: Gael Guennebaud <gael.guennebaud@xxxxxxxxx>
- Date: Mon, 10 Aug 2009 11:52:32 +0200
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:mime-version:received:in-reply-to:references :date:message-id:subject:from:to:content-type :content-transfer-encoding; bh=fvOBfj498rZOGtK8cON7FXq+iKRQRQQOt0Gju/F7BMk=; b=PjRS7Q1qHyK/dpyjdZ7BLitzFo24IquX+kcyfG9Ya4eOeo3Ih7c97ilqjRwdQEMVZc uxu/lGpm5RWmsdA0X52wELoUn6kLeWtO7+0nuXS19C3JoZYfa9ueHhdzNzIMvjSl4ahj lLV9DMnOEWI956gWQfaQwv6OJ6xILLj746ni4=
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :content-type:content-transfer-encoding; b=GIt5QJYkEEzFRddta2ELgFflnvSvouvMlP185D213/aLUwsU7t0nlQcPIRORSuuEpI bWkHE5yrmclUhRmGtcmd/sKCpaOTOREkh4Nxo1XwnncD+JLbuwgoOLGOlVD5HXm5dsPX lMen/oyw2Bxdcw/TgFRkR8SA9AgQujny9sH9g=
my 2 cents:
if I were you, I'd start from Keir implementation, extend it to make
the underlying linear solver a template parameter so that one can use
LU, QR, SVD, LLT, etc. or any sparse solver when using sparse
matrices. Actually, we already discussed these things in another
threads.
Then you could have a look at cminpack implementation to see the
differences, and in particular to see whether there are some good
tricks to make the algorithm better (better convergence, more
accurate, etc.)
An in parallel to that, we could discuss the API design, in
particular, how to control the algorithm, how to specify the Jacobian
(user defined, AD, finite differences), etc.
cheers,
gael.
On Mon, Aug 10, 2009 at 9:07 AM, Koldo Ramirez<koldo.ramirez@xxxxxxxxx> wrote:
> Hello Thomas
>
> I suppose Minpack 2 is based in version 1 as they present it as an
> improvement focusing in large scale problems and using Blas and Lapack.
>
> About the Octave reference is just to show that an important project like
> Octave has considered Minpack.
>
> Best regards
> Koldo
>
> 2009/8/8 Thomas Capricelli <orzel@xxxxxxxxxxxxxxx>
>>
>>
>> In data lunedì 27 luglio 2009 10:13:58, Koldo Ramirez ha scritto:
>> > It exists Minpack version 2. Between other advantages it uses BLAS and
>> > LAPACK. This is the presentation (
>> > http://ftp.mcs.anl.gov/pub/MINPACK-2/README or
>> > http://www-new.mcs.anl.gov/otc/minpack/summary.html)
>>
>> It doesn't seem to be related to minpack actually. only the name is the
>> same,
>> i think it's not based on the minpack code. is it ?
>>
>>
>> > ..., the old minpack code is gone. ...
>> > Essentially the same method as in minpack is used - double
>> > dogleg
>> > trust region steps with Broyden updating of the jacobian. For
>> > large
>> > enough (no. of variables > 10) square and overdetermined(!)
>> > systems, the QR factorization of the jacobian is updated rather than the
>> > jacobian itself, avoiding costly re-factorizations. Broyden updating may
>> > be
>> > switched off by the user, yielding plain levenberg-marquardt method.
>>
>> interesting to not, those are things we could do later on. I still prefer
>> considering minpack currently has it has a lot broader user test range.
>>
>>
>> Thomas
>> --
>> Thomas Capricelli <orzel@xxxxxxxxxxxxxxx>
>> http://www.freehackers.org/thomas
>>
>>
>
>
--
Gaël Guennebaud
Iparla - INRIA Bordeaux
(+33)5 40 00 37 95