section 3 · Library functions 📚

P (continued)

• pslahqr(3)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(3)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(3)determine single precision machine parameters✨
• pslange(3)return the value of the one norm, or the Frobenius norm,✨
• pslanhs(3)return the value of the one norm, or the Frobenius norm,✨
• pslansy(3)return the value of the one norm, or the Frobenius norm,✨
• pslantr(3)return the value of the one norm, or the Frobenius norm,✨
• pslapiv(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)generate a real elementary reflector H of order n, such that H * sub( X ) = H * ( x(iax,jax) ) = ( alpha ), H' * H = I✨
• pslarft(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)look for a small subdiagonal element from the bottom of the matrix that it can safely set to zero✨
• pslassq(3)return the values scl and smsq such that ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,✨
• pslaswp(3)perform a series of row or column interchanges on the distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)✨
• pslatra(3)compute the trace of an N-by-N distributed matrix sub( A ) denoting A( IA:IA+N-1, JA:JA+N-1 )✨
• pslatrd(3)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(3)solve a triangular system✨
• pslatrz(3)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(3)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(3)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(3)get the transform given by H44,H33, & H43H34 into V starting at row M✨
• pslib(3)Library to create PostScript files✨
• psm(3)Personal Space Management✨
• psn(3)✨
• psorg2l(3)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 =…✨
• psorg2r(3)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 =…✨
• psorgl2(3)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(3)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(3)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 =…✨
• psorgqr(3)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 =…✨
• psorgr2(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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'✨
• pspaint(3U)graphics state objects with added PostScript information✨
• pspbsv(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pspbtrf(3)compute a Cholesky factorization of an N-by-N real banded symmetric positive definite distributed matrix with bandwidth BW✨
• pspbtrs(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pspbtrsv(3)solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pspocon(3)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(3)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…✨
• psporfs(3)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(3)compute the solution to a real system of linear equations sub( A ) * X = sub( B ),✨
• psposvx(3)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(3)compute the Cholesky factorization of a real symmetric positive definite distributed matrix sub( A )=A(IA:IA+N-1,JA:JA+N-1)✨
• pspotrf(3)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(3)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(3)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(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pspttrf(3)compute a Cholesky factorization of an N-by-N real tridiagonal symmetric positive definite distributed matrix A(1:N, JA:JA+N-1)✨
• pspttrs(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pspttrsv(3)solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• psrscl(3)multiplie an N-element real distributed vector sub( X ) by the real scalar 1/a✨
• pss_saltlen(3)✨
• psstebz(3)compute the eigenvalues of a symmetric tridiagonal matrix in parallel✨
• psstein(3)compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration✨
• pssyev(3)compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines✨
• pssyevx(3)compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines✨
• pssygs2(3)reduce a real symmetric-definite generalized eigenproblem to standard form✨
• pssygst(3)reduce a real symmetric-definite generalized eigenproblem to standard form✨
• pssygvx(3)compute all the eigenvalues, and optionally, the eigenvectors of a real generalized SY-definite eigenproblem✨
• pssytd2(3)reduce a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity transformation✨
• pssytrd(3)reduce a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity transformation✨
• pstf2(3)pstf2: triangular factor, with pivoting panel, level 2✨
• PSTR(3)✨
• PSTR(3avr)<avr/pgmspace.h>: Program Space Utilities✨
• PSTR_FAR(3avr)<avr/pgmspace.h>: Program Space Utilities✨
• pstrcon(3)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(3)Declares all PStreams classes✨
• pstrf(3)pstrf: triangular factor, with pivoting✨
• pstrrfs(3)provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix✨
• pstrti2(3)compute the inverse of a real upper or lower triangular block matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)✨
• pstrtri(3)compute the inverse of a upper or lower triangular distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)✨
• pstrtrs(3)solve a triangular system of the form sub( A ) * X = sub( B ) or sub( A )**T * X = sub( B ),✨
• pstzrzf(3)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✨
• psubscribe(3valkey)Listens for messages published to channels that match one or more patterns.✨
• psx_load_syscalls(3)POSIX semantics for system calls✨
• psx_set_sensitivity(3)POSIX semantics for system calls✨
• psx_syscall(3)POSIX semantics for system calls✨
• psx_syscall3(3)POSIX semantics for system calls✨
• psx_syscall6(3)POSIX semantics for system calls✨
• psym3(3NCARG)Draws the projections of character strings that are positioned in a plane parallel to one of the three coordinate planes. NOTE: At one time, a Threed routine called PSYM3 was supported. It has long…✨
• psync(3valkey)An internal command used in replication.✨
• PT(3)Positive Definite tridiagonal Matrix✨
• pt(3)✨
• pt(3tcl)Parser Tools Application✨
• pt_alloc_encoder(3)allocate/free an Intel(R) Processor Trace packet encoder✨
• pt_astree(3tcl)Abstract Syntax Tree Serialization✨
• pt_blk_alloc_decoder(3)allocate/free an Intel(R) Processor Trace block decoder✨
• pt_blk_core_bus_ratio(3)query an Intel(R) Processor Trace decoder for timing information✨
• pt_blk_event(3)query an Intel(R) Processor Trace decoder for an (asynchronous) event✨
• pt_blk_free_decoder(3)allocate/free an Intel(R) Processor Trace block decoder✨
• pt_blk_get_config(3)get an Intel(R) Processor Trace encoder/decoder’s configuration✨
• pt_blk_get_image(3)get/set an Intel(R) Processor Trace instruction flow or block decoder’s traced memory image descriptor✨
• pt_blk_get_offset(3)get an Intel(R) Processor Trace block decoder’s current/synchronization trace buffer offset✨
• pt_blk_get_sync_offset(3)get an Intel(R) Processor Trace block decoder’s current/synchronization trace buffer offset✨
• pt_blk_next(3)iterate over blocks of traced instructions✨
• pt_blk_set_image(3)get/set an Intel(R) Processor Trace instruction flow or block decoder’s traced memory image descriptor✨
• pt_blk_sync_backward(3)synchronize an Intel(R) Processor Trace block decoder✨
• pt_blk_sync_forward(3)synchronize an Intel(R) Processor Trace block decoder✨
• pt_blk_sync_set(3)synchronize an Intel(R) Processor Trace block decoder✨
• pt_blk_time(3)query an Intel(R) Processor Trace decoder for timing information✨
• pt_block(3)iterate over blocks of traced instructions✨
• pt_config(3)Intel(R) Processor Trace encoder/decoder configuration✨
• pt_cparam_config_critcl(3tcl)C/PARAM, Canned configuration, Critcl✨
• pt_cparam_config_tea(3tcl)C/PARAM, Canned configuration, TEA✨
• pt_cpu_errata(3)Intel(R) Processor Trace encoder/decoder configuration✨
• pt_enc_get_config(3)get an Intel(R) Processor Trace encoder/decoder’s configuration✨
• pt_enc_get_offset(3)get/set an Intel(R) Processor Trace packet encoder’s current trace buffer offset✨
• pt_enc_next(3)encode/decode an Intel(R) Processor Trace packet✨
• pt_enc_sync_set(3)get/set an Intel(R) Processor Trace packet encoder’s current trace buffer offset✨
• pt_evt_next(3)query an Intel(R) Processor Trace decoder for an (asynchronous) event✨
• pt_free_encoder(3)allocate/free an Intel(R) Processor Trace packet encoder✨
• pt_from_api(3tcl)Parser Tools Import API✨
• pt_image_add_cached(3)add file sections to a traced memory image descriptor✨
• pt_image_add_file(3)add file sections to a traced memory image descriptor✨
• pt_image_alloc(3)allocate/free a traced memory image descriptor✨
• pt_image_copy(3)add file sections to a traced memory image descriptor✨
• pt_image_free(3)allocate/free a traced memory image descriptor✨
• pt_image_name(3)allocate/free a traced memory image descriptor✨
• pt_image_remove_by_asid(3)remove sections from a traced memory image descriptor✨
• pt_image_remove_by_filename(3)remove sections from a traced memory image descriptor✨
• pt_image_set_callback(3)set a traced memory image read memory callback✨
• pt_insn(3)iterate over traced instructions✨
• pt_insn_alloc_decoder(3)allocate/free an Intel(R) Processor Trace instruction flow decoder✨
• pt_insn_core_bus_ratio(3)query an Intel(R) Processor Trace decoder for timing information✨
• pt_insn_event(3)query an Intel(R) Processor Trace decoder for an (asynchronous) event✨
• pt_insn_free_decoder(3)allocate/free an Intel(R) Processor Trace instruction flow decoder✨
• pt_insn_get_config(3)get an Intel(R) Processor Trace encoder/decoder’s configuration✨
• pt_insn_get_image(3)get/set an Intel(R) Processor Trace instruction flow or block decoder’s traced memory image descriptor✨
• pt_insn_get_offset(3)get an Intel(R) Processor Trace instruction flow decoder’s current/synchronization trace buffer offset✨
• pt_insn_get_sync_offset(3)get an Intel(R) Processor Trace instruction flow decoder’s current/synchronization trace buffer offset✨
• pt_insn_next(3)iterate over traced instructions✨
• pt_insn_set_image(3)get/set an Intel(R) Processor Trace instruction flow or block decoder’s traced memory image descriptor✨
• pt_insn_sync_backward(3)synchronize an Intel(R) Processor Trace instruction flow decoder✨
• pt_insn_sync_forward(3)synchronize an Intel(R) Processor Trace instruction flow decoder✨
• pt_insn_sync_set(3)synchronize an Intel(R) Processor Trace instruction flow decoder✨
• pt_insn_time(3)query an Intel(R) Processor Trace decoder for timing information✨
• pt_introduction(3tcl)Introduction to Parser Tools✨
• pt_iscache_add_file(3)add file sections to a traced memory image section cache✨
• pt_iscache_alloc(3)allocate/free a traced memory image section cache✨
• pt_iscache_free(3)allocate/free a traced memory image section cache✨
• pt_iscache_name(3)allocate/free a traced memory image section cache✨
• pt_iscache_read(3)read memory from a cached file section✨
• pt_iscache_set_limit(3)set the mapped image section cache limit✨
• pt_json_language(3tcl)The JSON Grammar Exchange Format✨
• pt_library_version(3)version information✨
• pt_packet(3)encode/decode an Intel(R) Processor Trace packet✨
• pt_param(3tcl)PackRat Machine Specification✨
• pt_parse_peg(3tcl)Parser Tools PEG Parser✨
• pt_parser_api(3tcl)Parser API✨
• pt_peg_container(3tcl)PEG Storage✨
• pt_peg_container_peg(3tcl)PEG Storage. Canned PEG grammar specification✨
• pt_peg_export(3tcl)PEG Export✨
• pt_peg_export_container(3tcl)PEG Export Plugin. Write CONTAINER format✨
• pt_peg_export_json(3tcl)PEG Export Plugin. Write JSON format✨
• pt_peg_export_peg(3tcl)PEG Export Plugin. Write PEG format✨
• pt_peg_from_container(3tcl)PEG Conversion. From CONTAINER format✨
• pt_peg_from_json(3tcl)PEG Conversion. Read JSON format✨
• pt_peg_from_peg(3tcl)PEG Conversion. Read PEG format✨
• pt_peg_import(3tcl)PEG Import✨
• pt_peg_import_container(3tcl)PEG Import Plugin. From CONTAINER format✨
• pt_peg_import_json(3tcl)PEG Import Plugin. Read JSON format✨
• pt_peg_import_peg(3tcl)PEG Import Plugin. Read PEG format✨
• pt_peg_interp(3tcl)Interpreter for parsing expression grammars✨
• pt_peg_introduction(3tcl)Introduction to Parsing Expression Grammars✨
• pt_peg_language(3tcl)PEG Language Tutorial✨
• pt_peg_op(3tcl)Parser Tools PE Grammar Utility Operations✨
• pt_peg_to_container(3tcl)PEG Conversion. Write CONTAINER format✨
• pt_peg_to_cparam(3tcl)PEG Conversion. Write CPARAM format✨
• pt_peg_to_json(3tcl)PEG Conversion. Write JSON format✨
• pt_peg_to_param(3tcl)PEG Conversion. Write PARAM format✨
• pt_peg_to_peg(3tcl)PEG Conversion. Write PEG format✨
• pt_peg_to_tclparam(3tcl)PEG Conversion. Write TCLPARAM format✨
• pt_pegrammar(3tcl)Parsing Expression Grammar Serialization✨
• pt_pexpr_op(3tcl)Parsing Expression Utilities✨
• pt_pexpression(3tcl)Parsing Expression Serialization✨