The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
Provides an R interface to the 'sparseLM' C library for large-scale nonlinear least squares problems with arbitrarily sparse Jacobians. The underlying solver implements a sparse variant of the Levenberg-Marquardt algorithm for minimizing sum-of-squares objective functions, supports user-supplied analytic Jacobians or finite-difference approximation, and is designed to exploit sparsity for improved memory use and performance. This package exposes the solver in R and uses sparse matrix classes and the 'CHOLMOD' sparse Cholesky factorization routines through the 'Matrix' package interface. Methods from the C library are described in Lourakis (2010) <doi:10.1007/978-3-642-15552-9_4>.
| Version: | 0.5 |
| Depends: | Matrix |
| Imports: | methods |
| LinkingTo: | Matrix |
| Published: | 2026-03-30 |
| DOI: | 10.32614/CRAN.package.sparseLM |
| Author: | Colin Smith |
| Maintainer: | Colin Smith <colin.smith at wesleyan.edu> |
| License: | GPL-2 |
| URL: | https://github.com/smith-group/sparseLM, https://smith-group.github.io/sparseLM/ |
| NeedsCompilation: | yes |
| Citation: | sparseLM citation info |
| Materials: | README |
| CRAN checks: | sparseLM results |
| Reference manual: | sparseLM.html , sparseLM.pdf |
| Package source: | sparseLM_0.5.tar.gz |
| Windows binaries: | r-devel: sparseLM_0.5.zip, r-release: sparseLM_0.5.zip, r-oldrel: not available |
| macOS binaries: | r-release (arm64): sparseLM_0.5.tgz, r-oldrel (arm64): not available, r-release (x86_64): sparseLM_0.5.tgz, r-oldrel (x86_64): sparseLM_0.5.tgz |
Please use the canonical form https://CRAN.R-project.org/package=sparseLM to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.