# Pages du manuel Linux : Fonctions des bibliothèques

Digest::SHA1
Perl interface to the SHA-1 algorithm
digi_recorder
Hook notifying you when a new sample buffer becomes available. Allegro game programming library.
digraph
Directed Graphs
digraph_utils
Algorithms for Directed Graphs
dirfd
Obtenir un descripteur fichier pour un répertoire.
DirHandle
supply object methods for directory handles
dirname
report the parent directory name of a file pathname
disable_hardware_cursor
Disables the OS hardware cursor. Allegro game programming library.
disjointlistbox
Create and manipulate a disjointlistbox widget
disksup
A Disk Supervisor Process.
disk_log
A disk based term logging facility
DisplayCells
See AllPlanes.3
DisplayHeight
See ImageByteOrder.3
DisplayHeightMM
See ImageByteOrder.3
DisplayOfCCC
Color Conversion Context macros
DisplayOfScreen
See BlackPixelOfScreen.3
DisplayPlanes
See AllPlanes.3
DisplayString
See AllPlanes.3
DisplayWidth
See ImageByteOrder.3
DisplayWidthMM
See ImageByteOrder.3
div
compute the quotient and remainder of an integer division
div
Calculer le quotient et le reste d'une division entière.
DL
generate logging messages in C and C++ using a debugger
take as input the values computed by DLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large
dlabrd
reduce the first NB rows and columns of a real general m by n matrix A to upper or lower bidiagonal form by an orthogonal transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transformation to the unreduced part of A
dlacon
estimate the 1-norm of a square, real matrix A
dlacpy
copie all or part of a two-dimensional matrix A to another matrix B
perform complex division in real arithmetic a + i*b p + i*q = --------- c + i*d The algorithm is due to Robert L
dlae2
compute the eigenvalues of a 2-by-2 symmetric matrix [ A B ] [ B C ]
dlaebz
contain the iteration loops which compute and use the function N(w), which is the count of eigenvalues of a symmetric tridiagonal matrix T less than or equal to its argument w
dlaed0
compute all eigenvalues and corresponding eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
dlaed1
compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
dlaed2
merge the two sets of eigenvalues together into a single sorted set
dlaed3
find the roots of the secular equation, as defined by the values in D, W, and RHO, between 1 and K
dlaed4
subroutine computes the I-th updated eigenvalue of a symmetric rank-one modification to a diagonal matrix whose elements are given in the array d, and that D(i) < D(j) for i < j and that RHO > 0
dlaed5
subroutine computes the I-th eigenvalue of a symmetric rank-one modification of a 2-by-2 diagonal matrix diag( D ) + RHO * Z * transpose(Z)
dlaed6
compute the positive or negative root (closest to the origin) of z(1) z(2) z(3) f(x) = rho + --------- + ---------- + --------- d(1)-x d(2)-x d(3)-x It is assumed that if ORGATI = .true
dlaed7
compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
dlaed8
merge the two sets of eigenvalues together into a single sorted set
dlaed9
find the roots of the secular equation, as defined by the values in D, Z, and RHO, between KSTART and KSTOP
dlaeda
compute the Z vector corresponding to the merge step in the CURLVLth step of the merge process with TLVLS steps for the CURPBMth problem
dlaein
use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue (WR,WI) of a real upper Hessenberg matrix H
dlaev2
compute the eigendecomposition of a 2-by-2 symmetric matrix [ A B ] [ B C ]
dlaexc
swap adjacent diagonal blocks T11 and T22 of order 1 or 2 in an upper quasi-triangular matrix T by an orthogonal similarity transformation
dlag2
compute the eigenvalues of a 2 x 2 generalized eigenvalue problem A - w B, with scaling as necessary to avoid over-/underflow
dlags2
compute 2-by-2 orthogonal matrices U, V and Q, such that if ( UPPER ) then U'*A*Q = U'*( A1 A2 )*Q = ( x 0 ) ( 0 A3 ) ( x x ) and V'*B*Q = V'*( B1 B2 )*Q = ( x 0 ) ( 0 B3 ) ( x x ) or if ( .NOT.UPPER ) then U'*A*Q = U'*( A1 0 )*Q = ( x x ) ( A2 A3 ) ( 0 x ) and V'*B*Q = V'*( B1 0 )*Q = ( x x ) ( B2 B3 ) ( 0 x ) The rows of the transformed A and B are parallel, where U = ( CSU SNU ), V = ( CSV SNV ), Q = ( CSQ SNQ ) ( -SNU CSU ) ( -SNV CSV ) ( -SNQ CSQ ) Z' denotes the transpose of Z
dlagtf
factorize the matrix (T - lambda*I), where T is an n by n tridiagonal matrix and lambda is a scalar, as T - lambda*I = PLU,
dlagtm
perform a matrix-vector product of the form B := alpha * A * X + beta * B where A is a tridiagonal matrix of order N, B and X are N by NRHS matrices, and alpha and beta are real scalars, each of which may be 0., 1., or -1
dlagts
may be used to solve one of the systems of equations (T - lambda*I)*x = y or (T - lambda*I)'*x = y,
dlagv2
compute the Generalized Schur factorization of a real 2-by-2 matrix pencil (A,B) where B is upper triangular