To go to the beginning of a chapter click on the appropriate letter below:

or

or

AB08NXConstruction of a reduced system with input/output matrix Dr of full row rank, preserving transmission zeros

AB09AXBalance & Truncate model reduction with state matrix in real Schur formAB09BXSingular perturbation approximation based model reduction with state matrix in real Schur formAB09CXHankel norm approximation based model reduction with state matrix in real Schur formAB09HXStochastic balancing model reduction of stable systemsAB09HYCholesky factors of the controllability and observability GrammiansAB09IXAccuracy enhanced balancing related model reductionAB09IYCholesky factors of the frequency-weighted controllability and observability GrammiansAB09JVState-space representation of a projection of a left weighted transfer-function matrixAB09JWState-space representation of a projection of a right weighted transfer-function matrixAB09JXCheck stability/antistability of finite eigenvaluesAB09KXStable projection of V*G*W or conj(V)*G*conj(W)

AB13AXHankel-norm of a stable system with state matrix in real Schur formAB13DXMaximum singular value of a transfer-function matrix

AG08BYConstruction of a reduced system with input/output matrix Dr of full row rank, preserving the finite Smith zeros

IB01MDUpper triangular factor in QR factorization of a block-Hankel-block matrixIB01MYUpper triangular factor in fast QR factorization of a block-Hankel-block matrixIB01NDSingular value decomposition giving the system orderIB01ODEstimating the system orderIB01OYUser's confirmation of the system orderIB01PDEstimating the system matrices and covariancesIB01PXEstimating the matrices B and D of a system using Kronecker productsIB01PYEstimating the matrices B and D of a system exploiting the structureIB01QDEstimating the initial state and the matrices B and D of a systemIB01RDEstimating the initial state of a system

MA01ADComplex square root of a complex number in real arithmetic

MA02ADTranspose of a matrixMA02BDReversing the order of rows and/or columns of a matrixMA02CDPertranspose of the central band of a square matrixMA02DDPack/unpack the upper or lower triangle of a symmetric matrixMA02EDConstruct a triangle of a symmetric matrix, given the other triangleMA02FDHyperbolic plane rotationMA02GDColumn interchanges on the matrixMA02HDCheck if a matrix is a scalar multiple of an identity-like matrixMB01SDRows and/or columns scaling of a matrix

MB01RUComputation of matrix expression alpha*R + beta*A*X*trans(A) (MB01RD variant)MB01RWComputation of matrix expression alpha*A*X*trans(A), X symmetric (BLAS 2)MB01RXComputing a triangle of the matrix expressions alpha*R + beta*A*B or alpha*R + beta*B*AMB01RYComputing a triangle of the matrix expressions alpha*R + beta*H*B or alpha*R + beta*B*H, with H an upper Hessenberg matrixMB01UWComputation of matrix expressions alpha*H*A or alpha*A*H, overwritting A, with H an upper Hessenberg matrixMB01VDKronecker product of two matricesMB01XYComputation of the product U'*U or L*L', with U and L upper and lower triangular matrices (unblock algorithm)SB03OVConstruction of a complex plane rotation to annihilate a real number, modifying a complex numberSG03BYComputing a complex plane rotation in real arithmetic

MB02CUBringing the first blocks of a generator in proper form (extended version of MB02CX)MB02CVApplying the MB02CU transformations on other columns / rows of the generatorMB02CXBringing the first blocks of a generator in proper formMB02CYApplying the MB02CX transformations on other columns / rows of the generatorMB02NYSeparation of a zero singular value of a bidiagonal submatrixMB02QYMinimum-norm least squares solution, given a rank-revealing QR factorizationMB02UUSolution of linear equations using LU factorization with complete pivotingMB02UVLU factorization with complete pivotingMB02WDSolution of a positive definite linear system A*x = b, or f(A, x) = b, using conjugate gradient algorithmMB02XDSolution of a set of positive definite linear systems, A'*A*X = B, or f(A)*X = B, using Gaussian eliminationMB02YDSolution of the linear system A*x = b, D*x = 0, D diagonal

MB03NYThe smallest singular value of A - jwIMB03OYMatrix rank determination by incremental condition estimation, during the pivoted QR factorization processMB03PYMatrix rank determination by incremental condition estimation, during the pivoted RQ factorization process (row pivoting)MB03QXEigenvalues of an upper quasi-triangular matrixMB03QYTransformation to Schur canonical form of a selected 2-by-2 diagonal block of an upper quasi-triangular matrixMB03RXReordering the diagonal blocks of a principal submatrix of a real Schur form matrixMB03RYTentative solution of Sylvester equation -AX + XB = C (A, B in real Schur form)MB03VYGenerating orthogonal matrices for reduction to periodic Hessenberg form of a product of matricesMB03WXEigenvalues of a product of matrices, T = T_1*T_2*...*T_p, with T_1 upper quasi-triangular and T_2, ..., T_p upper triangularMB05MYComputing an orthogonal matrix reducing a matrix to real Schur form T, the eigenvalues, and the upper triangular matrix of right eigenvectors of TMB05OYRestoring a matrix after balancing transformations

MB04DYSymplectic scaling of a Hamiltonian matrixMB04IYApplying the product of elementary reflectors used for QR factorization of a matrix having a lower left zero triangleMB04NYApplying an elementary reflector to a matrix C = ( A B ), from the right, where A has one columnMB04OYApplying an elementary reflector to a matrix C = ( A' B' )', from the left, where A has one rowMB04OWRank-one update of a Cholesky factorization for a 2-by-2 block matrixMB04OXRank-one update of a Cholesky factorizationMB04PYApplying an elementary reflector to a matrix from the left or rightMB04TUApplying a row-permuted Givens transformation to two row vectorsMB04XYApplying Householder transformations for bidiagonalization (stored in factored form) to one or two matrices, from the leftMB04YWOne QR or QL iteration step onto an unreduced bidiagonal submatrix of a bidiagonal matrix

MC01PYCoefficients of a real polynomial, stored in decreasing order, given its zeros

MC03NXConstruction of a pencil sE-A related to a given polynomial matrix

MD03BXQR factorization with column pivoting and error vector transformationMD03BYFinding the Levenberg-Marquardt parameter

NF01ADComputing the output of a Wiener systemNF01AYComputing the output of a set of neural networksNF01BDComputing the Jacobian of a Wiener systemNF01BPFinding the Levenberg-Marquardt parameterNF01BQSolution of the linear system J*x = b, D*x = 0, D diagonalNF01BRSolution of the linear system op(R)*x = b, R block upper triangular stored in a compressed formNF01BSQR factorization of a structured Jacobian matrixNF01BUComputing J'*J + c*I, for the Jacobian J given in a compressed formNF01BVComputing J'*J + c*I, for a full Jacobian J (one output variable)NF01BWMatrix-vector product x <-- (J'*J + c*I)*x, for J in a compressed formNF01BXMatrix-vector product x <-- (A'*A + c*I)*x, for a full matrix ANF01BYComputing the Jacobian of the error function for a neural network (for one output variable)

SB01BXChoosing the closest real (complex conjugate) eigenvalue(s) to a given real (complex) valueSB01BYPole placement for systems of order 1 or 2SB01FYInner denominator of a right-coprime factorization of an unstable system of order 1 or 2

SB02MUConstructing the 2n-by-2n Hamiltonian or symplectic matrix for linear-quadratic optimization problemsSB02RUConstructing the 2n-by-2n Hamiltonian or symplectic matrix for linear-quadratic optimization problems (efficient and accurate version of SB02MU)SB02OYConstructing and compressing the extended Hamiltonian or symplectic matrix pairs for linear-quadratic optimization problems

SB03MVSolving a discrete-time Lyapunov equation for a 2-by-2 matrixSB03MWSolving a continuous-time Lyapunov equation for a 2-by-2 matrixSB03MXSolving a discrete-time Lyapunov equation with matrix A quasi-triangularSB03MYSolving a continuous-time Lyapunov equation with matrix A quasi-triangularSB03OTSolving (for Cholesky factor) stable continuous- or discrete-time Lyapunov equations, with A quasi-triangular and R triangularSB03OUSolving (for Cholesky factor) stable continuous- or discrete-time Lyapunov equations, with A in real Schur form and B rectangularSB03OYSolving (for Cholesky factor) stable 2-by-2 continuous- or discrete-time Lyapunov equations, with matrix A having complex conjugate eigenvaluesSB03QXForward error bound for continuous-time Lyapunov equationsSB03QYSeparation and Theta norm for continuous-time Lyapunov equationsSB03SXForward error bound for discrete-time Lyapunov equationsSB03SYSeparation and Theta norm for discrete-time Lyapunov equations

SB03MUSolving a discrete-time Sylvester equation for an m-by-n matrix X, 1 <= m,n <= 2SB03ORSolving quasi-triangular continuous- or discrete-time Sylvester equations, for an n-by-m matrix X, 1 <= m <= 2SB04MRSolving a linear algebraic system whose coefficient matrix (stored compactly) has zeros below the second subdiagonalSB04MUConstructing and solving a linear algebraic system whose coefficient matrix (stored compactly) has zeros below the second subdiagonalSB04MWSolving a linear algebraic system whose coefficient matrix (stored compactly) has zeros below the first subdiagonalSB04MYConstructing and solving a linear algebraic system whose coefficient matrix (stored compactly) has zeros below the first subdiagonalSB04NVConstructing right-hand sides for a system of equations in Hessenberg form solved via SB04NXSB04NWConstructing the right-hand side for a system of equations in Hessenberg form solved via SB04NYSB04NXSolving a system of equations in Hessenberg form with two consecutive offdiagonals and two right-hand sidesSB04NYSolving a system of equations in Hessenberg form with one offdiagonal and one right-hand sideSB04PXSolving a discrete-time Sylvester equation for matrices of order <= 2SB04PYSolving a discrete-time Sylvester equation with matrices in Schur formSB04QRSolving a linear algebraic system whose coefficient matrix (stored compactly) has zeros below the third subdiagonalSB04QUConstructing and solving a linear algebraic system whose coefficient matrix (stored compactly) has zeros below the third subdiagonalSB04QYConstructing and solving a linear algebraic system whose coefficient matrix (stored compactly) has zeros below the first subdiagonal (discrete-time case)SB04RVConstructing right-hand sides for a system of equations in Hessenberg form solved via SB04RXSB04RWConstructing the right-hand side for a system of equations in Hessenberg form solved via SB04RYSB04RXSolving a system of equations in Hessenberg form with two consecutive offdiagonals and two right-hand sides (discrete-time case)SB04RYSolving a system of equations in Hessenberg form with one offdiagonal and one right-hand side (discrete-time case)

SB10JDConversion of a descriptor state-space system into regular state-space formSB10LDClosed-loop system matrices for a system with robust controllerSB10PDNormalization of a system for H-infinity controller designSB10QDState feedback and output injection matrices for an H-infinity (sub)optimal state controller (continuous-time)SB10RDH-infinity (sub)optimal controller matrices using state feedback and output injection matrices (continuous-time)SB10SDH2 optimal controller matrices for a normalized discrete-time systemSB10TDH2 optimal controller matrices for a discrete-time systemSB10UDNormalization of a system for H2 controller designSB10VDState feedback and output injection matrices for an H2 optimal state controller (continuous-time)SB10WDH2 optimal controller matrices using state feedback and output injection matrices (continuous-time)SB10YDFitting frequency response data with a stable, minimum phase SISO systemSB10ZPTransforming a SISO system into a stable and minimum phase one

SB16AYCholesky factors of the frequency-weighted controllability and observability Grammians for controller reductionSB16CYCholesky factors of controllability and observability Grammians of coprime factors of a state-feedback controller

SG03AXSolving a generalized discrete-time Lyapunov equation with A quasi-triangular and E upper triangularSG03AYSolving a generalized continuous-time Lyapunov equation with A quasi-triangular and E upper triangularSG03BUSolving (for Cholesky factor) stable generalized discrete-time Lyapunov equations with A quasi-triangular, and E, B upper triangularSG03BVSolving (for Cholesky factor) stable generalized continuous-time Lyapunov equations with A quasi-triangular, and E, B upper triangularSG03BXSolving (for Cholesky factor) stable generalized 2-by-2 Lyapunov equations

SG03BWSolving a generalized Sylvester equation with A quasi-triangular and E upper triangular, for X m-by-n, n = 1 or 2

TB01VDConversion of a discrete-time system to output normal formTB01VYConversion of the output normal form of a discrete-time system to a state-space representationTB01XDSpecial similarity transformation of the dual state-space systemTB01YDSpecial similarity transformation of a state-space system

TB04BVStrictly proper part of a proper transfer function matrixTB04BWSum of a rational matrix and a real matrixTB04BXGain of a SISO linear system, given (A,b,c,d), its poles and zeros

TF01MXOutput response of a linear discrete-time system, given a general system matrix (each output is a column of the result)TF01MYOutput response of a linear discrete-time system, given the system matrices (each output is a column of the result)

TG01HXOrthogonal reduction of a descriptor system to a system with the same transfer-function matrix and without uncontrollable finite eigenvalues