3 Library functions

ps

• PS_add_bookmark Add bookmark to current page
• PS_add_kerning Add new kerning to font
• PS_add_launchlink Adds link which launches file
• PS_add_ligature Add new ligature to font
• PS_add_locallink Adds link to a page in the same document
• PS_add_note Adds note to current page
• PS_add_pdflink Adds link to a page in a second pdf document
• PS_add_weblink Adds link to a web location
• PS_arc Draws an arc counterclockwise
• PS_arcn Draws an arc clockwise
• PS_begin_font Starts a new Type3 font
• PS_begin_glyph Starts a new glyph in a Type3 font
• PS_begin_page Start a new page
• PS_begin_pattern Starts a new pattern
• PS_begin_template Starts a new template
• PS_boot Initialize library
• PS_circle Draws a circle
• PS_clip Clips drawing to current path
• PS_close Closes a PostScript document
• PS_close_image Closes image and frees memory
• PS_closepath Closes path
• PS_closepath_stroke Closes and strokes path
• PS_continue_text Continue text in next line
• PS_continue_text2 Continue text in next line
• PS_create_gstate Creates a new graphic state
• PS_curveto Draws a curve
• PS_delete Deletes all resources of a PostScript document
• PS_end_font Ends a Type3 font
• PS_end_glyph Ends a Type3 font
• PS_end_page End a page
• PS_end_pattern Ends a pattern
• PS_end_template Ends a template
• PS_fill Fills the current path
• PS_fill_stroke Fills and strokes the current path
• PS_findfont Loads a font
• PS_free_glyph_list Frees memory allocated for glyph list
• PS_get_buffer Returns internal memory buffer
• PS_get_majorversion returns the major version number of the PostScript library
• PS_get_minorversion returns the minor version number of the PostScript library
• PS_get_opaque Returns pointer which has been passed to PS_new2()
• PS_get_parameter Gets certain parameters
• PS_get_subminorversion returns the subminor version number of the PostScript library
• PS_get_value Gets certain values
• PS_glyph_list Returns list of glyph names in font
• PS_glyph_show Output glyph by name
• PS_hyphenate Hyphenates a word
• PS_include_file Include external PostScript file
• PS_lineto Draws a line
• PS_list_parameters List all set parameters
• PS_list_resources List all resources
• PS_list_values List all set values
• PS_makespotcolor Create a spotcolor
• PS_moveto Sets current point
• PS_new Creating a new PostScript document object
• PS_new2 Creates a new PostScript document object
• PS_open_file Opens a file for output
• PS_open_fp Uses an already open file pointer as the output file
• PS_open_image Reads an image for later placement
• PS_open_image_file Opens an image from file
• PS_open_mem Creates a PostScript document in memory
• PS_place_image Places image on the page
• PS_rect Draws a rectangle
• PS_restore Restore previously save context
• PS_rotate Sets rotation factor
• PS_save Save current context
• PS_scale Sets scaling factor
• PS_set_border_color Sets color of border for annotations
• PS_set_border_dash Sets length of dashes for border of annotations
• PS_set_border_style Sets border style of annotations
• PS_set_gstate Sets a previously created graphic state
• PS_set_info Sets information fields of document
• PS_set_parameter Sets certain parameters
• PS_set_text_pos Sets position for text output
• PS_set_value Sets certain values
• PS_setcolor Sets current color
• PS_setdash Sets appearance of a dashed line
• PS_setflat Sets flatness
• PS_setfont Sets font to use for following output
• PS_setgray Sets gray value
• PS_setlinecap Sets appearance of line ends
• PS_setlinejoin Sets how contected lines are joined
• PS_setlinewidth Sets width of a line
• PS_setmiterlimit Sets the miter limit
• PS_setpolydash Sets appearance of a dashed line
• PS_shading Create shading
• PS_shading_pattern Create a shading pattern
• PS_shfill Draws a shading
• PS_show Output text at current position
• PS_show2 Output text with given length
• PS_show_boxed Output text in a box
• PS_show_xy Output text at given position
• PS_show_xy2 Output text at given position
• PS_shutdown Final clean up of library
• PS_string_geometry Gets geometry of a string
• PS_stringwidth Get width of a string
• PS_stringwidth2 Gets width of a string
• PS_stroke Draws the current path
• PS_symbol Output glyph at a certain position in the font encoding vector
• PS_symbol_name Get name of a glyph
• PS_symbol_width Get width of a glyph
• PS_translate Sets translation
• pscsum1 return the sum of absolute values of a complex distributed vector sub( X ) in ASUM,
• psdbsv solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• psdbtrf compute a LU factorization of an N-by-N real banded diagonally dominant-like distributed matrix with bandwidth BWL, BWU
• psdbtrs solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• psdbtrsv solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• psdtsv solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• psdttrf compute a LU factorization of an N-by-N real tridiagonal diagonally dominant-like distributed matrix A(1:N, JA:JA+N-1)
• psdttrs solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• psdttrsv solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• psgbsv solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• psgbtrf compute a LU factorization of an N-by-N real banded distributed matrix with bandwidth BWL, BWU
• psgbtrs solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• psgebd2 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
• psgebrd 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
• psgecon 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 PSGETRF
• psgeequ 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
• psgehd2 reduce a real general distributed matrix sub( A ) to upper Hessenberg form H by an orthogonal similarity transforma- tion
• psgehrd reduce a real general distributed matrix sub( A ) to upper Hessenberg form H by an orthogonal similarity transforma- tion
• psgelq2 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
• psgelqf 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
• psgels solve overdetermined or underdetermined real linear systems involving an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1),
• psgeql2 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
• psgeqlf 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
• psgeqpf 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)
• psgeqr2 compute a QR factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R
• psgeqrf compute a QR factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R
• psgerfs improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
• psgerq2 compute a RQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R * Q
• psgerqf compute a RQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R * Q
• psgesv compute the solution to a real system of linear equations sub( A ) * X = sub( B ),
• psgesvd compute the singular value decomposition (SVD) of an M-by-N matrix A, optionally computing the left and/or right singular vectors
• psgesvx use the LU factorization to compute the solution to a real system of linear equations A(IA:IA+N-1,JA:JA+N-1) * X = B(IB:IB+N-1,JB:JB+NRHS-1),
• psgetf2 compute an LU factorization of a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using partial pivoting with row interchanges
• psgetrf compute an LU factorization of a general M-by-N distributed matrix sub( A ) = (IA:IA+M-1,JA:JA+N-1) using partial pivoting with row interchanges
• psgetri compute the inverse of a distributed matrix using the LU factorization computed by PSGETRF
• psgetrs solve a system of distributed linear equations op( sub( A ) ) * X = sub( B ) with a general N-by-N distributed matrix sub( A ) using the LU factorization computed by PSGETRF
• psggqrf compute a generalized QR factorization of an N-by-M matrix sub( A ) = A(IA:IA+N-1,JA:JA+M-1) and an N-by-P matrix sub( B ) = B(IB:IB+N-1,JB:JB+P-1)
• psggrqf compute a generalized RQ factorization of an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
• psiginfo print signal description
• psignal print signal description
• pskc_add_keypackage API function
• pskc_build_xml API function
• pskc_check_version API function
• pskc_done API function
• pskc_free API function
• pskc_get_cryptomodule_id API function
• pskc_get_device_devicebinding API function
• pskc_get_device_expirydate API function
• pskc_get_device_issueno API function
• pskc_get_device_manufacturer API function
• pskc_get_device_model API function
• pskc_get_device_serialno API function
• pskc_get_device_startdate API function
• pskc_get_device_userid API function
• pskc_get_id API function
• pskc_get_key_algorithm API function
• pskc_get_key_algparm_chall_checkdigits API function
• pskc_get_key_algparm_chall_encoding API function
• pskc_get_key_algparm_chall_max API function
• pskc_get_key_algparm_chall_min API function
• pskc_get_key_algparm_resp_checkdigits API function
• pskc_get_key_algparm_resp_encoding API function
• pskc_get_key_algparm_resp_length API function
• pskc_get_key_algparm_suite API function
• pskc_get_key_data_b64secret API function
• pskc_get_key_data_counter API function
• pskc_get_key_data_secret API function
• pskc_get_key_data_time API function
• pskc_get_key_data_timedrift API function
• pskc_get_key_data_timeinterval API function
• pskc_get_key_friendlyname API function
• pskc_get_key_id API function
• pskc_get_key_issuer API function
• pskc_get_key_policy_expirydate API function
• pskc_get_key_policy_keyusages API function
• pskc_get_key_policy_numberoftransactions API function
• pskc_get_key_policy_pinencoding API function
• pskc_get_key_policy_pinkeyid API function
• pskc_get_key_policy_pinmaxfailedattempts API function
• pskc_get_key_policy_pinmaxlength API function
• pskc_get_key_policy_pinminlength API function
• pskc_get_key_policy_pinusagemode API function
• pskc_get_key_policy_startdate API function
• pskc_get_key_profileid API function
• pskc_get_key_reference API function
• pskc_get_key_userid API function
• pskc_get_keypackage API function
• pskc_get_signed_p API function
• pskc_get_version API function
• pskc_global_done API function
• pskc_global_init API function
• pskc_global_log API function
• pskc_init API function
• pskc_keyusage2str API function
• pskc_output API function
• pskc_parse_from_memory API function
• pskc_pinusagemode2str API function
• pskc_set_cryptomodule_id API function
• pskc_set_device_devicebinding API function
• pskc_set_device_expirydate API function
• pskc_set_device_issueno API function
• pskc_set_device_manufacturer API function
• pskc_set_device_model API function
• pskc_set_device_serialno API function
• pskc_set_device_startdate API function
• pskc_set_device_userid API function
• pskc_set_id API function
• pskc_set_key_algorithm API function
• pskc_set_key_algparm_chall_checkdigits API function
• pskc_set_key_algparm_chall_encoding API function
• pskc_set_key_algparm_chall_max API function
• pskc_set_key_algparm_chall_min API function
• pskc_set_key_algparm_resp_checkdigits API function
• pskc_set_key_algparm_resp_encoding API function
• pskc_set_key_algparm_resp_length API function
• pskc_set_key_algparm_suite API function
• pskc_set_key_data_b64secret API function
• pskc_set_key_data_counter API function
• pskc_set_key_data_secret API function
• pskc_set_key_data_time API function
• pskc_set_key_data_timedrift API function
• pskc_set_key_data_timeinterval API function
• pskc_set_key_friendlyname API function
• pskc_set_key_id API function
• pskc_set_key_issuer API function
• pskc_set_key_policy_expirydate API function
• pskc_set_key_policy_keyusages API function
• pskc_set_key_policy_numberoftransactions API function
• pskc_set_key_policy_pinencoding API function
• pskc_set_key_policy_pinkeyid API function
• pskc_set_key_policy_pinmaxfailedattempts API function
• pskc_set_key_policy_pinmaxlength API function
• pskc_set_key_policy_pinminlength API function
• pskc_set_key_policy_pinusagemode API function
• pskc_set_key_policy_startdate API function
• pskc_set_key_profileid API function
• pskc_set_key_reference API function
• pskc_set_key_userid API function
• pskc_set_version API function
• pskc_sign_x509 API function
• pskc_str2keyusage API function
• pskc_str2pinusagemode API function
• pskc_str2valueformat API function
• pskc_strerror API function
• pskc_strerror_name API function
• pskc_validate API function
• pskc_valueformat2str API function
• pskc_verify_x509crt API function
• pslabad take as input the values computed by PSLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large
• pslabrd reduce the first NB rows and columns of a real general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower bidiagonal form by an orthogonal transformation Q' * A * P,
• pslacon estimate the 1-norm of a square, real distributed matrix A
• pslaconsb look for two consecutive small subdiagonal elements by seeing the effect of starting a double shift QR iteration given by H44, H33, & H43H34 and see if this would make a subdiagonal negligible
• pslacp2 copie all or part of a distributed matrix A to another distributed matrix B
• pslacp3 i an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa
• pslacpy copie all or part of a distributed matrix A to another distributed matrix B
• pslaevswp move the eigenvectors (potentially unsorted) from where they are computed, to a ScaLAPACK standard block cyclic array, sorted so that the corresponding eigenvalues are sorted
• pslahqr i an auxiliary routine used to find the Schur decomposition and or eigenvalues of a matrix already in Hessenberg form from cols ILO to IHI
• pslahrd reduce the first NB columns of a real general N-by-(N-K+1) distributed matrix A(IA:IA+N-1,JA:JA+N-K) so that elements below the k-th subdiagonal are zero
• pslamch determine single precision machine parameters
• pslange return the value of the one norm, or the Frobenius norm,
• pslanhs return the value of the one norm, or the Frobenius norm,
• pslansy return the value of the one norm, or the Frobenius norm,
• pslantr return the value of the one norm, or the Frobenius norm,
• pslapiv applie either P (permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
• pslapv2 applie either P (permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
• pslaqge equilibrate a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using the row and scaling factors in the vectors R and C
• pslaqsy equilibrate a symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the scaling factors in the vectors SR and SC
• pslared1d redistribute a 1D array It assumes that the input array, BYCOL, is distributed across rows and that all process column contain the same copy of BYCOL
• pslared2d redistribute a 1D array It assumes that the input array, BYROW, is distributed across columns and that all process rows contain the same copy of BYROW
• pslarf applie a real elementary reflector Q (or Q**T) to a real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
• pslarfb applie a real block reflector Q or its transpose Q**T to a real distributed M-by-N matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1)
• pslarfg generate a real elementary reflector H of order n, such that H * sub( X ) = H * ( x(iax,jax) ) = ( alpha ), H' * H = I
• pslarft form the triangular factor T of a real block reflector H of order n, which is defined as a product of k elementary reflectors
• pslarz 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
• pslarzb 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)
• pslarzt 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 PSTZRZF
• pslascl 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
• pslase2 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
• pslaset 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
• pslasmsub look for a small subdiagonal element from the bottom of the matrix that it can safely set to zero
• pslassq return the values scl and smsq such that ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
• pslaswp perform a series of row or column interchanges on the distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
• pslatra compute the trace of an N-by-N distributed matrix sub( A ) denoting A( IA:IA+N-1, JA:JA+N-1 )
• pslatrd 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,
• pslatrs solve a triangular system
• pslatrz 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
• pslauu2 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)
• pslauum 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)
• pslawil get the transform given by H44,H33, & H43H34 into V starting at row M
• pslib Library to create PostScript files
• psm Personal Space Management
• psorg2l 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)
• psorg2r 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)
• psorgl2 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)
• psorglq 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)
• psorgql 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)
• psorgqr 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)
• psorgr2 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)
• psorgrq 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)
• psorm2l 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'
• psorm2r 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'
• psormbr VECT = 'Q', PSORMBR 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'
• psormhr 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'
• psorml2 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'
• psormlq 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'
• psormql 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'
• psormqr 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'
• psormr2 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'
• psormr3 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'
• psormrq 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'
• psormrz 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'
• psormtr 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'
• psort parallel sort functions
• pspaint graphics state objects with added PostScript information
• pspbsv solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pspbtrf compute a Cholesky factorization of an N-by-N real banded symmetric positive definite distributed matrix with bandwidth BW
• pspbtrs solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pspbtrsv solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pspectrum_string_kernel.hpp
• pspocon 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 PSPOTRF
• pspoequ 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)
• psporfs 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
• psposv compute the solution to a real system of linear equations sub( A ) * X = sub( B ),
• psposvx 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),
• pspotf2 compute the Cholesky factorization of a real symmetric positive definite distributed matrix sub( A )=A(IA:IA+N-1,JA:JA+N-1)
• pspotrf 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)
• pspotri 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 PSPOTRF
• pspotrs 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)
• psptsv solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pspttrf compute a Cholesky factorization of an N-by-N real tridiagonal symmetric positive definite distributed matrix A(1:N, JA:JA+N-1)
• pspttrs solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• pspttrsv solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
• psrscl multiplie an N-element real distributed vector sub( X ) by the real scalar 1/a
• psstebz compute the eigenvalues of a symmetric tridiagonal matrix in parallel
• psstein compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
• pssyev compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
• pssyevx compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
• pssygs2 reduce a real symmetric-definite generalized eigenproblem to standard form
• pssygst reduce a real symmetric-definite generalized eigenproblem to standard form
• pssygvx compute all the eigenvalues, and optionally, the eigenvectors of a real generalized SY-definite eigenproblem
• pssytd2 reduce a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity transformation
• pssytrd reduce a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity transformation
• pstf2 pstf2: triangular factor, with pivoting panel, level 2
• pstrcon 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
• pstream.h Declares all PStreams classes
• pstreams_deprecated
• pstrf pstrf: triangular factor, with pivoting
• pstrrfs provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
• pstrti2 compute the inverse of a real upper or lower triangular block matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
• pstrtri compute the inverse of a upper or lower triangular distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
• pstrtrs solve a triangular system of the form sub( A ) * X = sub( B ) or sub( A )**T * X = sub( B ),
• pstzrzf 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
• psx_load_syscalls POSIX semantics for system calls
• psx_set_sensitivity POSIX semantics for system calls
• psx_syscall POSIX semantics for system calls
• psx_syscall3 POSIX semantics for system calls
• psx_syscall6 POSIX semantics for system calls