The OpenNET Project / Index page

[ новости /+++ | форум | теги | ]



"Google открыл код библиотеки Ceres Solver, позволяющей воссо..."
Версия для распечатки Пред. тема | След. тема
Форум Разговоры, обсуждение новостей
Исходное сообщение [ Отслеживать ]
Заметили полезную информацию ? Пожалуйста добавьте в FAQ на WIKI.
. "Google открыл код библиотеки Ceres Solver, позволяющей воссо..." +2 +/
Сообщение от ысчвысв (?), 02-Май-12, 23:33 
> Ну что можно сказать, только "Молодцы!".. Google много годных проектов для науки выкатил.

Через 50 лет после того они все уже были сделаны

http://en.wikipedia.org/wiki/Levenberg–Marquardt_algor...

Implementations
Levenberg-Marquardt is a built-in algorithm in Mathematica , Matlab, Origin, and IGOR Pro.
The oldest implementation still in use is lmdif, from MINPACK, in Fortran, in the public domain. See also:
lmfit, a translation of lmdif into C/C++ with an easy-to-use wrapper for curve fitting, public domain.
The GNU Scientific Library library has a C interface to MINPACK.
C/C++ Minpack includes the Levenberg–Marquardt algorithm.
Several high-level languages and mathematical packages have wrappers for the MINPACK routines, among them:
Python library scipy, module scipy.optimize.leastsq,
IDL, add-on MPFIT.
R (programming language) has the minpack.lm package.
levmar is an implementation in C/C++ with support for constraints, distributed under the GNU General Public License.
levmar includes a MEX file interface for MATLAB
Perl (PDL), python and Haskell interfaces to levmar are available: see PDL::Fit::Levmar, PyLevmar and HackageDB levmar.
sparseLM is a C implementation aimed at minimizing functions with large, arbitrarily sparse Jacobians. Includes a MATLAB MEX interface.
InMin library contains a C++ implementation of the algorithm based on the eigen C++ linear algebra library. It has a pure C-language API as well as a Python binding
ALGLIB has implementations of improved LMA in C# / C++ / Delphi / Visual Basic. Improved algorithm takes less time to converge and can use either Jacobian or exact Hessian.
NMath has an implementation for the .NET Framework.
gnuplot uses its own implementation gnuplot.info.
Java programming language implementations: 1) Javanumerics, 2) LMA-package (a small, user friendly and well documented implementation with examples and support), 3) Apache Commons Math
OOoConv implements the L-M algorithm as an OpenOffice.org Calc spreadsheet.
SAS, there are multiple ways to access SAS's implementation of the Levenberg-Marquardt algorithm: it can be accessed via NLPLM Call in PROC IML and it can also be accessed through the LSQ statement in PROC NLP, and the METHOD=MARQUARDT option in PROC NLIN.

Ответить | Правка | Наверх | Cообщить модератору

Оглавление
Google открыл код библиотеки Ceres Solver, позволяющей воссо..., opennews, 02-Май-12, 15:54  [смотреть все]
Форумы | Темы | Пред. тема | След. тема



Партнёры:
PostgresPro
Inferno Solutions
Hosting by Hoster.ru
Хостинг:

Закладки на сайте
Проследить за страницей
Created 1996-2024 by Maxim Chirkov
Добавить, Поддержать, Вебмастеру