Interface to the 'sparseLM' Levenberg-Marquardt Library
Overview
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.
Install
Health
- OK13 OK2026-08-04
- NOTE12 OK, 1 NOTE2026-08-01
- OK7 OK2026-03-31
Documentation
- Help pages
- 3
- Examples that run
- 100%2 run in a plain check (1 of them under a condition)
- Exported functions with examples
- 67%
- Documented parameters
- 100%
- Return-value docs
- 100%
- Help pages citing references
- 0%
Downloads
Repository
2 development-tooling and community-health practices detected across 2 families in the upstream repository
Checks run against github.com/smith-group/sparselm on 2026-10-22.
Dependencies
Installing sparseLM adds no packages beyond those that come with R.
Code & Tests
People & History
- RR 4.6.0 released · 2026-04-24
- 0.5Latest2026-03-30 · current release
- RR 4.5.0 released · 2025-04-11
Package metadata
- First published
- 2026-03-30
- Total releases
- 1 / 1 yrs
- License
- GPL-2 OSI
- Download size
- 54 KB
Cite
Cite this package
Run in R for the authors' entry:
citation("sparseLM")The package provides a citation file, so citation() returns the authors' own entry.
It points to 10.1007/978-3-642-15552-9_4.
Cite the R Observatory
For a number measured here: a download total, a coverage figure, an archival date.
From data release v2026-10-24, which the citation names so these numbers can be found later. More on citing and the projects behind them.