Группа :: Система/Библиотеки
Пакет: liblevmar
Главная Изменения Спек Патчи Sources Загрузить Gear Bugs and FR Repocop
Текущая версия: 2.6-alt1_12
Время сборки: 25 февраля 2023, 11:30 ( 61.0 недели назад )
Размер архива: 86.36 Kb
Домашняя страница: http://www.ics.forth.gr/~lourakis/levmar/
Лицензия: GPLv2+
О пакете: Levenberg-Marquardt nonlinear least squares algorithm
Описание:
Список всех майнтейнеров, принимавших участие
в данной и/или предыдущих сборках пакета: Список rpm-пакетов, предоставляемый данным srpm-пакетом:
ACL:
Время сборки: 25 февраля 2023, 11:30 ( 61.0 недели назад )
Размер архива: 86.36 Kb
Домашняя страница: http://www.ics.forth.gr/~lourakis/levmar/
Лицензия: GPLv2+
О пакете: Levenberg-Marquardt nonlinear least squares algorithm
Описание:
levmar is a native ANSI C implementation of the Levenberg-Marquardt
optimization algorithm. Both unconstrained and constrained (under linear
equations, inequality and box constraints) Levenberg-Marquardt variants are
included. The LM algorithm is an iterative technique that finds a local
minimum of a function that is expressed as the sum of squares of nonlinear
functions. It has become a standard technique for nonlinear least-squares
problems and can be thought of as a combination of steepest descent and the
Gauss-Newton method. When the current solution is far from the correct on,
the algorithm behaves like a steepest descent method: slow, but guaranteed
to converge. When the current solution is close to the correct solution, it
becomes a Gauss-Newton method.
Текущий майнтейнер: Igor Vlasenko optimization algorithm. Both unconstrained and constrained (under linear
equations, inequality and box constraints) Levenberg-Marquardt variants are
included. The LM algorithm is an iterative technique that finds a local
minimum of a function that is expressed as the sum of squares of nonlinear
functions. It has become a standard technique for nonlinear least-squares
problems and can be thought of as a combination of steepest descent and the
Gauss-Newton method. When the current solution is far from the correct on,
the algorithm behaves like a steepest descent method: slow, but guaranteed
to converge. When the current solution is close to the correct solution, it
becomes a Gauss-Newton method.
Список всех майнтейнеров, принимавших участие
в данной и/или предыдущих сборках пакета: Список rpm-пакетов, предоставляемый данным srpm-пакетом:
- liblevmar
- liblevmar-debuginfo
- liblevmar-devel
- liblevmar-devel-debuginfo