Dark Mode

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

rawify/RootFinder.js

Repository files navigation

RootFinder.js

RootFinder.js is a lightweight JavaScript library for finding the roots of quadratic equations and cubic equations. It leverages the Complex.js library to handle complex solutions, ensuring precision and correctness when dealing with both real and complex numbers.

Features

  • Solve quadratic equations of the form ax2 + bx + c = 0.
  • Solve cubic equations of the form ax3 + bx2 + cx + d = 0 using Cardano's method.
  • Support for complex roots using Complex.js.

Installation

You can install RootFinder.js via npm:

npm install @rawify/rootfinder

Or with yarn:

yarn add @rawify/rootfinder

Alternatively, download or clone the repository:

git clone https://github.com/rawify/RootFinder.js

Usage

Include the rootfinder.min.js file in your project:

<script src="path/to/rootfinder.min.js">script>
<script src="path/to/complex.min.js">script>
<script>
const roots = RootFinder.quadratic(2, 5, 6);
...
script>

Or in a Node.js project:

const RootFinder = require('@rawify/rootfinder');

or

import RootFinder from '@rawify/rootfinder';

Solving Quadratic Equations

To find the roots of a quadratic equation ax2 + bx + c = 0:

const roots = RootFinder.quadratic(1, -3, 2);
console.log(roots); // Output: [ Complex { re: 2 }, Complex { re: 1 } ]

If the equation has complex roots:

const complexRoots = RootFinder.quadratic(1, 0, 1);
console.log(complexRoots); // Output: [ Complex { re: 0, im: 1 }, Complex { re: 0, im: -1 } ]

Solving Cubic Equations

To find the roots of a cubic equation ax3 + bx2 + cx + d = 0:

const roots = RootFinder.cubic(1, -6, 11, -6);
console.log(roots); // Output: [ Complex { re: 1 }, Complex { re: 2 }, Complex { re: 3 } ]

For cubic equations with complex roots:

const complexRoots = RootFinder.cubic(1, 0, 0, -1);
console.log(complexRoots); // Output: [ Complex { re: 1, im: 0 }, Complex { re: -0.5, im: 0.866 }, Complex { re: -0.5, im: -0.866 } ]

API

quadratic(a, b, c[, returnReal=false])

Solves the quadratic equation ax2 + bx + c = 0.

  • Parameters:

    • a (Number): Coefficient of x2
    • b (Number): Coefficient of x
    • c (Number): Constant term
    • returnReal (optional Boolean): Decide if only real roots should be returned
  • Returns: An array of roots, which can contain real or complex numbers.

cubic(a, b, c, d[, returnReal=false])

Solves the cubic equation ax3 + bx2 + cx + d = 0 using Cardano's method.

  • Parameters:

    • a (Number): Coefficient of x3
    • b (Number): Coefficient of x2
    • c (Number): Coefficient of x
    • d (Number): Constant term
    • returnReal (optional Boolean): Decide if only real roots should be returned
  • Returns: An array of roots, which can contain real or complex numbers.

Coding Style

Like all my libraries, RootFinder.js is written to minimize size after compression with Google Closure Compiler in advanced mode. The code style is optimized to maximize compressibility. If you extend the library, please preserve this style.

Building the library

After cloning the Git repository run:

npm install
npm run build

Run a test

Testing the source against the shipped test suite is as easy as

npm run test

Copyright and Licensing

Copyright (c) 2025, Robert Eisele Licensed under the MIT license.

About

The RAW root finder library for quadratic and cubic polynomials

Topics

Resources

Readme

License

MIT license

Stars

Watchers

Forks

Releases

No releases published

Packages

Contributors