Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 | 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 29x 29x 29x 29x 29x 29x 29x 29x 2x 2x 27x 29x 13x 13x 13x 14x 29x 42x 42x 126x 126x 126x 42x 42x 14x 29x 3x 3x 3x 3x 3x | /**
* @license Apache-2.0
*
* Copyright (c) 2026 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 arraylike2object = require( '@stdlib/array/base/arraylike2object' );
var accessors = require( './accessors.js' );
// MAIN //
/**
* Generates a Hilbert matrix using alternative indexing semantics.
*
* @param {NonNegativeInteger} N - number of rows and columns of the output matrix
* @param {Collection} out - output array
* @param {integer} strideOut1 - stride length for the first dimension of `out`
* @param {integer} strideOut2 - stride length for the second dimension of `out`
* @param {NonNegativeInteger} offsetOut - starting index for `out`
* @returns {Collection} output matrix
*
* @example
* var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
*
* ghilbert( 3, out, 3, 1, 0 );
* // out => [ 1.0, 0.5, ~0.3333, 0.5, ~0.3333, 0.25, ~0.3333, 0.25, 0.2 ]
*/
function ghilbert( N, out, strideOut1, strideOut2, offsetOut ) {
var oo;
var io;
var ij;
var i;
var j;
if ( N <= 0 ) {
return out;
}
oo = arraylike2object( out );
if ( oo.accessorProtocol ) {
accessors( N, oo, strideOut1, strideOut2, offsetOut );
return out;
}
io = offsetOut;
for ( i = 0; i < N; i++ ) {
ij = io;
for ( j = 0; j < N; j++ ) {
out[ ij ] = 1.0 / ( i + j + 1 );
ij += strideOut2;
}
io += strideOut1;
}
return out;
}
// EXPORTS //
module.exports = ghilbert;
|