# Pages du manuel Linux : Fonctions des bibliothèques

psgeqr2
compute a QR factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R
psgeqrf
compute a QR factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R
psgerfs
improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
psgerq2
compute a RQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R * Q
psgerqf
compute a RQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R * Q
psgesv
compute the solution to a real system of linear equations sub( A ) * X = sub( B ),
psgesvd
compute the singular value decomposition (SVD) of an M-by-N matrix A, optionally computing the left and/or right singular vectors
psgesvx
use the LU factorization to compute the solution to a real system of linear equations A(IA:IA+N-1,JA:JA+N-1) * X = B(IB:IB+N-1,JB:JB+NRHS-1),
psgetf2
compute an LU factorization of a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using partial pivoting with row interchanges
psgetrf
compute an LU factorization of a general M-by-N distributed matrix sub( A ) = (IA:IA+M-1,JA:JA+N-1) using partial pivoting with row interchanges
psgetri
compute the inverse of a distributed matrix using the LU factorization computed by PSGETRF
psgetrs
solve a system of distributed linear equations op( sub( A ) ) * X = sub( B ) with a general N-by-N distributed matrix sub( A ) using the LU factorization computed by PSGETRF
psggqrf
compute a generalized QR factorization of an N-by-M matrix sub( A ) = A(IA:IA+N-1,JA:JA+M-1) and an N-by-P matrix sub( B ) = B(IB:IB+N-1,JB:JB+P-1)
psggrqf
compute a generalized RQ factorization of an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
Psh::Completion
containing the completion routines of psh. Currently works with Term::ReadLine::Gnu and Term::ReadLine::Perl.
Psh::Joblist
A data structure suitable for handling job lists like bash's
Psh::Locale
containing base code for I18N
Psh::Locale::Default
containing translations for default locale
Psh::OS
Wrapper class for OS dependant stuff
Psh::OS::Win
Contains Windows specific code
Psh::Parser
Perl Shell Parser
Psh::PerlEval
package containing perl evaluation codes
Psh::Strategy
a Perl Shell Evaluation Strategy (base class)
Psh::Strategy::Bang
Evaluation strategies If the input line starts with ! all remaining input will be sent unchanged to /bin/sh
Psh::StrategyBunch
Evaluation strategies If the input line starts with ! all remaining input will be sent unchanged to /bin/sh If the input line starts with p! all remaining input will be sent unchanged to the perl interpreter Input within curly braces will be sent unchanged to the perl interpreter. Tries to detect perl builtins - this is helpful if you e.g. have a print command on your system. This is a small, minimal version without options which will react on your own sub's or on a limited list of important perl builtins. Please also see the strategy perlfunc_heavy This strategy will search for an executable file and execute it if possible. All input will be evaluated by the perl interpreter without any conditions.
psignal
Afficher le libellé d'un signal.
take as input the values computed by PSLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large
pslabrd
reduce the first NB rows and columns of a real general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower bidiagonal form by an orthogonal transformation Q' * A * P,
pslacon
estimate the 1-norm of a square, real distributed matrix A
pslaconsb
look for two consecutive small subdiagonal elements by seeing the effect of starting a double shift QR iteration given by H44, H33, & H43H34 and see if this would make a subdiagonal negligible
pslacp2
copie all or part of a distributed matrix A to another distributed matrix B
pslacp3
i an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa
pslacpy
copie all or part of a distributed matrix A to another distributed matrix B
pslaevswp
move the eigenvectors (potentially unsorted) from where they are computed, to a ScaLAPACK standard block cyclic array, sorted so that the corresponding eigenvalues are sorted
pslahqr
i an auxiliary routine used to find the Schur decomposition and or eigenvalues of a matrix already in Hessenberg form from cols ILO to IHI
pslahrd
reduce the first NB columns of a real general N-by-(N-K+1) distributed matrix A(IA:IA+N-1,JA:JA+N-K) so that elements below the k-th subdiagonal are zero
pslamch
determine single precision machine parameters
pslange
return the value of the one norm, or the Frobenius norm,
pslanhs
return the value of the one norm, or the Frobenius norm,
pslansy
return the value of the one norm, or the Frobenius norm,
pslantr
return the value of the one norm, or the Frobenius norm,
pslapiv
applie either P (permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pslapv2
applie either P (permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pslaqge
equilibrate a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using the row and scaling factors in the vectors R and C
pslaqsy
equilibrate a symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the scaling factors in the vectors SR and SC
pslared1d
redistribute a 1D array It assumes that the input array, BYCOL, is distributed across rows and that all process column contain the same copy of BYCOL
pslared2d
redistribute a 1D array It assumes that the input array, BYROW, is distributed across columns and that all process rows contain the same copy of BYROW
pslarf
applie a real elementary reflector Q (or Q**T) to a real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pslarfb
applie a real block reflector Q or its transpose Q**T to a real distributed M-by-N matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1)
pslarfg
generate a real elementary reflector H of order n, such that H * sub( X ) = H * ( x(iax,jax) ) = ( alpha ), H' * H = I