.Modelica_LinearSystems2.Math.Matrices.Internal

Information

Generally, the functions in this package should not be used by the user.

This package contains functions which cannot be used in an arbitrary way and require particular knowledge. Therefore, only advanced users should deal with contained classes.

Contents

Name	Description
carenls	Newton's method with exact line search for solving continuous algebraic riccati equation
darenls	Newton's method with exact line search for solving continuous algebraic riccati equation
eigenvalues2	Compute eigenvalues and unnormalized eigenvectors
eigenvaluesHessenberg	Compute eigenvalues of an upper Hessenberg form matrix
findLocal_tk	Find a local minimizer tk to define the length of the step tk*Nk in carenls or darenls
haveZeroRow	Boolean output is true if at least one matrix row is zero vector
hessenberg2	Compute an upper Hessenberg matrix by repeatedly applicated householder similarity transformation
hohoTrafoLowerHess	Compute the similarity transformation S*A*S of matrix A with householder matrix S = I - 2u*u' to compute a lower Hessenberg form
hohoTrafoUpperHess	Compute the similarity (Householder-) transformation S*A*S of matrix A with householder matrix S = I - 2u*u' to compute an upper Hessenberg form
householderSimilarityTransformation2	Calculate the similarity transformation SAS of matrix A with householder matrix S = I - 2u*u'/(u'*u) to compute a lower Hessenberg form
multiplyWithOrthogonalQ_hr	Overwrites the general real M-by-N matrix C with Q * C or C * Q or Q' * C or C * Q', depending on inputs trans and side
multiplyWithOrthogonalQ_qr	Overwrites the general real M-by-N matrix C with Q * C or C * Q or Q' * C or C * Q', where Q is an orthogonal matrix of a QR factorization as returned by dgeqrf
reorderRSF	Reorder a real Schur factorization according to a given pattern of the eigenvalues
reorderRSFc	Reorder a real Schur factorization for pole assignment design for continuous systems
reorderRSFd	Reorder a real Schur factorization for pole assignment design for discrete systems
k_care_u	Calculate the upper bound of the CARE, i.e. Q + A'*X + X*A - X*G*X = 0 condition number using Lyapunov equations
frobeniusNorm	Return the Frobenius norm of a matrix
symMatMul	Calculate the upper triangle of A*B*A'+a*C with B and C symmetric
symMatMul_C	Calculate the upper triangle of A*B*A'+a*C with B and C symmetric
solveSymRight	Solve real system of linear equations X*A=B in X where A is symmetrix positive definite
solveSymRight_C	Solve real system of linear equations X*A=B where A is symmetrix positive definite
solve2rSym	Solve real system of linear equations X*A=B in X where A is symmetrix positive definite
solve2rSym_C	Solve real system of linear equations X*A=B where A is symmetrix positive definite