Routines for solving large systems of linear equations in R. Direct and iterative solvers from the Eigen C++ library are made available. Solvers include Cholesky, LU, QR, and Krylov subspace methods (Conjugate Gradient, BiCGSTAB). Both dense and sparse problems are supported.
| Version: | 0.0.1 | 
| Depends: | R (≥ 3.3.0) | 
| Imports: | Rcpp (≥ 1.0.5), Matrix, methods | 
| LinkingTo: | Rcpp, RcppEigen | 
| Published: | 2020-09-22 | 
| Author: | Nikolas Kuschnig  | 
| Maintainer: | Nikolas Kuschnig <nikolas.kuschnig at wu.ac.at> | 
| BugReports: | https://github.com/nk027/sanic/issues | 
| License: | GPL-3 | 
| URL: | https://github.com/nk027/sanic | 
| NeedsCompilation: | yes | 
| Materials: | NEWS | 
| In views: | NumericalMathematics | 
| CRAN checks: | sanic results | 
| Reference manual: | sanic.pdf | 
| Package source: | sanic_0.0.1.tar.gz | 
| Windows binaries: | r-devel: sanic_0.0.1.zip, r-release: sanic_0.0.1.zip, r-oldrel: sanic_0.0.1.zip | 
| macOS binaries: | r-release (arm64): sanic_0.0.1.tgz, r-oldrel (arm64): sanic_0.0.1.tgz, r-release (x86_64): sanic_0.0.1.tgz, r-oldrel (x86_64): sanic_0.0.1.tgz | 
| Reverse imports: | simplifyNet | 
Please use the canonical form https://CRAN.R-project.org/package=sanic to link to this page.