# Pages du manuel Linux : Fonctions des bibliothèques

dlaruv
return a vector of n random real numbers from a uniform (0,1)
dlarz
applie a real elementary reflector H to a real M-by-N matrix C, from either the left or the right
dlarzb
applie a real block reflector H or its transpose H**T to a real distributed M-by-N C from the left or the right
dlarzt
form the triangular factor T of a real block reflector H of order > n, which is defined as a product of k elementary reflectors
dlas2
compute the singular values of the 2-by-2 matrix [ F G ] [ 0 H ]
dlascl
multiplie the M by N real matrix A by the real scalar CTO/CFROM
dlasd0
a divide and conquer approach, DLASD0 computes the singular value decomposition (SVD) of a real upper bidiagonal N-by-M matrix B with diagonal D and offdiagonal E, where M = N + SQRE
dlasd1
compute the SVD of an upper bidiagonal N-by-M matrix B,
dlasd2
merge the two sets of singular values together into a single sorted set
dlasd3
find all the square roots of the roots of the secular equation, as defined by the values in D and Z
dlasd4
subroutine computes the square root of the I-th updated eigenvalue of a positive symmetric rank-one 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
dlasd5
subroutine computes the square root of the I-th eigenvalue of a positive symmetric rank-one modification of a 2-by-2 diagonal matrix diag( D ) * diag( D ) + RHO * Z * transpose(Z)
dlasd6
compute the SVD of an updated upper bidiagonal matrix B obtained by merging two smaller ones by appending a row
dlasd7
merge the two sets of singular values together into a single sorted set
dlasd8
find the square roots of the roots of the secular equation,
dlasd9
find the square roots of the roots of the secular equation,
dlasda
a divide and conquer approach, DLASDA computes the singular value decomposition (SVD) of a real upper bidiagonal N-by-M matrix B with diagonal D and offdiagonal E, where M = N + SQRE
dlasdq
compute the singular value decomposition (SVD) of a real (upper or lower) bidiagonal matrix with diagonal D and offdiagonal E, accumulating the transformations if desired
dlasdt
create a tree of subproblems for bidiagonal divide and conquer
dlaset
initialize an m-by-n matrix A to BETA on the diagonal and ALPHA on the offdiagonals
dlasorte
sort eigenpairs so that real eigenpairs are together and complex are together
dlasq1
compute the singular values of a real N-by-N bidiagonal matrix with diagonal D and off-diagonal E
dlasq2
compute all the eigenvalues of the symmetric positive definite tridiagonal matrix associated with the qd array Z to high relative accuracy are computed to high relative accuracy, in the absence of denormalization, underflow and overflow
dlasq3
check for deflation, computes a shift (TAU) and calls dqds
dlasq4
compute an approximation TAU to the smallest eigenvalue using values of d from the previous transform
dlasq5
compute one dqds transform in ping-pong form, one version for IEEE machines another for non IEEE machines
dlasq6
compute one dqd (shift equal to zero) transform in ping-pong form, with protection against underflow and overflow
dlasr
perform the transformation A := P*A, when SIDE = 'L' or 'l' ( Left-hand side ) A := A*P', when SIDE = 'R' or 'r' ( Right-hand side ) where A is an m by n real matrix and P is an orthogonal matrix,
dlasrt
the numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' )
dlasrt2
the numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' )
dlassq
return the values scl and smsq such that ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
dlasv2
compute the singular value decomposition of a 2-by-2 triangular matrix [ F G ] [ 0 H ]
dlaswp
perform a series of row interchanges on the matrix A
dlasy2
solve for the N1 by N2 matrix X, 1 <= N1,N2 <= 2, in op(TL)*X + ISGN*X*op(TR) = SCALE*B,
dlasyf
compute a partial factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
dlatbs
solve one of the triangular systems A *x = s*b or A'*x = s*b with scaling to prevent overflow, where A is an upper or lower triangular band matrix
dlatdf
use the LU factorization of the n-by-n matrix Z computed by DGETC2 and computes a contribution to the reciprocal Dif-estimate by solving Z * x = b for x, and choosing the r.h.s
dlatps
solve one of the triangular systems A *x = s*b or A'*x = s*b with scaling to prevent overflow, where A is an upper or lower triangular matrix stored in packed form
dlatrd
reduce NB rows and columns of a real symmetric matrix A to symmetric tridiagonal form by an orthogonal similarity transformation Q' * A * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of A
dlatrs
solve one of the triangular systems A *x = s*b or A'*x = s*b with scaling to prevent overflow
dlatrz
factor the M-by-(M+L) real upper trapezoidal matrix [ A1 A2 ] = [ A(1:M,1:M) A(1:M,N-L+1:N) ] as ( R 0 ) * Z, by means of orthogonal transformations
dlatzm
routine is deprecated and has been replaced by routine DORMRZ
dlauu2
compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A
dlauum
compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A
dlclose
close a dlopen object
dlerror
get diagnostic information
dlog.h
Contains a robust API for logging messages.
dlopen
Interface de programmation pour le chargeur de bibliothèques dynamiques.
dlopen