npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

svd-finder

v0.2.3

Published

singular value decomposition

Downloads

135

Readme

Singular Value Decomposition port to js

This procedure computes the singular values and complete orthogonal decomposition of a real rectangular matrix A:

A = U * diag(q) * V(t), U(t) * U = V(t) * V = I

where the arrays a, u, v, q represent A, U, V, q respectively. The actual parameters corresponding to a, u, v may all be identical unless withu = withv = true. In this case, the actual parameters corresponding to u and v must differ.

m >= n is assumed (with m = a.length and n = a[0].length)

Usage:

let a = [
  [22, 10, 2, 3, 7],
  [14, 7, 10, 0, 8],
  [-1, 13, -1, -11, 3],
  [-3, -2, 13, -2, 4],
  [9, 8, 1, -2, 4],
  [9, 1, -7, 5, -1],
  [2, -6, 6, 5, 1],
  [4, 5, 0, -2, 2]
];

let { u, v, q } = SVD(a);

SVD(a [options])

Parameters

// Represents the matrix A to be decomposed
a: number[][]

Options

{
  // if U is desired `false` otherwise
  u: boolean = true,

  // if V is desired `false` otherwise
  v: boolean = true,

  // A constant used in the test for convergence; should not be smaller than the machine precision
  eps: number = Math.pow(2, -52)
}

Result

{
  // Represents the matrix U with orthonormalized columns (`if withu is true` otherwise `u` is used as a working storage)
  u: number[][],

  //Represents the orthogonal matrix V (`if u === true`, otherwise `v` is not used)
  v: number[][],

  // A vector holding the singular values of `A`; they are non-negative but not necessarily ordered in decreasing sequence
  q: number[]
}