Displaying 1 to 19 from 19 results

## ndarray-gaussian-filter - Gaussian blur for ndarrays

•    Javascript

An FFT based Gaussian filter for ndarrays.Filters an ndarray using a Gaussian filter.

## ndarray-gemm - General matrix multiplication for ndarrays

•    Javascript

General matrix multiply for ndarrays. This is analogous to the BLAS level 3 routine xGEMM.Note that while this implementation is correct, it is not yet very optimized. If someone wants to take over this project or suggest improvements, patches are welcome.

## ndarray-gram-schmidt-qr - Modified Gram-Schmidt Algorithm for QR Factorization of ndarrays

•    Javascript

Only square matrices are currently tested. For complex numbers see ndarray-gram-schmidt-qr-complex.The algorithm currently only calculates the in-place QR decomposition and returns true on successful completion.

## ndarray-householder-qr - Householder triangularization for QR Factorization of ndarrays

•    Javascript

The specific implementation is based on the pseudocode from Walter Gander's Algorithms for the QR-Decomposition. This algorithm computes both R and the Householder reflectors in place, storing R in the upper-triangular portion of A, the diagonal of R in a separate vector and the Householder reflectors in the columns of A. To eliminate unnecessary operations, the Householder reflectors are normalized so that norm(v) = sqrt(2).Computes the in-place triangularization of A, returning the Householder reflectors in the lower-triangular portion of A (including the diagonal) and R in the upper-triangular portion of A (excluding diagonal) with the diagonal of R stored in d. d must be a one-dimensional vector with length at least n.

## ndarray-resample - Downsample by a factor of two using sinc interpolation

•    Javascript

Resamples an ndarray by an arbitrary (rational) factor using a sinc kernel.Resamples input by a factor of output.shape/input.shape, storing the result in output (this also means the factor can differ per dimension).

## nifti-js - NIfTI support for Javascript

•    Javascript

This can parse files in the Neuroimaging Informatics Technology Initiative format (version 1). Currently, data (as opposed to the header) can only be read from ".nii" files (files that include both the header and the data in one file), you can still read the header from a header-only file though.Note that the output is compatible with what is output by nrrd-js. The main area where this breaks down (so far) is encoding orientation information. The NIfTI file format allows for two different transformations in one file (with various options for specifying the transformations). In contrast, the NRRD format only supports a very simple scheme whereby the "data axes" can be mapped to basis vectors in the physical space (in addition to another scheme more or less corresponding to "method 1" in the NIfTI format). Currently, nifti-js simply discards one type of transformation (the sform transformation).

## ode-euler - Integrate a system of ODEs using the Euler method

•    Javascript

Integrate a system of ODEs using the Euler method

## ode-rk4 - Integrate a system of ODEs using the Fourth Order Runge-Kutta (RK-4) method

•    Javascript

For a similar adaptive method using the fifth order Cash-Karp Runge-Kutta method with fourth order embedded error estimator, see ode45-cash-karp.Returns: Initialized integrator object.

## ode45-cash-karp - Integrate a system of Ordinary Differential Equations using the Fifth Order Adaptive Cash-Karp method

•    Javascript

where is a vector of length . Given time step , the Cash-Karp method uses a fifth order Runge-Kutta scheme with a fourth order embedded estimator in order to control the error. In other words, the same intermediate values used in calculating the fifth order update can be used to calculate a fourth order estimate. The difference yields an error estimate, and the error estimate controls the timestep .Initialized integrator object.

## phase-align - Aligns a pair of ndarrays up to translation

•    Javascript

Aligns two ndarrays up to a translation such that the sum of squared differences between them is minimized. This can be used as a quick preprocess for other more detailed alignment algorithms.

## poly-roots - Find all roots of a polynomial using the Jenkins-Traub method

•    Javascript

This module has been deprecated in favor of durand-kerner, which is a faster and more robust implementation all around.See history for a more complete readme.

## splines - Convenient and efficient B-splines.

•    Javascript

Convenient and efficient B-splines. This package allows you to generate fairly efficient code for evaluating B-splines of arbitrary degree using de Boor's algorithm.Generates function for evaluating an n-th order B-spline.

## window-function - Collection of window functions

•    Javascript

Among other uses, window functions help control spectral leakage when doing Fourier Analysis. This collection of window functions is copied directly from Wikipedia. Caveat emptor.To calculate the value of a window function, pass the sample number and total number of samples to one of the window functions listed below, along with any additional parameters it may require. The plots below are calculated from the npm module and plotted with Fourier transform to illustrate the spectral leakage. See the Wikipedia page on window functions for more details.

## cwise - Component-wise operations for ndarrays

•    Javascript

This library can be used to generate cache efficient map/reduce operations for ndarrays.Note that in the above, i is not an actual Array, the indexing notation is just syntactic sugar.

## distance-transform - Distance transforms for ndarrays

•    Javascript

Performs a distance transform of array in place using Meijster's algorithm.array is updated in place and gets the distance values.

## durand-kerner - Finds roots of polynomials by Weierstrauss' method

•    Javascript

Finds all the roots of a polynomial by Weierstrass' method (or known in Abramowitz&Stegun as the Durand-Kerner method). This is basically a generalization of Newton's method that works for multiple roots.Finds the roots of a polynomial whose real coefficients are given by r_coeff and imaginary coefficients by i_coeff.

•    Javascript

Integrate a system of ODEs using the Second Order Runge-Kutta (Midpoint) method

## ndarray-blas-level1 - BLAS Level 1 operations for ndarrays

•    Javascript

A quick note on why this exists: The goal is not to reinvent the wheel. There are lots of implementations of BLAS out there. Even for JS. There's a nodejs wrapper for LAPACK. Depending on what you need, maybe you should use that. The goal of this is to bring standardized BLAS operations to ndarrays so that algorithms can be made as future-resistant as possible by writing them in terms of standardized, easily-translatable operations.This library implements the basic vector operations of the Level 1 Basic Linear Algebra Subprograms (BLAS). Many of these functions are also implemented in ndarray-ops—which also has functions that are not included in BLAS. So the right answer is probably some blend of the two. This library exists mainly to frame things in a relatively standard, coherent framework.

## ndarray-blas-level1-complex - BLAS Level 1 operations for complex ndarrays

•    Javascript

This library implements the basic vector operations of the Level 1 Basic Linear Algebra Subprograms (BLAS). Many of these functions are also implemented in ndarray-ops—which also has functions that are not included in BLAS. So the right answer is probably some blend of the two. This library exists mainly to frame things in a relatively standard, coherent framework.NB: This library performs no checks to ensure you're only passing one-dimensional vectors. That's either a bug or a feature, depending on how you think about it.

We have large collection of open source products. Follow the tags from Tag Cloud >>

Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects. 