slaset (l)  Linux Man Pages
slaset: initializes an mbyn matrix A to BETA on the diagonal and ALPHA on the offdiagonals
Command to display slaset
manual in Linux: $ man l slaset
NAME
SLASET  initializes an mbyn matrix A to BETA on the diagonal and ALPHA on the offdiagonals
SYNOPSIS
 SUBROUTINE SLASET(

UPLO, M, N, ALPHA, BETA, A, LDA )

CHARACTER
UPLO

INTEGER
LDA, M, N

REAL
ALPHA, BETA

REAL
A( LDA, * )
PURPOSE
SLASET initializes an mbyn matrix A to BETA on the diagonal and
ALPHA on the offdiagonals.
ARGUMENTS
 UPLO (input) CHARACTER*1

Specifies the part of the matrix A to be set.
= aqUaq: Upper triangular part is set; the strictly lower
triangular part of A is not changed.
= aqLaq: Lower triangular part is set; the strictly upper
triangular part of A is not changed.
Otherwise: All of the matrix A is set.
 M (input) INTEGER

The number of rows of the matrix A. M >= 0.
 N (input) INTEGER

The number of columns of the matrix A. N >= 0.
 ALPHA (input) REAL

The constant to which the offdiagonal elements are to be set.
 BETA (input) REAL

The constant to which the diagonal elements are to be set.
 A (input/output) REAL array, dimension (LDA,N)

On exit, the leading mbyn submatrix of A is set as follows:
if UPLO = aqUaq, A(i,j) = ALPHA, 1<=i<=j1, 1<=j<=n,
if UPLO = aqLaq, A(i,j) = ALPHA, j+1<=i<=m, 1<=j<=n,
otherwise, A(i,j) = ALPHA, 1<=i<=m, 1<=j<=n, i.ne.j,
and, for all UPLO, A(i,i) = BETA, 1<=i<=min(m,n).
 LDA (input) INTEGER

The leading dimension of the array A. LDA >= max(1,M).
Pages related to slaset
 slaset (3)
 slas2 (l)  computes the singular values of the 2by2 matrix [ F G ] [ 0 H ]
 slascl (l)  multiplies the M by N real matrix A by the real scalar CTO/CFROM
 slascl2 (l)  performs a diagonal scaling on a vector
 slasd0 (l)  a divide and conquer approach, SLASD0 computes the singular value decomposition (SVD) of a real upper bidiagonal NbyM matrix B with diagonal D and offdiagonal E, where M = N + SQRE
 slasd1 (l)  computes the SVD of an upper bidiagonal NbyM matrix B,
 slasd2 (l)  merges the two sets of singular values together into a single sorted set
 slasd3 (l)  finds all the square roots of the roots of the secular equation, as defined by the values in D and Z
 slasd4 (l)  subroutine compute the square root of the Ith updated eigenvalue of a positive symmetric rankone modification to a positive diagonal matrix whose entries are given as the squares of the corresponding entries in the array d, and that 0 <= D(i) < D(j) for i < j and that RHO > 0
 slasd5 (l)  subroutine compute the square root of the Ith eigenvalue of a positive symmetric rankone modification of a 2by2 diagonal matrix diag( D ) * diag( D ) + RHO The diagonal entries in the array D are assumed to satisfy 0 <= D(i) < D(j) for i < j