CRAN

marqLevAlg 1.1

An algorithm for least-squares curve fitting

Released Mar 18, 2013 by Melanie Prague

This package is available for Renjin and there are no known compatibility issues.

This algorithm provides a numerical solution to the problem of minimizing a function. This is more efficient than the Gauss-Newton-like algorithm when starting from points very far from the final minimum. A new convergence test is implemented (RDM) in addition to the usual stopping criterion : stopping rule is when the gradients are small enough in the parameters metric (GH-1G).

Installation

Maven

This package can be included as a dependency from a Java or Scala project by including the following your project's pom.xml file. Read more about embedding Renjin in JVM-based projects.

<dependencies>
  <dependency>
    <groupId>org.renjin.cran</groupId>
    <artifactId>marqLevAlg</artifactId>
    <version>1.1-b270</version>
  </dependency>
</dependencies>
<repositories>
  <repository>
    <id>bedatadriven</id>
    <name>bedatadriven public repo</name>
    <url>https://nexus.bedatadriven.com/content/groups/public/</url>
  </repository>
</repositories>

View build log

Renjin CLI

If you're using Renjin from the command line, you load this library by invoking:

library('org.renjin.cran:marqLevAlg')

Test Results

This package was last tested against Renjin 0.9.2644 on Jun 1, 2018.

Source

Fortran

View GitHub Mirror