dgesc2.f (3)  Linux Man Pages
NAME
dgesc2.f 
SYNOPSIS
Functions/Subroutines
subroutine dgesc2 (N, A, LDA, RHS, IPIV, JPIV, SCALE)
DGESC2 solves a system of linear equations using the LU factorization with complete pivoting computed by sgetc2.
Function/Subroutine Documentation
subroutine dgesc2 (integerN, double precision, dimension( lda, * )A, integerLDA, double precision, dimension( * )RHS, integer, dimension( * )IPIV, integer, dimension( * )JPIV, double precisionSCALE)
DGESC2 solves a system of linear equations using the LU factorization with complete pivoting computed by sgetc2.
Purpose:

DGESC2 solves a system of linear equations A * X = scale* RHS with a general NbyN matrix A using the LU factorization with complete pivoting computed by DGETC2.
Parameters:

N
N is INTEGER The order of the matrix A.
AA is DOUBLE PRECISION array, dimension (LDA,N) On entry, the LU part of the factorization of the nbyn matrix A computed by DGETC2: A = P * L * U * Q
LDALDA is INTEGER The leading dimension of the array A. LDA >= max(1, N).
RHSRHS is DOUBLE PRECISION array, dimension (N). On entry, the right hand side vector b. On exit, the solution vector X.
IPIVIPIV is INTEGER array, dimension (N). The pivot indices; for 1 <= i <= N, row i of the matrix has been interchanged with row IPIV(i).
JPIVJPIV is INTEGER array, dimension (N). The pivot indices; for 1 <= j <= N, column j of the matrix has been interchanged with column JPIV(j).
SCALESCALE is DOUBLE PRECISION On exit, SCALE contains the scale factor. SCALE is chosen 0 <= SCALE <= 1 to prevent owerflow in the solution.
Author:

Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
Date:
 September 2012
Contributors:
 Bo Kagstrom and Peter Poromaa, Department of Computing Science, Umea University, S901 87 Umea, Sweden.
Definition at line 115 of file dgesc2.f.
Author
Generated automatically by Doxygen for LAPACK from the source code.
Linux man pages generated by: SysTutorials
Linux Man Pages Copyright Respective Owners. Site Copyright © SysTutorials. All Rights Reserved.