feat: add lapack/base/dlauu2

lib/node_modules/@stdlib/lapack/base/dlauu2/README.md

@@ -0,0 +1,234 @@
+<!--
+
+@license Apache-2.0
+
+Copyright (c) 2024 The Stdlib Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+   http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+
+-->
+
+# dlauu2
+
+> Compute the product `U*U^T` or `L^T*L`, where the triangular factor `U` or `L` is stored in the upper or lower triangular part of array `A`.
+
+<section class = "usage">
+
+## Usage
+
+```javascript
+var dlauu2 = require( '@stdlib/lapack/base/dlauu2' );
+```
+
+#### dlauu2( order, uplo, N, A, LDA )
+
+Computes the product `U*U^T` or `L^T*L`, where the triangular factor `U` or `L` is stored in the upper or lower triangular part of array `A`.
+
+```javascript
+var Float64Array = require( '@stdlib/array/float64' );
+
+var A = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+var out = dlauu2( 'row-major', 'upper', 2, A, 2 );
+// returns 0
+```
+
+The function has the following parameters:
+
+-   **order**: storage layout.
+-   **uplo**: specifies whether to copy the upper or lower triangular/trapezoidal part of matrix `A`.
+-   **N**: order of triangular factor `U` or `L`.
+-   **A**: input `Float64Array` containing the triangular factor `U` or `L`.
+-   **LDA**: stride of the first dimension of `A` (a.k.a., leading dimension of the matrix `A`).
+
+Note that indexing is relative to the first index. To introduce an offset, use [`typed array`][mdn-typed-array] views.
+
+<!-- eslint-disable stdlib/capitalized-comments -->
+
+```javascript
+var Float64Array = require( '@stdlib/array/float64' );
+
+// Initial arrays...
+var A0 = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] );
+
+// Create offset views...
+var A1 = new Float64Array( A0.buffer, A0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
+
+dlauu2( 'row-major', 'upper', 2, A1, 2 );
+// A0 => <Float64Array>[ 0.0, 5.0, 8.0, 3.0, 16.0 ]
+```
+
+#### dlauu2.ndarray( uplo, N, A, strideA1, strideA2, offsetA )
+
+Computes the product `U*U^T` or `L^T*L`, where the triangular factor `U` or `L` is stored in the upper or lower triangular part of array `A` using alternative indexing semantics.
+
+```javascript
+var Float64Array = require( '@stdlib/array/float64' );
+
+var A = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+var out = dlauu2.ndarray( 'upper', 2, A, 2, 1, 0 );
+// returns 0
+```
+
+The function has the following additional parameters:
+
+-   **order**: storage layout.
+-   **uplo**: specifies whether to copy the upper or lower triangular/trapezoidal part of matrix `A`.
+-   **N**: order of triangular factor `U` or `L`.
+-   **A**: input `Float64Array` containing the triangular factor `U` or `L`.
+-   **strideA1**: stride of the first dimension of `A`.
+-   **strideA2**: stride of the second dimension of `A`.
+-   **offsetA**: starting index for `A`.
+
+While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameters support indexing semantics based on starting indices. For example,
+
+<!-- eslint-disable max-len -->
+
+```javascript
+var Float64Array = require( '@stdlib/array/float64' );
+
+var A = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] );
+var out = dlauu2.ndarray( 'upper', 2, A, 2, 1, 1 );
+// returns 0
+```
+
+</section>
+
+<!-- /.usage -->
+
+<section class="notes">
+
+## Notes
+
+-   Both functions mutate the input array `A`.
+
+-   Both functions return a status code indicating success or failure. A status code indicates the following conditions:
+
+    -   `0`: successful exit.
+    -   `<0`: the k-th argument had an illegal value, where `-k` equals the status code value.
+
+-   `dlauu2()` corresponds to the [LAPACK][LAPACK] routine [`dlauu2`][lapack-dlauu2].
+
+</section>
+
+<!-- /.notes -->
+
+<section class="examples">
+
+## Examples
+
+<!-- eslint no-undef: "error" -->
+
+```javascript
+var Float64Array = require( '@stdlib/array/float64' );
+var dlauu2 = require( '@stdlib/lapack/base/dlauu2' );
+
+var A = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+dlauu2( 'row-major', 'upper', 2, A, 2 );
+console.log( 'A: ', A );
+```
+
+</section>
+
+<!-- /.examples -->
+
+<!-- C interface documentation. -->
+
+* * *
+
+<section class="c">
+
+## C APIs
+
+<!-- Section to include introductory text. Make sure to keep an empty line after the intro `section` element and another before the `/section` close. -->
+
+<section class="intro">
+
+</section>
+
+<!-- /.intro -->
+
+<!-- C usage documentation. -->
+
+<section class="usage">
+
+### Usage
+
+```c
+TODO
+```
+
+#### TODO
+
+TODO.
+
+```c
+TODO
+```
+
+TODO
+
+```c
+TODO
+```
+
+</section>
+
+<!-- /.usage -->
+
+<!-- C API usage notes. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="notes">
+
+</section>
+
+<!-- /.notes -->
+
+<!-- C API usage examples. -->
+
+<section class="examples">
+
+### Examples
+
+```c
+TODO
+```
+
+</section>
+
+<!-- /.examples -->
+
+</section>
+
+<!-- /.c -->
+
+<!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->
+
+<section class="related">
+
+</section>
+
+<!-- /.related -->
+
+<!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="links">
+
+[lapack]: https://www.netlib.org/lapack/explore-html/
+
+[lapack-dlauu2]: https://netlib.org/lapack/explore-html//d3/d8f/group__lauu2_ga52dc4db093f8513ca2f74195f3aaf689.html
+
+[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray
+
+</section>
+
+<!-- /.links -->

lib/node_modules/@stdlib/lapack/base/dlauu2/benchmark/benchmark.js

@@ -0,0 +1,99 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var bench = require( '@stdlib/bench' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var uniform = require( '@stdlib/random/array/uniform' );
+var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var pow = require( '@stdlib/math/base/special/pow' );
+var pkg = require( './../package.json' ).name;
+var dlauu2 = require( './../lib/dlauu2.js' );
+
+
+// VARIABLES //
+
+var options = {
+	'dtype': 'float64'
+};
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - array length
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len ) {
+	var N = floor( pow( len, 0.5 ) );
+	var M = floor( N / 2 );
+	var A = uniform( M * N, 0.0, 100.0, options );
+	return benchmark;
+
+	function benchmark( b ) {
+		var d;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			d = dlauu2( 'row-major', 'upper', M, A, N );
+			if ( isnan( d ) || isnan( A[i%A.length] ) ) {
+				b.fail( 'should not return NaN' );
+			}
+		}
+		b.toc();
+		if ( isnan( d ) || isnan( A[i%A.length] ) ) {
+			b.fail( 'should not return NaN' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var f;
+	var i;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( i = min; i <= max; i++ ) {
+		len = pow( 10, i );
+		f = createBenchmark( len );
+		bench( pkg+':order=row-major,len='+len, f );
+	}
+}
+
+main();