About stdlib...

We believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.

The library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.

When you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.

To join us in bringing numerical computing to the web, get started by checking us out on GitHub, and please consider financially supporting stdlib. We greatly appreciate your continued support!

Fibonacci Polynomial

Evaluate a Fibonacci polynomial.

A Fibonacci polynomial is expressed according to the following recurrence relation

$$F_n(x)=\{\begin{array}{ll}0& \text{if}n=0\\ 1& \text{if}n=1\\ x\cdot F_{n-1}(x)+F_{n-2}(x)& \text{if}n\ge 2\end{array}$$

Alternatively, if F(n,k) is the coefficient of x^k in F_n(x), then

$$F_n(x)=\sum _{k=0}^{n}F(n,k)x^k$$

where

$$F(n,k)=(\genfrac{}{}{0ex}{}{\frac{n+k-1}{2}}{k})$$

We can extend Fibonacci polynomials to negative n using the identity

$$F_{-n}(x)=(-1{)}^{n-1}{F}_n(x)$$

Installation

npm install @stdlib/math-base-tools-fibpoly

Alternatively,

• To load the package in a website via a script tag without installation and bundlers, use the ES Module available on the esm branch (see README).
• If you are using Deno, visit the deno branch (see README for usage intructions).
• For use in Observable, or in browser/node environments, use the Universal Module Definition (UMD) build available on the umd branch (see README).

The branches.md file summarizes the available branches and displays a diagram illustrating their relationships.

To view installation and usage instructions specific to each branch build, be sure to explicitly navigate to the respective README files on each branch, as linked to above.

Usage

var fibpoly = require( '@stdlib/math-base-tools-fibpoly' );

fibpoly( n, x )

Evaluates a Fibonacci polynomial at a value x.

var v = fibpoly( 5, 2.0 ); // => 2^4 + 3*2^2 + 1
// returns 29.0

fibpoly.factory( n )

Uses code generation to generate a function for evaluating a Fibonacci polynomial.

var polyval = fibpoly.factory( 5 );

var v = polyval( 1.0 ); // => 1^4 + 3*1^2 + 1
// returns 5.0

v = polyval( 2.0 ); // => 2^4 + 3*2^2 + 1
// returns 29.0

Notes

• For hot code paths, a compiled function will be more performant than fibpoly().
• While code generation can boost performance, its use may be problematic in browser contexts enforcing a strict content security policy (CSP). If running in or targeting an environment with a CSP, avoid using code generation.

Examples

var fibpoly = require( '@stdlib/math-base-tools-fibpoly' );

var i;

// Compute the negaFibonacci and Fibonacci numbers...
for ( i = -77; i < 78; i++ ) {
    console.log( 'F_%d = %d', i, fibpoly( i, 1.0 ) );
}

---

See Also

• @stdlib/math-base/tools/evalpoly: evaluate a polynomial using double-precision floating-point arithmetic.
• @stdlib/math-base/tools/lucaspoly: evaluate a Lucas polynomial.

---

Notice

This package is part of stdlib, a standard library for JavaScript and Node.js, with an emphasis on numerical and scientific computing. The library provides a collection of robust, high performance libraries for mathematics, statistics, streams, utilities, and more.

For more information on the project, filing bug reports and feature requests, and guidance on how to develop stdlib, see the main project repository.

Community

---

License

See LICENSE.

Copyright

Copyright © 2016-2025. The Stdlib Authors.