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

solve-banded

v1.0.4

Published

Solve a system of banded linear equations

Downloads

28

Readme

solve-banded Build Status npm version js-standard-style

Solve a system of banded linear equations

Introduction

This module accepts javascript Arrays or typed arrays representing the bands of a banded matrix and computes the solution using the Thomas Algorithm. A system with one subdiagonal and two superdiagonal bands, for example, looks like:

The solver will fail if the matrix is singular and may not succeed if the matrix is not diagonally dominant. If the solver fails, it will log a console message and return false. Note that the solver accepts a stride and offset for the input/output vector (x, below), so that a system can be solved in-place in an ndarray. The coefficient matrix does not currently accept strides or offsets and must be passed as individual vectors.

Example

Consider the solution of the tridiagonal system

var solveBanded = require('solve-banded')

var e = [4, 25, -5]

solveBanded([[0, -1, 2], [2, 7, -3], [1, 4, 0]], 1, 1, e, 3)

console.log(e)
// => e = [ 1, 2, 3 ]

Installation

$ npm install solve-banded

API

require('solve-banded')(diagonals, nsub, nsup, x, nx [, ox = 0 [, sx = 1]])

Arguments:

  • diagonals: an array of diagonal bands, starting with with the subdiagonal-most band (a in the example matrix above) and proceeding to the superdiagonal-most band (d in the example matrix above). Each vector must be a javascript Array or typed array of length nx.
  • nsub: an integer representing the number of subdiagonal bands, excluding the diagonal.
  • nsup: an integer representing the number of superdiagonal bands, excluding the diagonal.
  • x: a javascript Array or typed array of length nx representing the known vector (e in the example matrix above). On successful completion, this vector will contain the solution.
  • nx: an integer representing the number of equations, i.e. the length of x.
  • ox (optional): an integer representing the offset of data in x. If not provided, assumed equal to zero.
  • sx (optional): an integer representing the stride of data in x. If not provided, assumed equal to one.

Returns: True on successful completion, false otherwise.

License

© 2016 Ricky Reusser. MIT License.