Skip to content

feat: add lapack/base/iladlr #7076

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 31 commits into from
Jun 5, 2025
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
31 commits
Select commit Hold shift + click to select a range
279d9e0
feat: add base implementation for iladlr
aayush0325 May 23, 2025
7da1c23
feat: complete writing main implementation
aayush0325 May 23, 2025
cfa7d57
test: add basic tests
aayush0325 May 23, 2025
1a5ea04
test: add offset tests
aayush0325 May 23, 2025
0247c51
test: add mixed strides tests
aayush0325 May 23, 2025
d65d718
test: add tests for negative strides
aayush0325 May 23, 2025
cd0f59a
test: add large strides
aayush0325 May 23, 2025
6bb91d9
chore: copyright years
aayush0325 May 23, 2025
a5c4abd
chore: formatting fixtures json
aayush0325 May 23, 2025
9429930
test: more tests
aayush0325 May 23, 2025
2b55f10
bench: add benchmarks
aayush0325 May 23, 2025
da8c580
docs: add ts declaration file
aayush0325 May 23, 2025
b21fcc4
docs: add test.ts
aayush0325 May 23, 2025
8fe0be2
docs: add REAMDE
aayush0325 May 23, 2025
d2707a8
docs: add repl.txt
aayush0325 May 23, 2025
6a1e297
chore: copyright years
aayush0325 May 23, 2025
00bfabd
docs: update description
aayush0325 May 25, 2025
3d91f56
refactor: cleanup
aayush0325 Jun 4, 2025
c0941f2
refactor: optimize loops
kgryte Jun 5, 2025
04bb1f1
bench: measure worst case scenario
kgryte Jun 5, 2025
1098885
docs: add notes
kgryte Jun 5, 2025
9ce890f
docs: add notes
kgryte Jun 5, 2025
e5cc457
docs: update descriptions
kgryte Jun 5, 2025
bdec61f
docs: fix signature and add note
kgryte Jun 5, 2025
a03e16c
refactor: add LDA check
kgryte Jun 5, 2025
39c022b
refactor: use "fast" max
kgryte Jun 5, 2025
38ad0f4
test: add test
kgryte Jun 5, 2025
c5a007c
test: update test descriptions
kgryte Jun 5, 2025
48e8254
bench: fix array creation
kgryte Jun 5, 2025
b6e6251
bench: fix require path
kgryte Jun 5, 2025
a15b026
bench: fix function invocation
kgryte Jun 5, 2025
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
262 changes: 262 additions & 0 deletions lib/node_modules/@stdlib/lapack/base/iladlr/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,262 @@
<!--

@license Apache-2.0

Copyright (c) 2025 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.

-->

# iladlr

> Find the index of the last non-zero row in a matrix `A`.

<section class="usage">

## Usage

```javascript
var iladlr = require( '@stdlib/lapack/base/iladlr' );
```

#### iladlr( order, M, N, A, LDA )

Returns the index of the last non-zero row in a matrix `A`.

```javascript
var Float64Array = require( '@stdlib/array/float64' );

var A = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ] );

/*
A = [
[ 1.0, 2.0 ],
[ 3.0, 4.0 ],
[ 0.0, 0.0 ]
]
*/

var out = iladlr( 'row-major', 3, 2, A, 2 );
// returns 1
```

The function has the following parameters:

- **order**: storage layout.
- **M**: number of rows in `A`.
- **N**: number of columns in `A`.
- **A**: input [`Float64Array`][mdn-float64array].
- **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 array:
var A0 = new Float64Array( [ 9999.0, 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ] );

// Create an offset view:
var A1 = new Float64Array( A0.buffer, A0.BYTES_PER_ELEMENT*1 ); // start at 2nd element

var out = iladlr( 'row-major', 3, 2, A1, 2 );
// returns 1
```

#### iladlr.ndarray( M, N, A, strideA1, strideA2, offsetA )

Returns the index of the last non-zero row in a matrix `A` using alternative indexing semantics.

```javascript
var Float64Array = require( '@stdlib/array/float64' );

var A = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ] );

/*
A = [
[ 1.0, 2.0 ],
[ 3.0, 4.0 ],
[ 0.0, 0.0 ]
]
*/

var out = iladlr.ndarray( 3, 2, A, 2, 1, 0 );
// returns 1
```

The function has the following parameters:

- **M**: number of rows in `A`.
- **N**: number of columns in `A`.
- **A**: input [`Float64Array`][mdn-float64array].
- **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 parameter supports indexing semantics based on a starting index. For example,

```javascript
var Float64Array = require( '@stdlib/array/float64' );

var A = new Float64Array( [ 9999.0, 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ] );

/*
A = [
[ 1.0, 2.0 ],
[ 3.0, 4.0 ],
[ 0.0, 0.0 ]
]
*/

var out = iladlr.ndarray( 3, 2, A, 2, 1, 1 );
// returns 1
```

</section>

<!-- /.usage -->

<section class="notes">

## Notes

- This routine is commonly used throughout LAPACK to shrink work domains (e.g., before bulge-chasing, deflation, or when trimming Householder panels), thus ensuring that higher-level routines operate only on numerically relevant sub-matrices.
- `iladlr()` corresponds to the [LAPACK][lapack] routine [`iladlr`][lapack-iladlr].

</section>

<!-- /.notes -->

<section class="examples">

## Examples

<!-- eslint no-undef: "error" -->

```javascript
var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
var Float64Array = require( '@stdlib/array/float64' );
var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
var iladlr = require( '@stdlib/lapack/base/iladlr' );

var shape = [ 3, 3 ];
var order = 'row-major';
var strides = shape2strides( shape, order );

var A = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 0.0, 0.0, 0.0 ] );
console.log( ndarray2array( A, shape, strides, 0, order ) );

var out = iladlr( order, shape[ 0 ], shape[ 1 ], A, strides[ 0 ] );
console.log( out );
```

</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-iladlr]: https://www.netlib.org/lapack/explore-html/da/d60/group__ilalr_gadb53a9bd5cc7a6e3bbca7bf4eca32208.html

[mdn-float64array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Float64Array

[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray

</section>

<!-- /.links -->
111 changes: 111 additions & 0 deletions lib/node_modules/@stdlib/lapack/base/iladlr/benchmark/benchmark.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,111 @@
/**
* @license Apache-2.0
*
* Copyright (c) 2025 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 isnan = require( '@stdlib/math/base/assert/is-nan' );
var zeros = require( '@stdlib/array/zeros' );
var pow = require( '@stdlib/math/base/special/pow' );
var floor = require( '@stdlib/math/base/special/floor' );
var pkg = require( './../package.json' ).name;
var iladlr = require( './../lib/iladlr.js' );


// VARIABLES //

var LAYOUTS = [
'row-major',
'column-major'
];


// FUNCTIONS //

/**
* Creates a benchmark function.
*
* @private
* @param {string} order - storage layout
* @param {PositiveInteger} N - number of elements along each dimension
* @returns {Function} benchmark function
*/
function createBenchmark( order, N ) {
var A = zeros( N*N, 'float64' );
return benchmark;

/**
* Benchmark function.
*
* @private
* @param {Benchmark} b - benchmark instance
*/
function benchmark( b ) {
var z;
var i;

b.tic();
for ( i = 0; i < b.iterations; i++ ) {
A[ 0 ] = i;
z = iladlr( order, N, N, A, N );
if ( isnan( z ) ) {
b.fail( 'should not return NaN' );
}
}
b.toc();
if ( isnan( z ) ) {
b.fail( 'should not return NaN' );
}
b.pass( 'benchmark finished' );
b.end();
}
}


// MAIN //

/**
* Main execution sequence.
*
* @private
*/
function main() {
var min;
var max;
var ord;
var N;
var f;
var i;
var k;

min = 1; // 10^min
max = 6; // 10^max

for ( k = 0; k < LAYOUTS.length; k++ ) {
ord = LAYOUTS[ k ];
for ( i = min; i <= max; i++ ) {
N = floor( pow( pow( 10, i ), 1.0/2.0 ) );
f = createBenchmark( ord, N );
bench( pkg+'::square_matrix:order='+ord+',size='+(N*N), f );
}
}
}

main();
Loading