Compute the hypotenuse using the alpha max plus beta min algorithm.
npm install @stdlib/math-base-special-fast-alpha-max-plus-beta-minWe 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!
About stdlib...
[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url]
> Compute the [hypotenuse][hypotenuse] using the [alpha max plus beta min algorithm][alpha-max-plus-beta-min].
``bash`
npm install @stdlib/math-base-special-fast-alpha-max-plus-beta-min
`javascript`
var ampbm = require( '@stdlib/math-base-special-fast-alpha-max-plus-beta-min' );
#### ampbm( x, y )
Computes the [hypotenuse][hypotenuse] using the [alpha max plus beta min algorithm][alpha-max-plus-beta-min].
`javascript`
var h = ampbm( -5.0, 12.0 );
// returns ~13.5
#### ampbm.factory( alpha, beta, \[nonnegative\[, ints]] )
Returns a function for computing the [hypotenuse][hypotenuse] using coefficients alpha and beta.
`javascript
var hypot = ampbm.factory( 1.0, 0.5 );
var h = hypot( -5.0, 12.0 );
// returns 14.5
`
If the returned function should only expect nonnegative arguments, set the nonnegative argument to true.
`javascript
var hypot = ampbm.factory( 1.0, 0.5, true );
var h = hypot( 5.0, 12.0 );
// returns 14.5
`
If the returned function should only expect signed 32-bit integers, set the ints argument to true.
`javascript
var hypot = ampbm.factory( 1.0, 0.5, false, true );
var h = hypot( -5.0, 12.0 );
// returns 14
`
If the returned function should only expect unsigned 32-bit integer valued arguments, set the nonnegative and ints arguments to true.
`javascript
var hypot = ampbm.factory( 1.0, 0.5, true, true );
var h = hypot( 5.0, 12.0 );
// returns 14
`
- The algorithm computes only an approximation. For precise results, use [hypot][@stdlib/math/base/special/hypot].
`javascript
var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
var logEachMap = require( '@stdlib/console-log-each-map' );
var ampbm = require( '@stdlib/math-base-special-fast-alpha-max-plus-beta-min' );
var opts = {
'dtype': 'float64'
};
var x = discreteUniform( 100, -50, 50, opts );
var y = discreteUniform( 100, -50, 50, opts );
logEachMap( 'hypot(%d,%d) = %0.4f', x, y, ampbm );
`
*
`c`
#include "stdlib/math/base/special/fast/alpha_max_plus_beta_min.h"
#### stdlib_base_fast_ampbm( x, y )
Computes the hypotenuse using the alpha max plus beta min algorithm.
`c`
double h = stdlib_base_fast_ampbm( -5.0, 12.0 );
// returns ~13.5
`c
#include "stdlib/math/base/special/fast/alpha_max_plus_beta_min.h"
#include
int main( void ) {
const double x[] = { 3.0, 4.0, 5.0, 12.0 };
double y;
int i;
for ( i = 0; i < 4; i += 2 ) {
y = stdlib_base_fast_ampbm( x[ i ], x[ i + 1 ] );
printf( "ampbm(%lf, %lf) = %lf\n", x[ i ], x[ i + 1 ], y );
}
}
`
- Lyons, Richard G. 2011. _Understanding Digital Signal Processing, 3rd Edition_. Prentice Hall.
*
- [@stdlib/math-base/special/hypot][@stdlib/math/base/special/hypot]: compute the hypotenuse avoiding overflow and underflow.
*
This package is part of [stdlib][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][stdlib], see the main project [repository][stdlib].
#### Community
[![Chat][chat-image]][chat-url]
---
See [LICENSE][stdlib-license].
Copyright © 2016-2026. The Stdlib [Authors][stdlib-authors].
[npm-image]: http://img.shields.io/npm/v/@stdlib/math-base-special-fast-alpha-max-plus-beta-min.svg
[npm-url]: https://npmjs.org/package/@stdlib/math-base-special-fast-alpha-max-plus-beta-min
[test-image]: https://github.com/stdlib-js/math-base-special-fast-alpha-max-plus-beta-min/actions/workflows/test.yml/badge.svg?branch=v0.3.1
[test-url]: https://github.com/stdlib-js/math-base-special-fast-alpha-max-plus-beta-min/actions/workflows/test.yml?query=branch:v0.3.1
[coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/math-base-special-fast-alpha-max-plus-beta-min/main.svg
[coverage-url]: https://codecov.io/github/stdlib-js/math-base-special-fast-alpha-max-plus-beta-min?branch=main
[chat-image]: https://img.shields.io/badge/zulip-join_chat-brightgreen.svg
[chat-url]: https://stdlib.zulipchat.com
[stdlib]: https://github.com/stdlib-js/stdlib
[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors
[umd]: https://github.com/umdjs/umd
[es-module]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Modules
[deno-url]: https://github.com/stdlib-js/math-base-special-fast-alpha-max-plus-beta-min/tree/deno
[deno-readme]: https://github.com/stdlib-js/math-base-special-fast-alpha-max-plus-beta-min/blob/deno/README.md
[umd-url]: https://github.com/stdlib-js/math-base-special-fast-alpha-max-plus-beta-min/tree/umd
[umd-readme]: https://github.com/stdlib-js/math-base-special-fast-alpha-max-plus-beta-min/blob/umd/README.md
[esm-url]: https://github.com/stdlib-js/math-base-special-fast-alpha-max-plus-beta-min/tree/esm
[esm-readme]: https://github.com/stdlib-js/math-base-special-fast-alpha-max-plus-beta-min/blob/esm/README.md
[branches-url]: https://github.com/stdlib-js/math-base-special-fast-alpha-max-plus-beta-min/blob/main/branches.md
[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/math-base-special-fast-alpha-max-plus-beta-min/main/LICENSE
[hypotenuse]: https://en.wikipedia.org/wiki/Pythagorean_theorem
[alpha-max-plus-beta-min]: https://en.wikipedia.org/wiki/Alpha_max_plus_beta_min_algorithm
[@stdlib/math/base/special/hypot]: https://www.npmjs.com/package/@stdlib/math-base-special-hypot