If you need to make conference calls for your business, consider enlisting the aid of a professional teleconferencing service. It doesn't have to be major expense because you sign up for free conference calling with a reliable company online.
Linux Manual Pages - section 3 (library calls)_ | a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z | Displaying 796 of 18427 d2i_ASN1_OBJECT - ASN1 OBJECT IDENTIFIER functionsd2i_DHparams - PKCS#3 DH parameter functions. d2i_DSAPublicKey - d2i_DSAPublicKey, i2d_DSAPublicKey, d2i_DSAPrivateKey, i2d_DSAPrivateKey, d2i_PKCS8PrivateKey - d2i_PKCS8PrivateKey_bio, d2i_PKCS8PrivateKey_fp, d2i_RSAPublicKey - d2i_RSAPublicKey, i2d_RSAPublicKey, d2i_RSAPrivateKey, i2d_RSAPrivateKey, d2i_SSL_SESSION - convert SSL_SESSION object from/to ASN1 representation d2i_X509 - d2i_X509, i2d_X509, d2i_X509_bio, d2i_X509_fp, i2d_X509_bio, d2i_X509_ALGOR - AlgorithmIdentifier functions. d2i_X509_CRL - d2i_X509_CRL, i2d_X509_CRL, d2i_X509_CRL_bio, d2i_509_CRL_fp, d2i_X509_NAME - X509_NAME encoding functions d2i_X509_REQ - d2i_X509_REQ, i2d_X509_REQ, d2i_X509_REQ_bio, d2i_X509_REQ_fp, d2i_X509_SIG - DigestInfo functions. daemon - run in the background daemon.h - A header file including all other header files part of libdaemon. data - test for off-screen data in given forms Data::Compare - compare perl data structures Data::Dumper - stringified perl data structures, suitable for both printing and "eval" Data::Dumper::Simple - Easily dump variables with names DATAFILE - DATAFILE Data::Flow - Perl extension for simple-minded recipe-controlled build of data. Data::FormValidator - Validates user input (usually from an HTML form) based Data::FormValidator::Constraints - Basic sets of constraints on input profile. Data::FormValidator::Constraints::Dates - Validate Dates and Times Data::FormValidator::ConstraintsFactory - Module to create constraints for HTML::FormValidator. Data::FormValidator::Constraints::Upload - Validate File Uploads Data::FormValidator::Filters - Basic set of filters available in an Data::FormValidator profile. Data::FormValidator::Results - results of form input validation. Data::Grove - Data::Grove -- support for deeply nested structures Data::Grove::Parent - provide parent properties to Data::Grove objects Data::Grove::Visitor - add visitor/callback methods to Data::Grove objects Data::Hierarchy - Handle data in a hierarchical structure Data::Page - help when paging through sets of results Data::ShowTable - routines to display tabular data in several formats. Data::Sorting - Multi-key sort using function results Date - The Date class uses a julian date representation of the current year, month, and day. julian number based date class. Date::Calc - Gregorian calendar date calculations Date::Calc::Object - Object-oriented add-on for Date::Calc with overloaded operators Date::Calendar - Calendar objects for different holiday schemes Date::Calendar::Profiles - Some sample profiles for Date::Calendar Date::Calendar::Year - Implements embedded "year" objects for Date::Calendar Date::Format - Date formating subroutines Date::ICal - Perl extension for ICalendar date objects. Date::ICal::Duration - durations in iCalendar format, for math purposes. Date::Leapyear - Is a particular year a leap year? Date::Manip - date manipulation routines DateNumber - A number class that manipulates a string buffer that is also a date. a number that is also a date string. Date::Parse - Parse date strings into time values Date::Pcalc - Gregorian calendar date calculations Date::Simple - a simple date object Date::Simple::D8 - Sub class of Date::Simple with eight digit date style formatting Date::Simple::Fmt - Sub class of Date::Simple with per object level formatting for Date::Simple::ISO - Sub class of Date::Simple Date::Simple::NoXS - Pure Perl support for Date::Simple. Datetime - The Datetime class uses a julian date representation of the current year, month, and day and a integer representation of the current time. Integer based time class. DateTime::Calendar::Discordian - Perl extension for the Discordian Calendar DateTime::Duration - Duration objects for date math DateTime::Infinite - Infinite past and future DateTime objects DateTime::LeapSecond - leap seconds table and utilities DateTime::Locale - Localization support for DateTime DateTime::Locale::Alias::ISO639_2 - Adds ISO 639 2 language locale id aliases DateTime::Locale::Base - Base class for individual locale objects DateTime::LocaleCatalog - Provides a list of all valid locale names DateTime::TimeZone - Time zone object base class and factory DateTime::TimeZoneCatalog - Provides a list of all valid time zone names DateTime::TimeZone::Floating - A time zone that is always local DateTime::TimeZone::Local - Code to determine the system's local time zone DateTime::TimeZone::OffsetOnly - A DateTime::TimeZone object that just contains an offset DateTime::TimeZone::OlsonDB - An object to represent an Olson time zone database DateTime::TimeZone::UTC - The UTC time zone db - programmatic interface to the Perl debugging API (draft, subject to DB - programmatic interface to the Perl debugging API (draft, subject to DBD::AnyData - 1 DBD::CSV - DBI driver for CSV files DBD::dbftp - dbftp database driver for the DBI module DBD::DBM - a DBI driver for DBM & MLDBM files DBD::Excel - DBD::Excel - A class for DBI drivers that act on Excel File. DBD::File - Base class for writing DBI drivers DBD::LDAP - 3 DBD::MaxDB - MySQL MaxDB database driver for the DBI module DBD::mysql - MySQL driver for the Perl5 Database Interface (DBI) DBD::mysql::INSTALL - How to install and configure DBD::mysql DBD::ODBC - ODBC Driver for DBI DBD::Pg - PostgreSQL database driver for the DBI module DBD::Proxy - A proxy driver for the DBI dbdsdc - compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B DBD::Sponge - Create a DBI statement handle from Perl data DBD::SQLite - Self Contained RDBMS in a DBI Driver DBD::SQLite2 - Self Contained RDBMS in a DBI Driver (sqlite 2.x) DBD::SQLRelay - perl DBI driver for SQL Relay dbdsqr - compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B DBD::Sybase - Sybase database driver for the DBI module DBD::XBase - DBI driver for XBase compatible database files DBE - Double Buffer Extension DB_File - Perl5 access to Berkeley DB version 1.x DB_File::Lock - Locking with flock wrapper for DB_File dbg - The Text Based Trace Facility DBI - Database independent interface for Perl DBI::Const::GetInfo::ANSI - ISO/IEC SQL/CLI Constants for GetInfo DBI::Const::GetInfo::ODBC - ODBC Constants for GetInfo DBI::Const::GetInfoReturn - Data and functions for describing GetInfo results DBI::Const::GetInfoType - Data describing GetInfo type codes DBI::DBD - Perl DBI Database Driver Writer's Guide DBI::DBD::Metadata - Generate the code and data for some DBI metadata methods DBI::FAQ - DBI::FAQ -- The Frequently Asked Questions for the Perl5 Database Interface DBI::Profile - Performance profiling and benchmarking for the DBI DBI::ProfileData - manipulate DBI::ProfileDumper data dumps DBI::ProfileDumper - profile DBI usage and output data to a file DBI::ProfileDumper::Apache - capture DBI profiling data from Apache/mod_perl DBI::ProxyServer - a server for the DBD::Proxy driver DBI::PurePerl - DBI::PurePerl -- a DBI emulation using pure perl (no C/XS compilation required) DBI::SQL::Nano - a very tiny SQL engine d_bitmap_proc - d_bitmap_proc DBI::W32ODBC - An experimental DBI emulation layer for Win32::ODBC DBIx::Abstract - DBI SQL abstraction DBIx::CGI - Easy to Use DBI interface for CGI scripts DBIx::Compat - Perl extension for Compatibility Infos about DBD Drivers DBIx::ContextualFetch - Add contextual fetches to DBI DBIx::Database - Perl extension for DBI recordsets DBIx::DataSource - Database-independant create and drop functions DBIx::DataSource::Driver - Driver Writer's Guide and base class DBIx::DataSource::mysql - MySQL driver for DBIx::DataSource DBIx::DataSource::Pg - PostgreSQL driver for DBIx::DataSource DBIx::DBSchema - Database-independent schema objects DBIx::DBSchema::ColGroup - Column group objects DBIx::DBSchema::ColGroup::Index - Index column group object DBIx::DBSchema::ColGroup::Unique - Unique column group object DBIx::DBSchema::Column - Column objects DBIx::DBSchema::DBD - DBIx::DBSchema Driver Writer's Guide and Base Class DBIx::DBSchema::DBD::mysql - MySQL native driver for DBIx::DBSchema DBIx::DBSchema::DBD::Oracle - Oracle native driver for DBIx::DBSchema DBIx::DBSchema::DBD::Pg - PostgreSQL native driver for DBIx::DBSchema DBIx::DBSchema::DBD::Sybase - Sybase database driver for DBIx::DBSchema DBIx::DBSchema::Table - Table objects DBIx::Easy - Easy to Use DBI interface DBIx::Intrors - Embperl and DBIx::Recordset DBIx::Password - Allows you to create a global password file for DB passwords DBIx::Profile - 2 DBIx::Recordset - Perl extension for DBI recordsets DBIx::Recordset::DBSeq - Sequence generator in DBI database DBIx::Recordset::FileSeq - Sequence generator in Filesystem DBIx::SearchBuilder - Encapsulate SQL queries and rows in simple perl objects DBIx::SearchBuilder::Handle - Perl extension which is a generic DBI handle DBIx::SearchBuilder::Handle::Informix - 1 DBIx::SearchBuilder::Handle::mysql - 1 DBIx::SearchBuilder::Handle::mysqlPP - A mysql specific Handle object DBIx::SearchBuilder::Handle::ODBC - 1 DBIx::SearchBuilder::Handle::Oracle - 1 DBIx::SearchBuilder::Handle::Pg - 1 DBIx::SearchBuilder::Handle::SQLite - 1 DBIx::SearchBuilder::Handle::Sybase - 1 DBIx::SearchBuilder::Record - Superclass for records loaded by SearchBuilder DBIx::SearchBuilder::Record::Cachable - Records with caching behavior DBIx::SearchBuilder::Union - Deal with multiple SearchBuilder result sets as one DBIx::SearchBuilder::Unique - Ensure uniqueness of records in a collection DBIx::XMLMessage - 2 DBIx::XML_RDB - DBIx::XML_RDB /- Perl extension for creating XML from existing DBI datasources DBM_Filter - DBM_Filter -- Filter DBM keys/values DBM_Filter::compress - DBM_Filter::encode - DBM_Filter::int32 - DBM_Filter::null - DBM_Filter::utf8 - dbopen - database access methods d_box_proc - d_box_proc, d_shadow_box_proc d_button_proc - d_button_proc dcabs1 - complex double precision absolute value dcgettext - d_check_proc - d_check_proc d_clear_proc - d_clear_proc dcngettext - DCOP - Perl extension for communcation with KDE's DCOP server d_ctext_proc - ddbtf2 - compute an LU factorization of a real m-by-n band matrix A without using partial pivoting with row interchanges ddbtrf - compute an LU factorization of a real m-by-n band matrix A without using partial pivoting or row interchanges dde - Execute a Dynamic Data Exchange command ddisna - compute the reciprocal condition numbers for the eigenvectors of a real symmetric or complex Hermitian matrix or for the left or right singular vectors of a general m-by-n matrix ddttrf - compute an LU factorization of a complex tridiagonal matrix A using elimination without partial pivoting ddttrsv - solve one of the systems of equations L * X = B, L**T * X = B, or L**H * X = B, deallocate_voice - deallocate_voice DebAux::Debconf - 1 DebAux::Util - utility functions for scripts of the debaux suite Debconf::Client::ConfModule - client module for ConfModules Debian::debsigs::debsigsmain - Perl extension for signing Debian packages Debian::DictionariesCommon - dictionaries-common library DebianNet - create, remove, enable or disable entry debugger - Erlang Debugger Debug::Trace - Perl extension to trace subroutine calls d_edit_proc - d_edit_proc DefaultColormap - DefaultColormapOfScreen - default_colors - use_default_colors , DefaultDepth - DefaultDepthOfScreen - DefaultGC - DefaultGCOfScreen - default_palette - default_palette DefaultRootWindow - DefaultScreen - DefaultScreenOfDisplay - default_store - generic storage of global data. DefaultVisual - DefaultVisualOfScreen - define_key - define a keycode Defoma::Common - Defoma module providing miscellaneous functions. Defoma::Font - Defoma module to handle font and font-cache. Defoma::Id - Defoma module to handle Id cache. Defoma::Subst - Defoma module to handle Subst cache/rule. defs.h - delch - delch , delete - delete things in the interpreter delete_file - delete_file deleteln - deleteln , des - DES_random_key, DES_set_key, DES_key_sched, DES_set_key_checked, des_crypt - fast DES encryption desktop_color_depth - desktop_color_depth desktop_palette - desktop_palette des_setparity - DestinationListHandler - This class handles a list of destination addresses. destroy - Destroy one or more windows destroy_bitmap - destroy_bitmap destroy_compiled_sprite - destroy_compiled_sprite destroy_font - destroy_font destroy_gfx_mode_list - destroy_gfx_mode_list destroy_midi - destroy_midi destroy_rle_sprite - destroy_rle_sprite destroy_sample - destroy_sample destroy_scene - destroy_scene destroy_zbuffer - destroy_zbuffer details - detect_digi_driver - detect_digi_driver detect_midi_driver - detect_midi_driver dets - A Disk Based Term Storage Devel::CoreStack - try to generate a stack dump from a core file Devel::DProf - a Perl code profiler Devel::GraphVizProf - per-line Perl profiler (with graph output) Devel::Peek - A data debugging tool for the XS programmer Devel::PPPort - Perl/Pollution/Portability Devel::ptkdb - Perl debugger using a Tk GUI Devel::SelfStubber - generate stubs for a SelfLoading module Devel::StackTrace - Stack trace and stack trace frame objects Devel::Symdump - dump symbol names or the symbol table devices - Device::SerialPort - Linux/POSIX emulation of Win32::SerialPort functions. dexec.h - Contains a robust API for running sub processes with STDOUT and STDERR redirected to syslog. dfork.h - Contains an API for doing a daemonizing fork(). dgbbrd - reduce a real general m-by-n band matrix A to upper bidiagonal form B by an orthogonal transformation dgbcon - estimate the reciprocal of the condition number of a real general band matrix A, in either the 1-norm or the infinity-norm, dgbequ - compute row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number dgbmv - perform one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, dgbrfs - improve the computed solution to a system of linear equations when the coefficient matrix is banded, and provides error bounds and backward error estimates for the solution dgbsv - compute the solution to a real system of linear equations A * X = B, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices dgbsvx - use the LU factorization to compute the solution to a real system of linear equations A * X = B, A**T * X = B, or A**H * X = B, dgbtf2 - compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges dgbtrf - compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges dgbtrs - solve a system of linear equations A * X = B or A' * X = B with a general band matrix A using the LU factorization computed by DGBTRF dgebak - form the right or left eigenvectors of a real general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by DGEBAL dgebal - balance a general real matrix A dgebd2 - reduce a real general m by n matrix A to upper or lower bidiagonal form B by an orthogonal transformation dgebrd - reduce a general real M-by-N matrix A to upper or lower bidiagonal form B by an orthogonal transformation dgecon - estimate the reciprocal of the condition number of a general real matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by DGETRF dgeequ - compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number dgees - compute for an N-by-N real nonsymmetric matrix A, the eigenvalues, the real Schur form T, and, optionally, the matrix of Schur vectors Z dgeesx - compute for an N-by-N real nonsymmetric matrix A, the eigenvalues, the real Schur form T, and, optionally, the matrix of Schur vectors Z dgeev - compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors dgeevx - compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors dgegs - routine is deprecated and has been replaced by routine DGGES dgegv - routine is deprecated and has been replaced by routine DGGEV dgehd2 - reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation dgehrd - reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation dgelq2 - compute an LQ factorization of a real m by n matrix A dgelqf - compute an LQ factorization of a real M-by-N matrix A dgels - solve overdetermined or underdetermined real linear systems involving an M-by-N matrix A, or its transpose, using a QR or LQ factorization of A dgelsd - compute the minimum-norm solution to a real linear least squares problem dgelss - compute the minimum norm solution to a real linear least squares problem dgelsx - routine is deprecated and has been replaced by routine DGELSY dgelsy - compute the minimum-norm solution to a real linear least squares problem dgemm - perform one of the matrix-matrix operations C := alpha*op( A )*op( B ) + beta*C, dgemv - perform one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, dgeql2 - compute a QL factorization of a real m by n matrix A dgeqlf - compute a QL factorization of a real M-by-N matrix A dgeqp3 - compute a QR factorization with column pivoting of a matrix A dgeqpf - routine is deprecated and has been replaced by routine DGEQP3 dgeqr2 - compute a QR factorization of a real m by n matrix A dgeqrf - compute a QR factorization of a real M-by-N matrix A dger - perform the rank 1 operation A := alpha*x*y' + A, dgerfs - improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution dgerq2 - compute an RQ factorization of a real m by n matrix A dgerqf - compute an RQ factorization of a real M-by-N matrix A dgesc2 - solve a system of linear equations A * X = scale* RHS with a general N-by-N matrix A using the LU factorization with complete pivoting computed by DGETC2 dgesdd - compute the singular value decomposition (SVD) of a real M-by-N matrix A, optionally computing the left and right singular vectors dgesv - compute the solution to a real system of linear equations A * X = B, dgesvd - compute the singular value decomposition (SVD) of a real M-by-N matrix A, optionally computing the left and/or right singular vectors dgesvx - use the LU factorization to compute the solution to a real system of linear equations A * X = B, dgetc2 - compute an LU factorization with complete pivoting of the n-by-n matrix A dgetf2 - compute an LU factorization of a general m-by-n matrix A using partial pivoting with row interchanges dgetrf - compute an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges dgetri - compute the inverse of a matrix using the LU factorization computed by DGETRF dgetrs - solve a system of linear equations A * X = B or A' * X = B with a general N-by-N matrix A using the LU factorization computed by DGETRF dgettext - dggbak - form the right or left eigenvectors of a real generalized eigenvalue problem A*x = lambda*B*x, by backward transformation on the computed eigenvectors of the balanced pair of matrices output by DGGBAL dggbal - balance a pair of general real matrices (A,B) dgges - compute for a pair of N-by-N real nonsymmetric matrices (A,B), dggesx - compute for a pair of N-by-N real nonsymmetric matrices (A,B), the generalized eigenvalues, the real Schur form (S,T), and, dggev - compute for a pair of N-by-N real nonsymmetric matrices (A,B) dggevx - compute for a pair of N-by-N real nonsymmetric matrices (A,B) dggglm - solve a general Gauss-Markov linear model (GLM) problem dgghrd - reduce a pair of real matrices (A,B) to generalized upper Hessenberg form using orthogonal transformations, where A is a general matrix and B is upper triangular dgglse - solve the linear equality-constrained least squares (LSE) problem dggqrf - compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B dggrqf - compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B dggsvd - compute the generalized singular value decomposition (GSVD) of an M-by-N real matrix A and P-by-N real matrix B dggsvp - compute orthogonal matrices U, V and Q such that N-K-L K L U'*A*Q = K ( 0 A12 A13 ) if M-K-L >= 0 dgtcon - estimate the reciprocal of the condition number of a real tridiagonal matrix A using the LU factorization as computed by DGTTRF dgtrfs - improve the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution dgtsv - solve the equation A*X = B, dgtsvx - use the LU factorization to compute the solution to a real system of linear equations A * X = B or A**T * X = B, dgttrf - compute an LU factorization of a real tridiagonal matrix A using elimination with partial pivoting and row interchanges dgttrs - solve one of the systems of equations A*X = B or A'*X = B, dgtts2 - solve one of the systems of equations A*X = B or A'*X = B, dh - Diffie-Hellman key agreement dhcpctl - DH_generate_key - perform Diffie-Hellman key exchange DH_generate_parameters - generate and check Diffie-Hellman parameters dhgeqz - implement a single-/double-w(i) B ) = 0 In addition, the pair A,B may be reduced to generalized Schur form DH_get_ex_new_index - add application specific data to DH structures DH_new - allocate and free DH objects dhsein - use inverse iteration to find specified right and/or left eigenvectors of a real upper Hessenberg matrix H dhseqr - compute the eigenvalues of a real upper Hessenberg matrix H and, optionally, the matrices T and Z from the Schur decomposition H = Z T Z**T, where T is an upper quasi-triangular matrix (the Schur form), and Z is the orthogonal matrix of Schur vectors DH_set_method - DH_set_default_method, DH_get_default_method, DH_size - get Diffie-Hellman prime size diagnostics - produce verbose warning diagnostics dialog - widgets and utilities for the dialog program dialog_message - dialog_message DIALOG_PLAYER - DIALOG_PLAYER dialscreenshots - QwtDial d_icon_proc - d_icon_proc dict - Key-Value Dictionary difftime - calculate time difference Digest - Modules that calculate message digests Digest::base - Digest base class Digest::CRC - Generic CRC functions DigestException - DigestException Exceptions involving digests. Digest::file - Calculate digests of files digest.h - Digest algorithms: checksum, CRC and MD5. Digest::HMAC - Keyed-Hashing for Message Authentication Digest::HMAC_MD5 - Keyed-Hashing for Message Authentication Digest::HMAC_SHA1 - Keyed-Hashing for Message Authentication Digest::MD2 - Perl interface to the MD2 Algorithm Digest::MD4 - Perl interface to the RSA Data Security Inc. MD4 Message-Digest Algorithm Digest::MD5 - Perl interface to the MD5 Algorithm Digest::Nilsimsa - Perl version of Nilsimsa code Digest::SHA1 - Perl interface to the SHA-1 algorithm digi_recorder - digi_recorder digraph - Directed Graphs digraph_utils - Algorithms for Directed Graphs Dir - A low level portable directory class. low level directory access class. dirfd - get directory stream file descriptor DirHandle - supply object methods for directory handles dirname - disk_log - A disk based term logging facility disksup - A Disk Supervisor Process. DisplayCells - DisplayHeight - DisplayHeightMM - DisplayOfCCC - Color Conversion Context macros DisplayOfScreen - DisplayPlanes - DisplayString - DisplayWidth - DisplayWidthMM - div - compute quotient and remainder of an integer division d_keyboard_proc - d_keyboard_proc dlabad - 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 dladdr - dladiv - 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 f(x) = rho + --------- + ---------- + --------- -x -x -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 - 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 - 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 - 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 dlahqr - i an auxiliary routine called by DHSEQR to update the eigenvalues and Schur decomposition already computed by DHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI dlahrd - reduce the first NB columns of a real general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero dlaic1 - applie one step of incremental condition estimation in its simplest version dlaln2 - w D) X = s B with possible scaling ("s") and perturbation of A dlals0 - applie back the multiplying factors of either the left or the right singular vector matrix of a diagonal matrix appended by a row to the right hand side matrix B in solving the least squares problem using the divide-and-conquer SVD approach dlalsa - i an itermediate step in solving the least squares problem by computing the SVD of the coefficient matrix in compact form (The singular vectors are computed as products of simple orthorgonal matrices.) dlalsd - use the singular value decomposition of A to solve the least squares problem of finding X to minimize the Euclidean norm of each column of A*X-B, where A is N-by-N upper bidiagonal, and X and B are N-by-NRHS dlamch - determine double precision machine parameters dlamrg - will create a permutation list which will merge the elements of A (which is composed of two independently sorted sets) into a single set which is sorted in ascending order dlamsh - send multiple shifts through a small (single node) matrix to see how consecutive small subdiagonal elements are modified by subsequent shifts in an effort to maximize the number of bulges that can be sent through dlangb - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n band matrix A, with kl sub-diagonals and ku super-diagonals dlange - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real matrix A dlangt - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real tridiagonal matrix A dlanhs - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a Hessenberg matrix A dlansb - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n symmetric band matrix A, with k super-diagonals dlansp - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric matrix A, supplied in packed form dlanst - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric tridiagonal matrix A dlansy - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric matrix A dlantb - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n triangular band matrix A, with ( k + 1 ) diagonals dlantp - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a triangular matrix A, supplied in packed form dlantr - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a trapezoidal or triangular matrix A dlanv2 - compute the Schur factorization of a real 2-by-2 nonsymmetric matrix in standard form dlapll - two column vectors X and Y, let A = ( X Y ) dlapmt - rearrange the columns of the M by N matrix X as specified by the permutation ,K(2),...,K(N) of the integers 1,...,N dlapy2 - return sqrt(x**2+y**2), taking care not to cause unnecessary overflow dlapy3 - return sqrt(x**2+y**2+z**2), taking care not to cause unnecessary overflow dlaqgb - equilibrate a general M by N band matrix A with KL subdiagonals and KU superdiagonals using the row and scaling factors in the vectors R and C dlaqge - equilibrate a general M by N matrix A using the row and scaling factors in the vectors R and C dlaqp2 - compute a QR factorization with column pivoting of the block A(OFFSET+1:M,1:N) dlaqps - compute a step of QR factorization with column pivoting of a real M-by-N matrix A by using Blas-3 dlaqsb - equilibrate a symmetric band matrix A using the scaling factors in the vector S dlaqsp - equilibrate a symmetric matrix A using the scaling factors in the vector S dlaqsy - equilibrate a symmetric matrix A using the scaling factors in the vector S dlaqtr - solve the real quasi-triangular system op(T)*p = scale*c, if LREAL = .TRUE dlar1v - compute the (scaled) r-sigma I dlar2v - applie a vector of real plane rotations from both sides to a sequence of 2-by-2 real symmetric matrices, defined by the elements of the vectors x, y and z dlaref - applie one or several Householder reflectors of size 3 to one or two matrices (if column is specified) on either their rows or columns dlarf - applie a real elementary reflector H to a real m by n matrix C, from either the left or the right dlarfb - applie a real block reflector H or its transpose H' to a real m by n matrix C, from either the left or the right dlarfg - generate a real elementary reflector H of order n, such that H * ( alpha ) = ( beta ), H' * H = I dlarft - form the triangular factor T of a real block reflector H of order n, which is defined as a product of k elementary reflectors dlarfx - applie a real elementary reflector H to a real m by n matrix C, from either the left or the right dlargv - generate a vector of real plane rotations, determined by elements of the real vectors x and y dlarnv - return a vector of n random real numbers from a uniform or normal distribution dlarrb - the relatively robust representation(RRR) L D L^T, DLARRB does ``limited'' bisection to locate the eigenvalues of L D L^T, dlarre - the tridiagonal matrix T, DLARRE sets "small" off-sigma_i I = L_i D_i L_i^T representations and (iii) eigenvalues of each L_i D_i L_i^T dlarrf - the initial representation L D L^T and its cluster of close eigenvalues (in a relative measure), W( IFIRST ), W( IFIRST+1 ), .. dlarrv - compute the eigenvectors of the tridiagonal matrix T = L D L^T given L, D and the eigenvalues of L D L^T dlartg - generate a plane rotation so that [ CS SN ] dlartv - applie a vector of real plane rotations to elements of the real vectors x and y 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 - dlerror - d_list_proc - d_list_proc dl_iterate_phdr - walk through list of shared objects dlog.h - Contains a robust API for logging messages. dlopen - programming interface to DlpAddSyncLogEntry - DlpCallApplication - DlpCleanUpDataBase - DlpDeleteRecord - DlpEndOfSync - DlpGetSysDateTime - DlpMoveCategory - DlpOpenConduit - DlpOpenDB - DlpReadAppBlock - DlpReadAppPreference - DlpReadDBList - DlpReadFeature - DlpReadNetSyncInfo - DlpReadOpenDBInfo - DlpReadRecordByID - DlpReadRecordIDList - DlpReadResourceByIndex - DlpReadStorageInfo - DlpReadSysInfo - DlpReadUserInfo - DlpResetRecordIndex - index DlpResetSyncFlags - DlpResetSystem - DlpRPC - DlpWriteRecord - DlpWriteResource - dlsym - dlvsym - dmapi - DMAPI library d_menu_proc - d_menu_proc DNAS_Finalize - Deinitialization for dmachinemon P2P interface. DNAS_freeinfo - Free the information obtained with Ref{dm_gatherinfo}. DNAS_gatherinfo - gather info DNAS_Init - Initialization for DNAS interface. DNAS_sendinfo - Function to send information to the immediate uplink, dn_comp - dnet_addr - DECnet nodename to address translation dnet_conn - Connect to remote DECnet object by name. dnet_daemon - DECnet daemon functions dnet_getnode - Get nodes from DECnet database dnet_htoa - DECnet address to host name translation dnet_ntoa - DECnet address to ascii translation dn_expand - dngettext - dnonblock.h - Contains a single function used to change a file descriptor to non-blocking mode using fcntl(). dns_domain - The dns_domain library interface dns_ip4 - Host name to IP addresses dns_ip4_packet - extract IPv4 address from DNS answer packet dns_ip4_qualify - Qualification dns_ip6 - look up IPv6 addresses dns_ip6_packet - extract IPv6 address from DNS answer packet dns_ip6_qualify - qualify name and look up IPv6 addresses dns_mx - MX records dns_mx_packet - extract MX records from DNS answer packet dns_name4 - IP address to host name dns_name4_domain - construct host name for reverse lookup dns_name6 - look up host name dns_name6_domain - construct host name for reverse lookup dns_name_packet - extract names from DNS answer packet dns_packet - The dns_packet library interface dns_random - The dns_random library interface dns_transmit - The dns_transmit library interface dns_txt - TXT records dns_txt_packet - extract TXT records from DNS answer packet DNS::ZoneParse - Parse and manipulate DNS Zone Files. do_arc - do_arc do_circle - do_circle do_dialog - do_dialog do_ellipse - do_ellipse DoesBackingStore - DoesSaveUnders - do_line - do_line dom - Create an in-memory DOM tree from XML domDoc - Manipulates an instance of a DOM document object do_menu - do_menu domNode - Manipulates an instance of a DOM node object Door - Doors join two rooms. dopgtr - generate a real orthogonal matrix Q which is defined as the product of n-1 elementary reflectors H(i) of order n, as returned by DSPTRD using packed storage dopmtr - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dorg2l - generate an m by n real matrix Q with orthonormal columns, dorg2r - generate an m by n real matrix Q with orthonormal columns, dorgbr - generate one of the real orthogonal matrices Q or P**T determined by DGEBRD when reducing a real matrix A to bidiagonal form dorghr - generate a real orthogonal matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by DGEHRD dorgl2 - generate an m by n real matrix Q with orthonormal rows, dorglq - generate an M-by-N real matrix Q with orthonormal rows, dorgql - generate an M-by-N real matrix Q with orthonormal columns, dorgqr - generate an M-by-N real matrix Q with orthonormal columns, dorgr2 - generate an m by n real matrix Q with orthonormal rows, dorgrq - generate an M-by-N real matrix Q with orthonormal rows, dorgtr - generate a real orthogonal matrix Q which is defined as the product of n-1 elementary reflectors of order N, as returned by DSYTRD dorm2l - overwrite the general real m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'T', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'T', dorm2r - overwrite the general real m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'T', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'T', dormbr - VECT = 'Q', DORMBR overwrites the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dormhr - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dorml2 - overwrite the general real m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'T', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'T', dormlq - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dormql - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dormqr - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dormr2 - overwrite the general real m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'T', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'T', dormr3 - overwrite the general real m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'T', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'T', dormrq - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dormrz - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dormtr - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dot_product - dot_product, dot_product_f dot_product_f - do_uconvert - do_uconvert dpbcon - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite band matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPBTRF dpbequ - compute row and column scalings intended to equilibrate a symmetric positive definite band matrix A and reduce its condition number (with respect to the two-norm) dpbrfs - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and banded, and provides error bounds and backward error estimates for the solution dpbstf - compute a split Cholesky factorization of a real symmetric positive definite band matrix A dpbsv - compute the solution to a real system of linear equations A * X = B, dpbsvx - use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations A * X = B, dpbtf2 - compute the Cholesky factorization of a real symmetric positive definite band matrix A dpbtrf - compute the Cholesky factorization of a real symmetric positive definite band matrix A dpbtrs - solve a system of linear equations A*X = B with a symmetric positive definite band matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPBTRF dpid.h - Contains an API for manipulating PID files. dpocon - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPOTRF dpoequ - compute row and column scalings intended to equilibrate a symmetric positive definite matrix A and reduce its condition number (with respect to the two-norm) dporfs - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite, dposv - compute the solution to a real system of linear equations A * X = B, dposvx - use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations A * X = B, dpotf2 - compute the Cholesky factorization of a real symmetric positive definite matrix A dpotrf - compute the Cholesky factorization of a real symmetric positive definite matrix A dpotri - compute the inverse of a real symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPOTRF dpotrs - solve a system of linear equations A*X = B with a symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPOTRF dppcon - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite packed matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPPTRF dppequ - compute row and column scalings intended to equilibrate a symmetric positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm) dpprfs - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and packed, and provides error bounds and backward error estimates for the solution dppsv - compute the solution to a real system of linear equations A * X = B, dppsvx - use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations A * X = B, dpptrf - compute the Cholesky factorization of a real symmetric positive definite matrix A stored in packed format dpptri - compute the inverse of a real symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPPTRF dpptrs - solve a system of linear equations A*X = B with a symmetric positive definite matrix A in packed storage using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPPTRF dprintf - print to a file descriptor dptcon - compute the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite tridiagonal matrix using the factorization A = L*D*L**T or A = U**T*D*U computed by DPTTRF dpteqr - compute all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using DPTTRF, and then calling DBDSQR to compute the singular values of the bidiagonal factor dptrfs - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution dptsv - compute the solution to a real system of linear equations A*X = B, where A is an N-by-N symmetric positive definite tridiagonal matrix, and X and B are N-by-NRHS matrices dptsvx - use the factorization A = L*D*L**T to compute the solution to a real system of linear equations A*X = B, where A is an N-by-N symmetric positive definite tridiagonal matrix and X and B are N-by-NRHS matrices dpttrf - compute the L*D*L' factorization of a real symmetric positive definite tridiagonal matrix A dpttrs - solve a tridiagonal system of the form A * X = B using the L*D*L' factorization of A computed by DPTTRF dpttrsv - solve one of the triangular systems L**T* X = B, or L * X = B, dptts2 - solve a tridiagonal system of the form A * X = B using the L*D*L' factorization of A computed by DPTTRF d_radio_proc - d_radio_proc dragdrop - facilities for handling drag&drop data transfers draggers - drand48 - drand48, erand48, lrand48, nrand48, mrand48, jrand48, srand48, seed48, drand48_r - drand48_r, erand48_r, lrand48_r, nrand48_r, mrand48_r, jrand48_r, draw_character_ex - draw_character_ex draw_compiled_sprite - draw_compiled_sprite draw_gouraud_sprite - draw_gouraud_sprite drawing_mode - drawing_mode draw_lit_rle_sprite - draw_lit_rle_sprite draw_lit_sprite - draw_lit_sprite draw_rle_sprite - draw_rle_sprite draw_sprite - draw_sprite draw_sprite_h_flip - draw_sprite_v_flip - draw_sprite_v_flip, draw_sprite_h_flip, draw_sprite_vh_flip draw_sprite_vh_flip - draw_trans_rle_sprite - draw_trans_rle_sprite draw_trans_sprite - draw_trans_sprite drem - dremf - dreml - driver - command-processing loop of the form system drscl - multiplie an n-element real vector x by the real scalar 1/a d_rtext_proc - dsa - Digital Signature Algorithm DSA_do_sign - raw DSA signature operations DSA_dup_DH - create a DH structure out of DSA structure DSA_generate_key - generate DSA key pair DSA_generate_parameters - generate DSA parameters DSA_get_ex_new_index - add application specific data to DSA structures DSA_new - allocate and free DSA objects DSA_set_method - DSA_set_default_method, DSA_get_default_method, DSA_sign - DSA signatures DSA_SIG_new - allocate and free DSA signature objects DSA_size - get DSA signature size dsbev - compute all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A dsbevd - compute all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A dsbevx - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A dsbgst - reduce a real symmetric-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y, dsbgv - compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite banded eigenproblem, of the form A*x=(lambda)*B*x dsbgvd - compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite banded eigenproblem, of the form A*x=(lambda)*B*x dsbgvx - compute selected eigenvalues, and optionally, eigenvectors of a real generalized symmetric-definite banded eigenproblem, of the form A*x=(lambda)*B*x dsbmv - perform the matrix-vector operation y := alpha*A*x + beta*y, dsbtrd - reduce a real symmetric band matrix A to symmetric tridiagonal form T by an orthogonal similarity transformation dsecnd - return the user time for a process in seconds d_shadow_box_proc - dsignal.h - Contains the API for serializing signals to a pipe for usage with select() or poll(). d_slider_proc - d_slider_proc DSO - The DSO dynamic loader class is used to load object files. Dynamic class file loader. dspcon - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric packed matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSPTRF dspev - compute all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage dspevd - compute all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage dspevx - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage dspgst - reduce a real symmetric-definite generalized eigenproblem to standard form, using packed storage dspgv - compute all the eigenvalues and, optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x dspgvd - compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x dspgvx - compute selected eigenvalues, and optionally, eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x dspmv - perform the matrix-vector operation y := alpha*A*x + beta*y, dspr - perform the symmetric rank 1 operation A := alpha*x*x' + A, dspr2 - perform the symmetric rank 2 operation A := alpha*x*y' + alpha*y*x' + A, dsprfs - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite and packed, and provides error bounds and backward error estimates for the solution dspsv - compute the solution to a real system of linear equations A * X = B, dspsvx - use the diagonal pivoting factorization A = U*D*U**T or A = L*D*L**T to compute the solution to a real system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices dsptrd - reduce a real symmetric matrix A stored in packed form to symmetric tridiagonal form T by an orthogonal similarity transformation dsptrf - compute the factorization of a real symmetric matrix A stored in packed format using the Bunch-Kaufman diagonal pivoting method dsptri - compute the inverse of a real symmetric indefinite matrix A in packed storage using the factorization A = U*D*U**T or A = L*D*L**T computed by DSPTRF dsptrs - solve 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 DSPTRF dstebz - compute the eigenvalues of a symmetric tridiagonal matrix T dstedc - compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method dstegr - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix T dstein - compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration dstein2 - compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration dsteqr - compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the implicit QL or QR method dsteqr2 - i a modified version of LAPACK routine DSTEQR dsterf - compute all eigenvalues of a symmetric tridiagonal matrix using the Pal-Walker-Kahan variant of the QL or QR algorithm dstev - compute all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix A dstevd - compute all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix dstevr - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix T dstevx - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix A dsycon - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSYTRF dsyev - compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A dsyevd - compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A dsyevr - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix T dsyevx - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A dsygs2 - reduce a real symmetric-definite generalized eigenproblem to standard form dsygst - reduce a real symmetric-definite generalized eigenproblem to standard form dsygv - compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x dsygvd - compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x dsygvx - compute selected eigenvalues, and optionally, eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x dsymm - perform one of the matrix-matrix operations C := alpha*A*B + beta*C, dsymv - perform the matrix-vector operation y := alpha*A*x + beta*y, dsyr - perform the symmetric rank 1 operation A := alpha*x*x' + A, dsyr2 - perform the symmetric rank 2 operation A := alpha*x*y' + alpha*y*x' + A, dsyr2k - perform one of the symmetric rank 2k operations C := alpha*A*B' + alpha*B*A' + beta*C, dsyrfs - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution dsyrk - perform one of the symmetric rank k operations C := alpha*A*A' + beta*C, dsysv - compute the solution to a real system of linear equations A * X = B, dsysvx - use the diagonal pivoting factorization to compute the solution to a real system of linear equations A * X = B, dsytd2 - reduce a real symmetric matrix A to symmetric tridiagonal form T by an orthogonal similarity transformation dsytf2 - compute the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method dsytrd - reduce a real symmetric matrix A to real symmetric tridiagonal form T by an orthogonal similarity transformation dsytrf - compute the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method dsytri - compute the inverse of a real symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSYTRF dsytrs - solve a system of linear equations A*X = B with a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSYTRF dtbcon - estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm dtbmv - perform one of the matrix-vector operations x := A*x, or x := A'*x, dtbrfs - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular band coefficient matrix dtbsv - solve one of the systems of equations A*x = b, or A'*x = b, dtbtrs - solve a triangular system of the form A * X = B or A**T * X = B, d_textbox_proc - d_textbox_proc d_text_list_proc - d_text_list_proc d_text_proc - d_text_proc, d_ctext_proc, d_rtext_proc dtgevc - compute some or all of the right and/or left generalized eigenvectors of a pair of real upper triangular matrices (A,B) dtgex2 - swap adjacent diagonal blocks (A11, B11) and (A22, B22) of size 1-by-1 or 2-by-2 in an upper (quasi) triangular matrix pair (A, B) by an orthogonal equivalence transformation dtgexc - reorder the generalized real Schur decomposition of a real matrix pair (A,B) using an orthogonal equivalence transformation (A, B) = Q * (A, B) * Z', dtgsen - reorder the generalized real Schur decomposition of a real matrix pair (A, B) (in terms of an orthonormal equivalence trans- formation Q' * (A, B) * Z), so that a selected cluster of eigenvalues appears in the leading diagonal blocks of the upper quasi-triangular matrix A and the upper triangular B dtgsja - compute the generalized singular value decomposition (GSVD) of two real upper triangular (or trapezoidal) matrices A and B dtgsna - estimate reciprocal condition numbers for specified eigenvalues and/or eigenvectors of a matrix pair (A, B) in generalized real Schur canonical form (or of any matrix pair (Q*A*Z', Q*B*Z') with orthogonal matrices Q and Z, where Z' denotes the transpose of Z dtgsy2 - solve the generalized Sylvester equation dtgsyl - solve the generalized Sylvester equation DTMFDetect - DTMFDetect is used for detecting DTMF tones in a stream of audio. dtpcon - estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm dtpmv - perform one of the matrix-vector operations x := A*x, or x := A'*x, dtprfs - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix dtpsv - solve one of the systems of equations A*x = b, or A'*x = b, dtptri - compute the inverse of a real upper or lower triangular matrix A stored in packed format dtptrs - solve a triangular system of the form A * X = B or A**T * X = B, dtrcon - estimate the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm dtrevc - compute some or all of the right and/or left eigenvectors of a real upper quasi-triangular matrix T dtrexc - reorder the real Schur factorization of a real matrix A = Q*T*Q**T, so that the diagonal block of T with row index IFST is moved to row ILST dtrmm - perform one of the matrix-matrix operations B := alpha*op( A )*B, or B := alpha*B*op( A ), dtrmv - perform one of the matrix-vector operations x := A*x, or x := A'*x, dtrrfs - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix dtrsen - reorder the real Schur factorization of a real matrix A = Q*T*Q**T, so that a selected cluster of eigenvalues appears in the leading diagonal blocks of the upper quasi-triangular matrix T, dtrsm - solve one of the matrix equations op( A )*X = alpha*B, or X*op( A ) = alpha*B, dtrsna - estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a real upper quasi-triangular matrix T (or of any matrix Q*T*Q**T with Q orthogonal) dtrsv - solve one of the systems of equations A*x = b, or A'*x = b, dtrsyl - solve the real Sylvester matrix equation dtrti2 - compute the inverse of a real upper or lower triangular matrix dtrtri - compute the inverse of a real upper or lower triangular matrix A dtrtrs - solve a triangular system of the form A * X = B or A**T * X = B, dtzrqf - routine is deprecated and has been replaced by routine DTZRZF dtzrzf - reduce the M-by-N ( M<=N ) real upper trapezoidal matrix A to upper triangular form by means of orthogonal transformations DualUDPIPv4Socket - A socket class based on two UDP/IPv4 sockets. dumbnet - Dumpvalue - provides screen dump of Perl data. d_yield_proc - d_yield_proc DynaLoader - Dynamically load C libraries into Perl code DynamicPayloadFormat - Dynamic payload format objects. dynload_overview - Dynamic Loading of Extension Nodes dysize - get number of days for a given year dzsum1 - take the sum of the absolute values of a complex vector and returns a double precision result |
|||||||