Scroll to navigation

SSPTRS(1) LAPACK routine (version 3.2) SSPTRS(1)

NAME

SSPTRS - solves a system of linear equations A*X = B with a real symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by SSPTRF

SYNOPSIS

UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )

CHARACTER UPLO INTEGER INFO, LDB, N, NRHS INTEGER IPIV( * ) REAL AP( * ), B( LDB, * )

PURPOSE

SSPTRS solves a system of linear equations A*X = B with a real symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by SSPTRF.

ARGUMENTS

Specifies whether the details of the factorization are stored as an upper or lower triangular matrix. = 'U': Upper triangular, form is A = U*D*U**T;
= 'L': Lower triangular, form is A = L*D*L**T.
The order of the matrix A. N >= 0.
The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSPTRF, stored as a packed triangular matrix.
Details of the interchanges and the block structure of D as determined by SSPTRF.
On entry, the right hand side matrix B. On exit, the solution matrix X.
The leading dimension of the array B. LDB >= max(1,N).
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
November 2008 LAPACK routine (version 3.2)