A, B[, ipiv=None[, uplo='L']]) |
'd'
or
'z'
).
The optional argument ipiv is an integer matrix of length at
least equal to n.
If ipiv is provided, sysv() solves the system and
returns the factorization in A and ipiv.
If ipiv is not specified, sysv() solves the
system but does not return the factorization and does not modify
A.
Raises an ArithmeticError
if the matrix is singular.
A, ipiv[, uplo='L']) |
'i'
matrix of length at least n.
On exit, A and ipiv contain the factorization.
Raises an ArithmeticError
if the matrix is singular.
A, ipiv, B[, uplo='L']) |
A, ipiv[, uplo='L']) |
A, B[, ipiv=None [, uplo='L']]) |
'd'
or
'z'
).
The optional argument ipiv is an integer matrix of length at
least n.
If ipiv is provided, then hesv() solves the system and
returns the factorization in A and ipiv.
If ipiv is not specified, then hesv() solves the
system but does not return the factorization and does not modify
A.
Raises an ArithmeticError
if the matrix is singular.
A, ipiv[, uplo='L']) |
'i'
matrix of length at least n.
On exit, A and ipiv contain the factorization.
Raises an ArithmeticError
if the matrix is singular.
A, ipiv, B[, uplo='L']) |
A, ipiv[, uplo='L']) |
As an example we solve the KKT system (4.1).
>>> from cvxopt.lapack import sysv >>> K = matrix(0.0, (m+n,m+n)) >>> K[: (m+n)*m : m+n+1] = -d**2 >>> K[:m, m:] = A >>> x = matrix(0.0, (m+n,1)) >>> x[:m], x[m:] = b1, b2 >>> sysv(K, x, uplo='U')