Section 3

• pcgels · solve overdetermined or underdetermined complex linear systems involving an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1),
• pcgeql2 · compute a QL factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * L
• pcgeqlf · compute a QL factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * L
• pcgeqpf · compute a QR factorization with column pivoting of a M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
• pcgeqr2 · compute a QR factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R
• pcgeqrf · compute a QR factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R
• pcgerfs · improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
• pcgerq2 · compute a RQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R * Q
• pcgerqf · compute a RQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R * Q
• pcgesv · compute the solution to a complex system of linear equations sub( A ) * X = sub( B ),
• pcgesvx · use the LU factorization to compute the solution to a complex system of linear equations A(IA:IA+N-1,JA:JA+N-1) * X = B(IB:IB+N-1,JB:JB+NRHS-1),
• pcgetf2 · 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
• pcgetrf · 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
• pcgetri · compute the inverse of a distributed matrix using the LU factorization computed by PCGETRF
• pcgetrs · 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 PCGETRF
• pcggqrf · 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)
• pcggrqf · compute a generalized RQ factorization of an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
• pcheevx · compute selected eigenvalues and, optionally, eigenvectors of a complex hermitian matrix A by calling the recommended sequence of ScaLAPACK routines
• pchegs2 · reduce a complex Hermitian-definite generalized eigenproblem to standard form
• pchegst · reduce a complex Hermitian-definite generalized eigenproblem to standard form
• pchegvx · compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem
• pchetd2 · reduce a complex Hermitian matrix sub( A ) to Hermitian tridiagonal form T by an unitary similarity transformation
• pchetrd · reduce a complex Hermitian matrix sub( A ) to Hermitian tridiagonal form T by an unitary similarity transformation
• pcl · C coroutine management
• pclabrd · reduce the first NB rows and columns of a complex 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 unitary transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transfor- mation to the unreduced part of sub( A )
• pclacgv · conjugate a complex vector of length N, sub( X ), where sub( X ) denotes X(IX,JX:JX+N-1) if INCX = DESCX( M_ ) and X(IX:IX+N-1,JX) if INCX = 1, and Notes ===== Each global data object is described by an associated description vector
• pclacon · estimate the 1-norm of a square, complex distributed matrix A
• pclacp2 · copie all or part of a distributed matrix A to another distributed matrix B
• pclacpy · copie all or part of a distributed matrix A to another distributed matrix B
• pclaevswp · 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
• pclahrd · reduce the first NB columns of a complex 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
• pclange · return the value of the one norm, or the Frobenius norm,
• pclanhe · return the value of the one norm, or the Frobenius norm,
• pclanhs · return the value of the one norm, or the Frobenius norm,
• pclansy · return the value of the one norm, or the Frobenius norm,
• pclantr · return the value of the one norm, or the Frobenius norm,
• pclapiv · 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
• pclapv2 · 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
• pclaqge · 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
• pclaqsy · 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
• pclarf · applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
• pclarfb · applie a complex block reflector Q or its conjugate transpose Q**H to a complex M-by-N distributed matrix sub( C ) denoting C(IC:IC+M-1,JC:JC+N-1), from the left or the right
• pclarfc · applie a complex elementary reflector Q**H to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1),
• pclarfg · generate a complex elementary reflector H of order n, such that H * sub( X ) = H * ( x(iax,jax) ) = ( alpha ), H' * H = I
• pclarft · form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors
• pclarz · applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
• pclarzb · applie a complex block reflector Q or its conjugate transpose Q**H to a complex M-by-N distributed matrix sub( C ) denoting C(IC:IC+M-1,JC:JC+N-1), from the left or the right
• pclarzc · applie a complex elementary reflector Q**H to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1),
• pclarzt · form the triangular factor T of a complex block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PCTZRZF
• pclascl · multiplie the M-by-N complex distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) by the real scalar CTO/CFROM
• pclase2 · initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the diagonal and ALPHA on the offdiagonals
• pclaset · initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the diagonal and ALPHA on the offdiagonals
• pclassq · return the values scl and smsq such that ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
• pclaswp · perform a series of row or column interchanges on the distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
• pclatra · compute the trace of an N-by-N distributed matrix sub( A ) denoting A( IA:IA+N-1, JA:JA+N-1 )
• pclatrd · reduce NB rows and columns of a complex Hermitian distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) to complex tridiagonal form by an unitary similarity transformation Q' * sub( A ) * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of sub( A )
• pclatrs · solve a triangular system
• pclatrz · reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix sub( A ) = [A(IA:IA+M-1,JA:JA+M-1) A(IA:IA+M-1,JA+N-L:JA+N-1)]
• pclauu2 · 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 matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
• pclauum · 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 distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
• pclose · pipe stream to or from a process
• pclose_execs · pipe stream to or from a process without using a shell
• pclose_execsp · pipe stream to or from a process without using a shell
• pclose_nosh · pipe stream to or from a process without using a shell
• pcmax1 · compute the global index of the maximum element in absolute value of a distributed vector sub( X )
• pcomm · The Primitive Communications Object.
• pconf_autodetect_pport · Autodetect printer on a parallel port using IEEE1284 protocol.
• pconf_detect_printer · Return array of strings containing printer specific information.
• pconf_get_detection_methods · List autodetection methods.
• PConn_bind · bind an address to a PConnection
• PConnClose · shut down a connection to a PalmOS device
• pcp · PCP is the Main API for documentation of the class.
• pcpbsv · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pcpbtrf · compute a Cholesky factorization of an N-by-N complex banded symmetric positive definite distributed matrix with bandwidth BW
• pcpbtrs · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pcpbtrsv · solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• PCPIntro · introduction to the Performance Co-Pilot (PCP) libraries
• pcpintro · introduction to the Performance Co-Pilot (PCP) libraries
• pcpocon · estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite distributed matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by PCPOTRF
• pcpoequ · compute row and column scalings intended to equilibrate a distributed Hermitian positive definite matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) and reduce its condition number (with respect to the two-norm)
• pcporfs · improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and provides error bounds and backward error estimates for the solutions
• pcposv · compute the solution to a complex system of linear equations sub( A ) * X = sub( B ),
• pcposvx · use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A(IA:IA+N-1,JA:JA+N-1) * X = B(IB:IB+N-1,JB:JB+NRHS-1),
• pcpotf2 · compute the Cholesky factorization of a complex hermitian positive definite distributed matrix sub( A )=A(IA:IA+N-1,JA:JA+N-1)
• pcpotrf · compute the Cholesky factorization of an N-by-N complex hermitian positive definite distributed matrix sub( A ) denoting A(IA:IA+N-1, JA:JA+N-1)
• pcpotri · compute the inverse of a complex Hermitian positive definite distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the Cholesky factorization sub( A ) = U**H*U or L*L**H computed by PCPOTRF
• pcpotrs · solve a system of linear equations sub( A ) * X = sub( B ) A(IA:IA+N-1,JA:JA+N-1)*X = B(IB:IB+N-1,JB:JB+NRHS-1)
• pcptsv · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pcpttrf · compute a Cholesky factorization of an N-by-N complex tridiagonal symmetric positive definite distributed matrix A(1:N, JA:JA+N-1)
• pcpttrs · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pcpttrsv · solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pcrdef
• Pcre
• pcre · Perl-compatible regular expressions (original API)
• pcre16 · Perl-compatible regular expressions #include <pcre.h>
• pcre16_assign_jit_stack · Perl-compatible regular expressions
• pcre16_compile · Perl-compatible regular expressions
• pcre16_compile2 · Perl-compatible regular expressions
• pcre16_config · Perl-compatible regular expressions
• pcre16_copy_named_substring · Perl-compatible regular expressions
• pcre16_copy_substring · Perl-compatible regular expressions
• pcre16_dfa_exec · Perl-compatible regular expressions
• pcre16_exec · Perl-compatible regular expressions
• pcre16_free_study · Perl-compatible regular expressions
• pcre16_free_substring · Perl-compatible regular expressions
• pcre16_free_substring_list · Perl-compatible regular expressions
• pcre16_fullinfo · Perl-compatible regular expressions
• pcre16_get_named_substring · Perl-compatible regular expressions
• pcre16_get_stringnumber · Perl-compatible regular expressions
• pcre16_get_stringtable_entries · Perl-compatible regular expressions
• pcre16_get_substring · Perl-compatible regular expressions
• pcre16_get_substring_list · Perl-compatible regular expressions
• pcre16_jit_exec · Perl-compatible regular expressions
• pcre16_jit_stack_alloc · Perl-compatible regular expressions
• pcre16_jit_stack_free · Perl-compatible regular expressions
• pcre16_maketables · Perl-compatible regular expressions
• pcre16_pattern_to_host_byte_order · Perl-compatible regular expressions
• pcre16_refcount · Perl-compatible regular expressions
• pcre16_study · Perl-compatible regular expressions
• pcre16_utf16_to_host_byte_order · Perl-compatible regular expressions
• pcre16_version · Perl-compatible regular expressions
• pcre2 · Perl-compatible regular expressions (revised API)
• pcre2_callout_enumerate · Perl-compatible regular expressions (revised API)
• pcre2_code_copy · Perl-compatible regular expressions (revised API)
• pcre2_code_copy_with_tables · Perl-compatible regular expressions (revised API)
• pcre2_code_free · Perl-compatible regular expressions (revised API)
• pcre2_compile · Perl-compatible regular expressions (revised API)
• pcre2_compile_context_copy · Perl-compatible regular expressions (revised API)
• pcre2_compile_context_create · Perl-compatible regular expressions (revised API)
• pcre2_compile_context_free · Perl-compatible regular expressions (revised API)
• pcre2_config · Perl-compatible regular expressions (revised API)
• pcre2_convert_context_copy · Perl-compatible regular expressions (revised API)
• pcre2_convert_context_create · Perl-compatible regular expressions (revised API)
• pcre2_convert_context_free · Perl-compatible regular expressions (revised API)
• pcre2_converted_pattern_free · Perl-compatible regular expressions (revised API)
• pcre2_dfa_match · Perl-compatible regular expressions (revised API)
• pcre2_general_context_copy · Perl-compatible regular expressions (revised API)
• pcre2_general_context_create · Perl-compatible regular expressions (revised API)
• pcre2_general_context_free · Perl-compatible regular expressions (revised API)
• pcre2_get_error_message · Perl-compatible regular expressions (revised API)
• pcre2_get_mark · Perl-compatible regular expressions (revised API)
• pcre2_get_match_data_heapframes_size · Perl-compatible regular expressions (revised API)
• pcre2_get_match_data_size · Perl-compatible regular expressions (revised API)
• pcre2_get_ovector_count · Perl-compatible regular expressions (revised API)
• pcre2_get_ovector_pointer · Perl-compatible regular expressions (revised API)
• pcre2_get_startchar · Perl-compatible regular expressions (revised API)
• pcre2_jit_compile · Perl-compatible regular expressions (revised API)
• pcre2_jit_free_unused_memory · Perl-compatible regular expressions (revised API)
• pcre2_jit_match · Perl-compatible regular expressions (revised API)
• pcre2_jit_stack_assign · Perl-compatible regular expressions (revised API)
• pcre2_jit_stack_create · Perl-compatible regular expressions (revised API)
• pcre2_jit_stack_free · Perl-compatible regular expressions (revised API)
• pcre2_maketables · Perl-compatible regular expressions (revised API)
• pcre2_maketables_free · Perl-compatible regular expressions (revised API)
• pcre2_match · Perl-compatible regular expressions (revised API)
• pcre2_match_context_copy · Perl-compatible regular expressions (revised API)
• pcre2_match_context_create · Perl-compatible regular expressions (revised API)
• pcre2_match_context_free · Perl-compatible regular expressions (revised API)
• pcre2_match_data_create · Perl-compatible regular expressions (revised API)
• pcre2_match_data_create_from_pattern · Perl-compatible regular expressions (revised API)
• pcre2_match_data_free · Perl-compatible regular expressions (revised API)
• pcre2_next_match · Perl-compatible regular expressions (revised API)
• pcre2_pattern_convert · Perl-compatible regular expressions (revised API)
• pcre2_pattern_info · Perl-compatible regular expressions (revised API)
• pcre2_serialize_decode · Perl-compatible regular expressions (revised API)
• pcre2_serialize_encode · Perl-compatible regular expressions (revised API)
• pcre2_serialize_free · Perl-compatible regular expressions (revised API)
• pcre2_serialize_get_number_of_codes · Perl-compatible regular expressions (revised API)
• pcre2_set_bsr · Perl-compatible regular expressions (revised API)
• pcre2_set_callout · Perl-compatible regular expressions (revised API)
• pcre2_set_character_tables · Perl-compatible regular expressions (revised API)
• pcre2_set_compile_extra_options · Perl-compatible regular expressions (revised API)
• pcre2_set_compile_recursion_guard · Perl-compatible regular expressions (revised API)
• pcre2_set_depth_limit · Perl-compatible regular expressions (revised API)
• pcre2_set_glob_escape · Perl-compatible regular expressions (revised API)
• pcre2_set_glob_separator · Perl-compatible regular expressions (revised API)
• pcre2_set_heap_limit · Perl-compatible regular expressions (revised API)
• pcre2_set_match_limit · Perl-compatible regular expressions (revised API)
• pcre2_set_max_pattern_compiled_length · Perl-compatible regular expressions (revised API)
• pcre2_set_max_pattern_length · Perl-compatible regular expressions (revised API)
• pcre2_set_max_varlookbehind · Perl-compatible regular expressions (revised API)
• pcre2_set_newline · Perl-compatible regular expressions (revised API)
• pcre2_set_offset_limit · Perl-compatible regular expressions (revised API)
• pcre2_set_optimize · Perl-compatible regular expressions (revised API)
• pcre2_set_parens_nest_limit · Perl-compatible regular expressions (revised API)
• pcre2_set_recursion_limit · Perl-compatible regular expressions (revised API)
• pcre2_set_recursion_memory_management · Perl-compatible regular expressions (revised API)
• pcre2_set_substitute_callout · Perl-compatible regular expressions (revised API)
• pcre2_set_substitute_case_callout · Perl-compatible regular expressions (revised API)
• pcre2_substitute · Perl-compatible regular expressions (revised API)
• pcre2_substring_copy_byname · Perl-compatible regular expressions (revised API)
• pcre2_substring_copy_bynumber · Perl-compatible regular expressions (revised API)
• pcre2_substring_free · Perl-compatible regular expressions (revised API)
• pcre2_substring_get_byname · Perl-compatible regular expressions (revised API)
• pcre2_substring_get_bynumber · Perl-compatible regular expressions (revised API)
• pcre2_substring_length_byname · Perl-compatible regular expressions (revised API)
• pcre2_substring_length_bynumber · Perl-compatible regular expressions (revised API)
• pcre2_substring_list_free · Perl-compatible regular expressions (revised API)
• pcre2_substring_list_get · Perl-compatible regular expressions (revised API)
• pcre2_substring_nametable_scan · Perl-compatible regular expressions (revised API)
• pcre2_substring_number_from_name · Perl-compatible regular expressions (revised API)
• pcre2api · Perl-compatible regular expressions (revised API) #include <pcre2.h> PCRE2 is a new API for PCRE, starting at release 10.0. This document contains a description of all its native functions. See the pcre2 document for an overview of all the PCRE2 documentation.
• pcre2build · Perl-compatible regular expressions (revised API)
• pcre2callout · Perl-compatible regular expressions (revised API)
• pcre2compat · Perl-compatible regular expressions (revised API)
• pcre2convert · Perl-compatible regular expressions (revised API)
• pcre2demo · A demonstration C program for PCRE2
• pcre2jit · Perl-compatible regular expressions (revised API)
• pcre2limits · Perl-compatible regular expressions (revised API)
• pcre2matching · Perl-compatible regular expressions (revised API)
• pcre2partial · Perl-compatible regular expressions (revised API)
• pcre2pattern · Perl-compatible regular expressions (revised API)
• pcre2perform · Perl-compatible regular expressions (revised API)
• pcre2posix · Perl-compatible regular expressions (revised API)
• pcre2sample · Perl-compatible regular expressions (revised API)
• pcre2serialize · Perl-compatible regular expressions (revised API)
• pcre2stack · Perl-compatible regular expressions (revised API)
• pcre2syntax · Perl-compatible regular expressions (revised API)
• pcre2unicode · Perl-compatible regular expressions (revised API)
• pcre32 · Perl-compatible regular expressions #include <pcre.h>
• pcre32_assign_jit_stack · Perl-compatible regular expressions
• pcre32_compile · Perl-compatible regular expressions
• pcre32_compile2 · Perl-compatible regular expressions
• pcre32_config · Perl-compatible regular expressions
• pcre32_copy_named_substring · Perl-compatible regular expressions
• pcre32_copy_substring · Perl-compatible regular expressions
• pcre32_dfa_exec · Perl-compatible regular expressions
• pcre32_exec · Perl-compatible regular expressions
• pcre32_free_study · Perl-compatible regular expressions
• pcre32_free_substring · Perl-compatible regular expressions
• pcre32_free_substring_list · Perl-compatible regular expressions
• pcre32_fullinfo · Perl-compatible regular expressions
• pcre32_get_named_substring · Perl-compatible regular expressions
• pcre32_get_stringnumber · Perl-compatible regular expressions
• pcre32_get_stringtable_entries · Perl-compatible regular expressions
• pcre32_get_substring · Perl-compatible regular expressions
• pcre32_get_substring_list · Perl-compatible regular expressions
• pcre32_jit_exec · Perl-compatible regular expressions
• pcre32_jit_stack_alloc · Perl-compatible regular expressions
• pcre32_jit_stack_free · Perl-compatible regular expressions
• pcre32_maketables · Perl-compatible regular expressions
• pcre32_pattern_to_host_byte_order · Perl-compatible regular expressions
• pcre32_refcount · Perl-compatible regular expressions
• pcre32_study · Perl-compatible regular expressions
• pcre32_utf32_to_host_byte_order · Perl-compatible regular expressions
• pcre32_version · Perl-compatible regular expressions
• pcre_assign_jit_stack · Perl-compatible regular expressions
• pcre_compile · Perl-compatible regular expressions
• pcre_compile2 · Perl-compatible regular expressions
• pcre_config · Perl-compatible regular expressions
• pcre_copy_named_substring · Perl-compatible regular expressions
• pcre_copy_substring · Perl-compatible regular expressions
• pcre_dfa_exec · Perl-compatible regular expressions
• pcre_exec · Perl-compatible regular expressions
• pcre_free_study · Perl-compatible regular expressions
• pcre_free_substring · Perl-compatible regular expressions
• pcre_free_substring_list · Perl-compatible regular expressions
• pcre_fullinfo · Perl-compatible regular expressions
• pcre_get_named_substring · Perl-compatible regular expressions
• pcre_get_stringnumber · Perl-compatible regular expressions
• pcre_get_stringtable_entries · Perl-compatible regular expressions
• pcre_get_substring · Perl-compatible regular expressions
• pcre_get_substring_list · Perl-compatible regular expressions
• pcre_info · Perl-compatible regular expressions
• pcre_jit_exec · Perl-compatible regular expressions
• pcre_jit_stack_alloc · Perl-compatible regular expressions
• pcre_jit_stack_free · Perl-compatible regular expressions
• pcre_maketables · Perl-compatible regular expressions
• pcre_pattern_to_host_byte_order · Perl-compatible regular expressions
• pcre_refcount · Perl-compatible regular expressions
• pcre_study · Perl-compatible regular expressions
• pcre_subst · Perl-compatible regular expression subsitution.
• pcre_utf16_to_host_byte_order · Perl-compatible regular expressions
• pcre_utf32_to_host_byte_order · Perl-compatible regular expressions
• pcre_version · Perl-compatible regular expressions
• pcreapi · Perl-compatible regular expressions #include <pcre.h>
• pcrebuild · Perl-compatible regular expressions
• pcrecallout · Perl-compatible regular expressions
• pcrecompat · Perl-compatible regular expressions
• pcrecpp · Perl-compatible regular expressions.
• pcredemo
• pcrejit · Perl-compatible regular expressions
• pcrelimits · Perl-compatible regular expressions
• pcrematching · Perl-compatible regular expressions
• pcrepartial · Perl-compatible regular expressions
• pcrepattern · Perl-compatible regular expressions
• pcreperform · Perl-compatible regular expressions
• pcreposix · Perl-compatible regular expressions.
• pcreprecompile · Perl-compatible regular expressions
• pcresample · Perl-compatible regular expressions
• pcrestack · Perl-compatible regular expressions
• pcresyntax · Perl-compatible regular expressions
• pcreunicode · Perl-compatible regular expressions
• pcsrscl · multiplie an N-element complex distributed vector sub( X ) by the real scalar 1/a
• pcstein · compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
• pctrcon · estimate the reciprocal of the condition number of a triangular distributed matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm
• pctrrfs · provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
• pctrti2 · compute the inverse of a complex upper or lower triangular block matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
• pctrtri · compute the inverse of a upper or lower triangular distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
• pctrtrs · solve a triangular system of the form sub( A ) * X = sub( B ) or sub( A )**T * X = sub( B ) or sub( A )**H * X = sub( B ),
• pctzrzf · reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper triangular form by means of unitary transformations
• pcung2l · generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the last N columns of a product of K elementary reflectors of order M Q = H(k)
• pcung2r · generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the first N columns of a product of K elementary reflectors of order M Q = H(1) H(2)
• pcungl2 · generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the first M rows of a product of K elementary reflectors of order N Q = H(k)'
• pcunglq · generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the first M rows of a product of K elementary reflectors of order N Q = H(k)'
• pcungql · generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the last N columns of a product of K elementary reflectors of order M Q = H(k)
• pcungqr · generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the first N columns of a product of K elementary reflectors of order M Q = H(1) H(2)
• pcungr2 · generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the last M rows of a product of K elementary reflectors of order N Q = H(1)' H(2)'
• pcungrq · generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the last M rows of a product of K elementary reflectors of order N Q = H(1)' H(2)'
• pcunm2l · overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pcunm2r · overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pcunmbr · VECT = 'Q', PCUNMBR overwrites the general complex distributed M-by-N matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pcunmhr · overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pcunml2 · overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pcunmlq · overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pcunmql · overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pcunmqr · overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pcunmr2 · overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pcunmr3 · overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pcunmrq · overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pcunmrz · overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pcunmtr · overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdb_AppendRecord · add records to a Palm database
• pdb_AppendResource · add records to a Palm database
• pdb_CopyRecord · short description
• pdb_CopyResource · short description
• pdb_DeleteRecordByID · short description
• pdb_FindRecordByID · search for records in Palm databases
• pdb_FindRecordByIndex · search for records in Palm databases
• pdb_InsertRecord · add records to a Palm database
• pdb_InsertResource · add records to a Palm database
• pdb_LoadHeader · read the header of a Palm database file
• pdb_Read · read, write Palm database files
• pdb_Write · read, write Palm database files
• pddbsv · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pddbtrf · compute a LU factorization of an N-by-N real banded diagonally dominant-like distributed matrix with bandwidth BWL, BWU
• pddbtrs · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pddbtrsv · solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pddtsv · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pddttrf · compute a LU factorization of an N-by-N real tridiagonal diagonally dominant-like distributed matrix A(1:N, JA:JA+N-1)
• pddttrs · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pddttrsv · solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pdfio · pdf read/write library
• pdgbsv · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pdgbtrf · compute a LU factorization of an N-by-N real banded distributed matrix with bandwidth BWL, BWU
• pdgbtrs · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pdgebd2 · reduce 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 B by an orthogonal transformation
• pdgebrd · reduce 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 B by an orthogonal transformation
• pdgecon · estimate the reciprocal of the condition number of a general distributed real matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm, using the LU factorization computed by PDGETRF
• pdgeequ · compute row and column scalings intended to equilibrate an M-by-N distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA:JA+N-1) and reduce its condition number
• pdgehd2 · reduce a real general distributed matrix sub( A ) to upper Hessenberg form H by an orthogonal similarity transforma- tion
• pdgehrd · reduce a real general distributed matrix sub( A ) to upper Hessenberg form H by an orthogonal similarity transforma- tion
• pdgelq2 · compute a LQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L * Q
• pdgelqf · compute a LQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L * Q
• pdgels · solve overdetermined or underdetermined real linear systems involving an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1),
• pdgeql2 · compute a QL factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * L
• pdgeqlf · compute a QL factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * L
• pdgeqpf · compute a QR factorization with column pivoting of a M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
• pdgeqr2 · 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
• pdgeqrf · 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
• pdgerfs · improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
• pdgerq2 · 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
• pdgerqf · 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
• pdgesv · compute the solution to a real system of linear equations sub( A ) * X = sub( B ),
• pdgesvd · compute the singular value decomposition (SVD) of an M-by-N matrix A, optionally computing the left and/or right singular vectors
• pdgesvx · 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),
• pdgetf2 · 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
• pdgetrf · 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
• pdgetri · compute the inverse of a distributed matrix using the LU factorization computed by PDGETRF
• pdgetrs · 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 PDGETRF
• pdggqrf · 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)
• pdggrqf · compute a generalized RQ factorization of an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
• pdlabad · take as input the values computed by PDLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large
• pdlabrd · 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,
• pdlacon · estimate the 1-norm of a square, real distributed matrix A
• pdlaconsb · 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
• pdlacp2 · copie all or part of a distributed matrix A to another distributed matrix B
• pdlacp3 · i an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa
• pdlacpy · copie all or part of a distributed matrix A to another distributed matrix B
• pdlaevswp · 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
• pdlahqr · 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
• pdlahrd · 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
• pdlamch · determine double precision machine parameters
• pdlange · return the value of the one norm, or the Frobenius norm,
• pdlanhs · return the value of the one norm, or the Frobenius norm,
• pdlansy · return the value of the one norm, or the Frobenius norm,
• pdlantr · return the value of the one norm, or the Frobenius norm,
• pdlapiv · 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
• pdlapv2 · 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
• pdlaqge · 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
• pdlaqsy · 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
• pdlared1d · 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
• pdlared2d · 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
• pdlarf · 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
• pdlarfb · 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)
• pdlarfg · generate a real elementary reflector H of order n, such that H * sub( X ) = H * ( x(iax,jax) ) = ( alpha ), H' * H = I
• pdlarft · form the triangular factor T of a real block reflector H of order n, which is defined as a product of k elementary reflectors
• pdlarz · 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
• pdlarzb · 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)
• pdlarzt · form the triangular factor T of a real block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PDTZRZF
• pdlascl · multiplie the M-by-N real distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) by the real scalar CTO/CFROM
• pdlase2 · initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the diagonal and ALPHA on the offdiagonals
• pdlaset · initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the diagonal and ALPHA on the offdiagonals
• pdlasmsub · look for a small subdiagonal element from the bottom of the matrix that it can safely set to zero
• pdlassq · return the values scl and smsq such that ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
• pdlaswp · perform a series of row or column interchanges on the distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
• pdlatra · compute the trace of an N-by-N distributed matrix sub( A ) denoting A( IA:IA+N-1, JA:JA+N-1 )
• pdlatrd · reduce NB rows and columns of a real symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) to symmetric tridiagonal form by an orthogonal similarity transformation Q' * sub( A ) * Q,
• pdlatrs · solve a triangular system
• pdlatrz · reduce the M-by-N ( M<=N ) real upper trapezoidal matrix sub( A ) = [ A(IA:IA+M-1,JA:JA+M-1) A(IA:IA+M-1,JA+N-L:JA+N-1) ] to upper triangular form by means of orthogonal transformations
• pdlauu2 · 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 matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
• pdlauum · 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 distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
• pdlawil · get the transform given by H44,H33, & H43H34 into V starting at row M
• pdorg2l · generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the last N columns of a product of K elementary reflectors of order M Q = H(k)
• pdorg2r · generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the first N columns of a product of K elementary reflectors of order M Q = H(1) H(2)
• pdorgl2 · generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the first M rows of a product of K elementary reflectors of order N Q = H(k)
• pdorglq · generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the first M rows of a product of K elementary reflectors of order N Q = H(k)
• pdorgql · generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the last N columns of a product of K elementary reflectors of order M Q = H(k)
• pdorgqr · generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the first N columns of a product of K elementary reflectors of order M Q = H(1) H(2)
• pdorgr2 · generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the last M rows of a product of K elementary reflectors of order N Q = H(1) H(2)
• pdorgrq · generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the last M rows of a product of K elementary reflectors of order N Q = H(1) H(2)
• pdorm2l · overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdorm2r · overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdormbr · VECT = 'Q', PDORMBR overwrites the general real distributed M-by-N matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdormhr · overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdorml2 · overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdormlq · overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdormql · overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdormqr · overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdormr2 · overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdormr3 · overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdormrq · overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdormrz · overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdormtr · overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
• pdpbsv · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pdpbtrf · compute a Cholesky factorization of an N-by-N real banded symmetric positive definite distributed matrix with bandwidth BW
• pdpbtrs · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pdpbtrsv · solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pdpocon · estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite distributed matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by PDPOTRF
• pdpoequ · compute row and column scalings intended to equilibrate a distributed symmetric positive definite matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) and reduce its condition number (with respect to the two-norm)
• pdporfs · improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and provides error bounds and backward error estimates for the solutions
• pdposv · compute the solution to a real system of linear equations sub( A ) * X = sub( B ),
• pdposvx · 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(IA:IA+N-1,JA:JA+N-1) * X = B(IB:IB+N-1,JB:JB+NRHS-1),
• pdpotf2 · compute the Cholesky factorization of a real symmetric positive definite distributed matrix sub( A )=A(IA:IA+N-1,JA:JA+N-1)
• pdpotrf · compute the Cholesky factorization of an N-by-N real symmetric positive definite distributed matrix sub( A ) denoting A(IA:IA+N-1, JA:JA+N-1)
• pdpotri · compute the inverse of a real symmetric positive definite distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the Cholesky factorization sub( A ) = U**T*U or L*L**T computed by PDPOTRF
• pdpotrs · solve a system of linear equations sub( A ) * X = sub( B ) A(IA:IA+N-1,JA:JA+N-1)*X = B(IB:IB+N-1,JB:JB+NRHS-1)
• pdptsv · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pdpttrf · compute a Cholesky factorization of an N-by-N real tridiagonal symmetric positive definite distributed matrix A(1:N, JA:JA+N-1)
• pdpttrs · solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pdpttrsv · solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pdrscl · multiplie an N-element real distributed vector sub( X ) by the real scalar 1/a
• pdstebz · compute the eigenvalues of a symmetric tridiagonal matrix in parallel
• pdstein · compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
• pdstemplates.c · Functions for GRIB2 Product Definition Templates used in Section 4 - the Product Definition Section (PDS).
• pdsyev · compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines.
• pdsyevx · compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
• pdsygs2 · reduce a real symmetric-definite generalized eigenproblem to standard form
• pdsygst · reduce a real symmetric-definite generalized eigenproblem to standard form
• pdsygvx · compute all the eigenvalues, and optionally, the eigenvectors of a real generalized SY-definite eigenproblem
• pdsytd2 · reduce a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity transformation
• pdsytrd · reduce a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity transformation
• pdtrcon · estimate the reciprocal of the condition number of a triangular distributed matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm
• pdtrrfs · provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
• pdtrti2 · compute the inverse of a real upper or lower triangular block matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
• pdtrtri · compute the inverse of a upper or lower triangular distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
• pdtrtrs · solve a triangular system of the form sub( A ) * X = sub( B ) or sub( A )**T * X = sub( B ),
• pdtzrzf · reduce the M-by-N ( M<=N ) real upper trapezoidal matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper triangular form by means of orthogonal transformations
• pdzsum1 · return the sum of absolute values of a complex distributed vector sub( X ) in ASUM,
• pecho_wchar · create and display curses pads
• pechochar · create and display curses pads
• peks-auth · public key authentication
• peks-errnum · peks error message handler
• peks-keys · key and file manipulation functions
• peks-misc · query user characteristics
• peks-passwd · handling user passwords
• peks-pthreads · Posix threads support for peks
• peks-session · public key encryption tunnel negotiation
• peks_admin_equiv · key and file manipulation functions
• peks_client_authenticate · public key authentication
• peks_delete_userkey · key and file manipulation functions
• peks_edit_passwd_file · handling user passwords
• peks_get_homedir · query user characteristics
• peks_get_username · query user characteristics
• peks_keylen · key and file manipulation functions
• peks_list_keyfile · key and file manipulation functions
• peks_private_access · key and file manipulation functions
• peks_private_key · key and file manipulation functions
• peks_save_private_key · key and file manipulation functions
• peks_server_auth_accept · public key authentication
• peks_server_auth_pubkey · public key authentication
• peks_server_auth_reject · public key authentication
• peks_strerr · peks error message handler
• peks_version · returns the current peks version
• perceptron.hpp
• PerlPanel::DesktopEntry · an interface to .desktop files for the PerlPanel.
• PerlPanel::MenuBase · a base class for PerlPanel menu applets.
• PermanentEntryID · PermanentEntryID structure.
• perror · print a system error message
• persist.h · Persistence library classes.