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 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x | /**
* @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 isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' );
// MAIN //
/**
* Performs the symmetric rank 1 operation `A = α*x*x^T + A` where `α` is a scalar, `x` is an `N` element vector, and `A` is an `N` by `N` symmetric matrix.
*
* @private
* @param {string} uplo - specifies whether the upper or lower triangular part of the symmetric matrix `A` should be referenced
* @param {NonNegativeInteger} N - number of columns in the matrix `A`
* @param {number} alpha - scalar constant
* @param {Object} x - input vector object
* @param {Collection} x.data - input vector data
* @param {Array<Function>} x.accessors - array element accessors
* @param {integer} strideX - stride length for `x`
* @param {NonNegativeInteger} offsetX - starting index for `x`
* @param {Object} A - input matrix object
* @param {Collection} A.data - input matrix data
* @param {Array<Function>} A.accessors - array element accessors
* @param {integer} strideA1 - stride of the first dimension of `A`
* @param {integer} strideA2 - stride of the second dimension of `A`
* @param {NonNegativeInteger} offsetA - starting index for `A`
* @returns {Object} input matrix object
*
* @example
* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
*
* var A = [ 1.0, 2.0, 3.0, 2.0, 1.0, 2.0, 3.0, 2.0, 1.0 ]; // => [ [ 1.0, 2.0, 3.0 ], [ 2.0, 1.0, 2.0 ], [ 3.0, 2.0, 1.0 ] ]
* var x = [ 1.0, 2.0, 3.0 ];
*
* gsyr( 'upper', 3, 1.0, arraylike2object( toAccessorArray( x ) ), 1, 0, arraylike2object( toAccessorArray( A ) ), 3, 1, 0 );
* // A => [ 2.0, 4.0, 6.0, 2.0, 5.0, 8.0, 3.0, 2.0, 10.0 ]
*/
function gsyr( uplo, N, alpha, x, strideX, offsetX, A, strideA1, strideA2, offsetA ) { // eslint-disable-line max-len
var getX;
var getA;
var setA;
var xbuf;
var Abuf;
var isrm;
var tmp;
var ix0;
var ix1;
var sa0;
var sa1;
var i0;
var i1;
var ia;
var ox;
var v;
// Cache references to array data:
xbuf = x.data;
Abuf = A.data;
// Cache references to element accessors:
getX = x.accessors[ 0 ];
getA = A.accessors[ 0 ];
setA = A.accessors[ 1 ];
isrm = isRowMajor( [ strideA1, strideA2 ] );
if ( isrm ) {
// For row-major matrices, the last dimension has the fastest changing index...
sa0 = strideA2; // stride for innermost loop
sa1 = strideA1; // stride for outermost loop
} else { // isColMajor
// For column-major matrices, the first dimension has the fastest changing index...
sa0 = strideA1; // stride for innermost loop
sa1 = strideA2; // stride for outermost loop
}
ox = offsetX;
if (
( !isrm && uplo === 'upper' ) ||
( isrm && uplo === 'lower' )
) {
ix1 = ox;
for ( i1 = 0; i1 < N; i1++ ) {
v = getX( xbuf, ix1 );
if ( v !== 0.0 ) {
tmp = alpha * v;
ia = offsetA + (sa1*i1);
ix0 = ox;
for ( i0 = 0; i0 <= i1; i0++ ) {
v = getX( xbuf, ix0 ) * tmp;
setA( Abuf, ia, getA( Abuf, ia ) + v );
ix0 += strideX;
ia += sa0;
}
}
ix1 += strideX;
}
return A;
}
// ( isrm && uplo === 'upper' ) || ( !isrm && uplo === 'lower' )
ix1 = ox;
for ( i1 = 0; i1 < N; i1++ ) {
v = getX( xbuf, ix1 );
if ( v !== 0.0 ) {
tmp = alpha * v;
ia = offsetA + (sa1*i1) + (sa0*i1);
ix0 = ix1;
for ( i0 = i1; i0 < N; i0++ ) {
v = getX( xbuf, ix0 ) * tmp;
setA( Abuf, ia, getA( Abuf, ia ) + v );
ix0 += strideX;
ia += sa0;
}
}
ix1 += strideX;
}
return A;
}
// EXPORTS //
module.exports = gsyr;
|