Linux Manuals session 3

NAME sorglq.f – SYNOPSIS Functions/Subroutines subroutine sorglq (M, N, K, A, LDA, TAU, WORK, LWORK, INFO) SORGLQ Function/Subroutine Documentation subroutine sorglq (integerM, integerN, integerK, real, dimension( lda, * )A, integerLDA, real, dimension( * )TAU, real, dimension( * )WORK, integerLWORK, integerINFO) SORGLQ Purpose: SORGLQ generates an M-by-N real matrix Q with orthonormal rows, which is defined…

NAME sorgl2.f – SYNOPSIS Functions/Subroutines subroutine sorgl2 (M, N, K, A, LDA, TAU, WORK, INFO) SORGL2 Function/Subroutine Documentation subroutine sorgl2 (integerM, integerN, integerK, real, dimension( lda, * )A, integerLDA, real, dimension( * )TAU, real, dimension( * )WORK, integerINFO) SORGL2 Purpose: SORGL2 generates an m by n real matrix Q with orthonormal rows, which is defined…

NAME sorghr.f – SYNOPSIS Functions/Subroutines subroutine sorghr (N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO) SORGHR Function/Subroutine Documentation subroutine sorghr (integerN, integerILO, integerIHI, real, dimension( lda, * )A, integerLDA, real, dimension( * )TAU, real, dimension( * )WORK, integerLWORK, integerINFO) SORGHR Purpose: SORGHR generates a real orthogonal matrix Q which is defined as the product…

NAME sorgbr.f – SYNOPSIS Functions/Subroutines subroutine sorgbr (VECT, M, N, K, A, LDA, TAU, WORK, LWORK, INFO) SORGBR Function/Subroutine Documentation subroutine sorgbr (characterVECT, integerM, integerN, integerK, real, dimension( lda, * )A, integerLDA, real, dimension( * )TAU, real, dimension( * )WORK, integerLWORK, integerINFO) SORGBR Purpose: SORGBR generates one of the real orthogonal matrices Q or P…

NAME sorg2r.f – SYNOPSIS Functions/Subroutines subroutine sorg2r (M, N, K, A, LDA, TAU, WORK, INFO) SORG2R generates all or part of the orthogonal matrix Q from a QR factorization determined by sgeqrf (unblocked algorithm). Function/Subroutine Documentation subroutine sorg2r (integerM, integerN, integerK, real, dimension( lda, * )A, integerLDA, real, dimension( * )TAU, real, dimension( * )WORK,…

NAME sorg2l.f – SYNOPSIS Functions/Subroutines subroutine sorg2l (M, N, K, A, LDA, TAU, WORK, INFO) SORG2L generates all or part of the orthogonal matrix Q from a QL factorization determined by sgeqlf (unblocked algorithm). Function/Subroutine Documentation subroutine sorg2l (integerM, integerN, integerK, real, dimension( lda, * )A, integerLDA, real, dimension( * )TAU, real, dimension( * )WORK,…

NAME sorcsd.f – SYNOPSIS Functions/Subroutines recursive subroutine sorcsd (JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12, X21, LDX21, X22, LDX22, THETA, U1, LDU1, U2, LDU2, V1T, LDV1T, V2T, LDV2T, WORK, LWORK, IWORK, INFO) SORCSD Function/Subroutine Documentation recursive subroutine sorcsd (characterJOBU1, characterJOBU2, characterJOBV1T, characterJOBV2T, characterTRANS, characterSIGNS, integerM, integerP, integerQ, real, dimension(…

NAME sorbdb.f – SYNOPSIS Functions/Subroutines subroutine sorbdb (TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12, X21, LDX21, X22, LDX22, THETA, PHI, TAUP1, TAUP2, TAUQ1, TAUQ2, WORK, LWORK, INFO) SORBDB Function/Subroutine Documentation subroutine sorbdb (characterTRANS, characterSIGNS, integerM, integerP, integerQ, real, dimension( ldx11, * )X11, integerLDX11, real, dimension( ldx12, * )X12, integerLDX12, real, dimension( ldx21, *…

QuantLib::TridiagonalOperator – Base implementation for tridiagonal operator. Synopsis #include <ql/methods/finitedifferences/tridiagonaloperator.hpp> Inherited by BSMOperator, DMinus, DPlus, DPlusDMinus, DZero, and PdeOperator< PdeClass >. Classes class TimeSetter encapsulation of time-setting logic Public Types typedef Array array_type Public Member Functions TridiagonalOperator (Size size=0) TridiagonalOperator (const Array &low, const Array &mid, const Array &high) TridiagonalOperator (const Disposable< TridiagonalOperator > &)…

NAME sopmtr.f – SYNOPSIS Functions/Subroutines subroutine sopmtr (SIDE, UPLO, TRANS, M, N, AP, TAU, C, LDC, WORK, INFO) SOPMTR Function/Subroutine Documentation subroutine sopmtr (characterSIDE, characterUPLO, characterTRANS, integerM, integerN, real, dimension( * )AP, real, dimension( * )TAU, real, dimension( ldc, * )C, integerLDC, real, dimension( * )WORK, integerINFO) SOPMTR Purpose: SOPMTR overwrites the general real M…

NAME sopgtr.f – SYNOPSIS Functions/Subroutines subroutine sopgtr (UPLO, N, AP, TAU, Q, LDQ, WORK, INFO) SOPGTR Function/Subroutine Documentation subroutine sopgtr (characterUPLO, integerN, real, dimension( * )AP, real, dimension( * )TAU, real, dimension( ldq, * )Q, integerLDQ, real, dimension( * )WORK, integerINFO) SOPGTR Purpose: SOPGTR generates a real orthogonal matrix Q which is defined as the…

NAME snrm2.f – SYNOPSIS Functions/Subroutines REAL function snrm2 (N, X, INCX) SNRM2 Function/Subroutine Documentation REAL function snrm2 (integerN, real, dimension(*)X, integerINCX) SNRM2 Purpose: SNRM2 returns the euclidean norm of a vector via the function name, so that SNRM2 := sqrt( x’*x ).   Author: Univ. of Tennessee Univ. of California Berkeley Univ. of Colorado Denver…

SNMP – The Perl5 ‘SNMP’ Extension Module for the Net-SNMP SNMP package. Synopsis use SNMP; … $sess = new SNMP::Session(DestHost => localhost, Community => public); $val = $sess->get(‘sysDescr.0’); … $vars = new SNMP::VarList([sysDescr,0], [sysContact,0], [sysLocation,0]); @vals = $sess->get($vars); … $vb = new SNMP::Varbind(); do { $val = $sess->getnext($vb); print "@{$vb} "; } until ($sess->{ErrorNum}); ……

QuantLib::SMMDriftCalculator – Drift computation for coterminal swap market models. Synopsis #include <ql/models/marketmodels/driftcomputation/smmdriftcalculator.hpp> Public Member Functions SMMDriftCalculator (const Matrix &pseudo, const std::vector< Spread > &displacements, const std::vector< Time > &taus, Size numeraire, Size alive) void compute (const CoterminalSwapCurveState &cs, std::vector< Real > &drifts) const Computes the drifts. Detailed Description Drift computation for coterminal swap market models….

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…

SLIST_EMPTY, SLIST_ENTRY, SLIST_FIRST, SLIST_FOREACH, SLIST_HEAD, SLIST_HEAD_INITIALIZER, SLIST_INIT, SLIST_INSERT_AFTER, SLIST_INSERT_HEAD, SLIST_NEXT, SLIST_REMOVE, SLIST_REMOVE_HEAD – implementation of a singly linked list Synopsis #include <sys/queue.h> int SLIST_EMPTY(SLIST_HEAD *head); SLIST_ENTRY(TYPE); struct TYPE *SLIST_FIRST(SLIST_HEAD *head); SLIST_FOREACH(struct TYPE *var, SLIST_HEAD *head, SLIST_ENTRY NAME); SLIST_HEAD(HEADNAME, TYPE); SLIST_HEAD SLIST_HEAD_INITIALIZER(SLIST_HEAD head); void SLIST_INIT(SLIST_HEAD *head); void SLIST_INSERT_AFTER(struct TYPE *listelm, struct TYPE *elm, SLIST_ENTRY NAME); void…