Skip to content

Instantly share code, notes, and snippets.

/-

Created September 27, 2015 07:05
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 1 You must be signed in to fork a gist
  • Save anonymous/00ca32bdaf08d427f999 to your computer and use it in GitHub Desktop.
Save anonymous/00ca32bdaf08d427f999 to your computer and use it in GitHub Desktop.
diff --git a/base/linalg/lapack.jl b/base/linalg/lapack.jl
index 5a57bfe..81161f8 100644
--- a/base/linalg/lapack.jl
+++ b/base/linalg/lapack.jl
@@ -692,7 +692,7 @@ for (tzrzf, ormrz, elty) in
end
"""
- ormrz!(side, trans, A, tau, C)
+ ormrz!(side, trans, A, tau, C) -> C
Multiplies the matrix `C` by `Q` from the transformation supplied by
`tzrzf!`. Depending on `side` or `trans` the multiplication can be
@@ -838,7 +838,7 @@ end
"""
gels!(trans, A, B) -> (F, B, ssr)
-Solves the linear equation `A * X = B`, `A.' * X =B`, or `A' * X = B` using
+Solves the linear equation `A * X = B`, `A.' * X = B`, or `A' * X = B` using
a QR or LQ factorization. Modifies the matrix/vector `B` in place with the
solution. `A` is overwritten with its `QR` or `LQ` factorization. `trans`
may be one of `N` (no modification), `T` (transpose), or `C` (conjugate
@@ -860,7 +860,7 @@ gesv!(A::StridedMatrix, B::StridedVecOrMat)
"""
getrs!(trans, A, ipiv, B)
-Solves the linear equation `A * X = B`, `A.' * X =B`, or `A' * X = B` for
+Solves the linear equation `A * X = B`, `A.' * X = B`, or `A' * X = B` for
square `A`. Modifies the matrix/vector `B` in place with the solution. `A`
is the `LU` factorization from `getrf!`, with `ipiv` the pivoting
information. `trans` may be one of `N` (no modification), `T` (transpose),
@@ -1013,11 +1013,11 @@ If `fact = F` and `equed = C` or `B` the elements of `C` must all be positive.
Returns the solution `X`; `equed`, which is an output if `fact` is not `N`,
and describes the equilibration that was performed; `R`, the row equilibration
diagonal; `C`, the column equilibration diagonal; `B`, which may be overwritten
-with its equilibrated form `diagm(R)*B` (if `trans = N` and `equed = R,B`) or
-`diagm(C)*B` (if `trans = T,C` and `equed = C,B`); `rcond`, the reciprocal
-condition number of `A` after equilbrating; `ferr`, the forward error bound for
-each solution vector in `X`; `berr`, the forward error bound for each solution
-vector in `X`; and `work`, the reciprocal pivot growth factor.
+with its equilibrated form `diagm(R)*B` (if `trans = N` and `equed = R` or `B`)
+or `diagm(C)*B` (if `trans = T` or `C` and `equed = C` or `B`); `rcond`, the
+reciprocal condition number of `A` after equilibrating; `ferr`, the forward
+error bound for each solution vector in `X`; `berr`, the forward error bound
+for each solution vector in `X`; and `work`, the reciprocal pivot growth factor.
"""
gesvx!(fact::Char, trans::Char, A::StridedMatrix, AF::StridedMatrix,
ipiv::Vector{BlasInt}, equed::Char, R::Vector, C::Vector, B::StridedVecOrMat)
@@ -1288,11 +1288,10 @@ for (gglse, elty) in ((:dgglse_, :Float64),
end
"""
- gglse!(A, c, B, d) -> (X,res)
+ gglse!(A, c, B, d) -> (x, res)
-Solves the equation `A * x = c` where `x` is subject to the equality
-constraint `B * x = d`. Uses the formula `||c - A*x||^2 = 0` to solve.
-Returns `X` and the residual sum-of-squares.
+Solves for `x` which minimizes `||c - A*x||^2` subject to the equality
+constraint `B * x = d`. Returns `x` and the residual sum-of-squares.
"""
gglse!(A::StridedMatrix, c::StridedVector, B::StridedMatrix, d::StridedVector)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment