Re: [eigen] Levenberg-marquardt and dogleg minimizer |
[ Thread Index |
Date Index
| More lists.tuxfamily.org/eigen Archives
]
- To: eigen@xxxxxxxxxxxxxxxxxxx
- Subject: Re: [eigen] Levenberg-marquardt and dogleg minimizer
- From: Jos van den Oever <jvdoever@xxxxxxxxx>
- Date: Thu, 26 Feb 2009 13:13:38 +0100
- 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=7akz+RmpdaikX+oeU6L05FVmvWAzjt+6fn6WE6/vzno=; b=Qm7b+CocwssAYHbgmMjo8ZdnauYhqe3GBLWzsN3ppfgRT4OFpC/DW8KbsPwWzg+BCF 9vfGjMIS/CRvAkY8RJncoRgaDirok2Qu0h/jlMzBtxUfwoFOjPEgwiADO/J7+nAHV3Vi pLfPRJLPpg3+FqRHzymSg0YIA41aTkgpzter8=
- 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=xPEELreOXJaJvECLQT7Q648Esf4N3adbwxAeFYLtts90lRcRuQhSO6C4ua7H7Wxiu/ DXnYzs7Uc3Sftl2Nk/662wJ8uGQGVWARczPYBUzBqHxsq8FrlfQT0/1PnJp8MFB9W2Ob rx1GgVs08Zp5YwSH5ORcEKt0cO1S5CpBm5esU=
2009/2/26 Gael Guennebaud <gael.guennebaud@xxxxxxxxx>:
> adolc internally uses dense vector to store each derivatives, so it
> cannot deal with large - sparse problem. What would be nice is to
> implement our own autodiff tool based on eigen's dense and sparse
> objects but that happens only if someone interested in doing that
> shows up...
Reduced storage in the Jacobian is not the main benefit I'm aiming for.
The solver uses a dense Jacobian storage wise, but can do faster
iteration steps if it knows which parts of the Jacobian are zero or
linear.
You are right that using a sparse matrix would probably improve
performance more.
If I understand the autodiff Jacobian correctly, the derivative
functions are calculated at compile time. So would it be possible to
find out which part of it are zero or linear?
Cheers,
Jos