robust-linear-solve

WebJar for robust-linear-solve

License	MIT
GroupId	org.webjars.npm
ArtifactId	robust-linear-solve
Last Version	1.0.0
Release Date	Mar 10, 2018
Type	jar
Description	robust-linear-solve WebJar for robust-linear-solve
Project URL	http://webjars.org
Source Code Management	https://github.com/mikolalysenko/robust-linear-solve

Download robust-linear-solve

Filename	Size
robust-linear-solve-1.0.0.pom
robust-linear-solve-1.0.0.jar	6 KB
robust-linear-solve-1.0.0-sources.jar	22 bytes
robust-linear-solve-1.0.0-javadoc.jar	22 bytes

How to add to project

Apache Maven

<!-- https://jarcasting.com/artifacts/org.webjars.npm/robust-linear-solve/ -->
<dependency>
    <groupId>org.webjars.npm</groupId>
    <artifactId>robust-linear-solve</artifactId>
    <version>1.0.0</version>
</dependency>

Gradle Groovy

// https://jarcasting.com/artifacts/org.webjars.npm/robust-linear-solve/
implementation 'org.webjars.npm:robust-linear-solve:1.0.0'

Gradle Kotlin

// https://jarcasting.com/artifacts/org.webjars.npm/robust-linear-solve/
implementation ("org.webjars.npm:robust-linear-solve:1.0.0")

Apache Buildr

'org.webjars.npm:robust-linear-solve:jar:1.0.0'

Apache Ivy

<dependency org="org.webjars.npm" name="robust-linear-solve" rev="1.0.0">
  <artifact name="robust-linear-solve" type="jar" />
</dependency>

Groovy Grape

@Grapes(
@Grab(group='org.webjars.npm', module='robust-linear-solve', version='1.0.0')
)

Scala SBT

libraryDependencies += "org.webjars.npm" % "robust-linear-solve" % "1.0.0"

Leiningen

[org.webjars.npm/robust-linear-solve "1.0.0"]

Dependencies

compile (1)

Group / Artifact	Type	Version
org.webjars.npm : robust-determinant	jar	[1.1.0,2)

Project Modules

There are no modules declared in this project.

robust-linear-solve

An exact linear solver for low dimensional systems.

Example

var linSolve = require("robust-linear-solve")

var A = [ [1, 2, 3],
          [3, 2, 1],
          [0, 0, 1] ]

var b = [1, 2, 3]

console.log(linSolve(A, b))

Output:

[ [ -14 ], [ 23 ], [ -12 ], [ -4 ] ]

Install

npm install robust-linear-solve

API

require("robust-linear-solve")(A, b)

Finds the exact solution to a linear system, Ax = b, using Cramer's rule.

• A is a n-by-n square matrix, encoded as an array of arrays
• b is an n dimensional vector encoded as a length n array

Returns A projective n+1 dimensional vector of non-overlapping increasing sequences representing the exact solution to the system. That is to say, if x is the returned solution then in psuedocode we have the following constraint:

A [ x[0], x[1], ... , x[n-1] ] = b * x[n]

Or in other words, the solution is given by the quotient:

[ x[0] / x[n], x[1] / x[n], .... , x[n-1] / x[n] ]

If the system is not solvable, then the last coefficient, x[n] will be 0.

Note For up to n=5, you can avoid the extra method look up by calling linSolve[n] directly.

Credits

(c) 2014 Mikola Lysenko. MIT License

Versions

Version
1.0.0 Mar 10, 2018