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

tridiagonal-solve

v1.0.4

Published

Solver for tridiagonal systems of equations

Downloads

553

Readme

Build Status

Introduction

This package provides a solver for a system of linear equations. It is an implementation of the tridiagonal matrix algorithm, also known as Thomas algorithm.

System, by example of n = 4 unknowns x:

b[0] * x[0] + c[0] * x[1]                             = d[0]
a[0] * x[0] + b[1] * x[1] + c[1] * x[2]               = d[1]
              a[1] * x[1] + b[2] * x[2] + c[2] * x[3] = d[2]
                            a[2] * x[2] + b[3] * x[3] = d[3]

In matrix notation:

Rendering in matrix notation

The algorithm is only guaranteed to find a solution if the tridiagonal matrix is diagonally dominant:

|b[0]|   > |c[0]|
|b[1]|   > |a[0]| + |c[1]|
|b[2]|   > |a[1]| + |c[2]|
…
|b[n-1]| > |a[n-2]|

In other words: If that condition is not met, then it may happen that the algorithm cannot find a solution even if one exists.

In case no solution is found, the result is null. For bad input, the result is undefined.

Examples

  • Three unknowns:

    Rendering in matrix notation

    Input:

    var solve = require('tridiagonal-solve');
    return solve([4, 3], [9, -7, 8], [1, 2], [5, 6, 2]);

    Result: [0.6, -0.4, 0.4]

  • Matrix is not diagonally dominant, and algorithm fails although solution exists:

    Rendering in matrix notation

    Snippet: solve([0], [1, 0], [1], [1, 0])

    Result: null

  • Solution found although matrix is not diagonally dominant:

    Rendering in matrix notation

    Snippet: solve([1], [1, 0], [1], [1, 0])

    Result: [0, 1]

Coding conventions

  • Code needs to validate with JSLint.

  • Comments are in Markdown.

  • Avoid constructors (JS is classless), don’t throw exceptions (not necessary in JS).

  • Versioning: major.minor.bug-fix

    Incompatible changes to the API mandate an update of the major version.

    Keep version up to date in:

    • Git tags

    • package.json

License

Except where noted otherwise, files are licensed under the MIT License.

The MIT License (MIT)

Copyright (c) 2014 Felix E. Klee

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.