The hardware and bandwidth for this mirror is donated by dogado GmbH, the Webhosting and Full Service-Cloud Provider. Check out our Wordpress Tutorial.
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[@]dogado.de.
An implementation for using efficient initials to compute the maximal eigenpair in R. It provides three algorithms to find the efficient initials under two cases: the tridiagonal matrix case and the general matrix case. Besides, it also provides two algorithms for the next to the maximal eigenpair under these two cases.
| Version: | 0.1.4 |
| Depends: | R (≥ 3.3.2), stats |
| Suggests: | knitr, rmarkdown |
| Published: | 2017-10-23 |
| DOI: | 10.32614/CRAN.package.EfficientMaxEigenpair |
| Author: | Mu-Fa Chen |
| Maintainer: | Xiao-Jun Mao <maoxj.ki at gmail.com> |
| BugReports: | http://github.com/mxjki/EfficientMaxEigenpair/issues |
| License: | MIT + file LICENSE |
| URL: | http://github.com/mxjki/EfficientMaxEigenpair |
| NeedsCompilation: | no |
| Materials: | README |
| CRAN checks: | EfficientMaxEigenpair results |
| Reference manual: | EfficientMaxEigenpair.pdf |
| Vignettes: |
EfficientMaxEigenpair Vignette |
| Package source: | EfficientMaxEigenpair_0.1.4.tar.gz |
| Windows binaries: | r-devel: EfficientMaxEigenpair_0.1.4.zip, r-release: EfficientMaxEigenpair_0.1.4.zip, r-oldrel: EfficientMaxEigenpair_0.1.4.zip |
| macOS binaries: | r-release (arm64): EfficientMaxEigenpair_0.1.4.tgz, r-oldrel (arm64): EfficientMaxEigenpair_0.1.4.tgz, r-release (x86_64): EfficientMaxEigenpair_0.1.4.tgz, r-oldrel (x86_64): EfficientMaxEigenpair_0.1.4.tgz |
| Old sources: | EfficientMaxEigenpair archive |
Please use the canonical form https://CRAN.R-project.org/package=EfficientMaxEigenpair 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.
Health stats visible at Monitor.