@@ -1506,8 +1506,8 @@ end
1506
1506
1507
1507
Compute the Cholesky (``LL'``) factorization of `A`, reusing the symbolic
1508
1508
factorization `F`. `A` must be a [`SparseMatrixCSC`](@ref) or a [`Symmetric`](@ref)/
1509
- [`Hermitian`](@ref) view of a `SparseMatrixCSC`. Note that even if `A` doesn't
1510
- have the type tag, it must still be symmetric or Hermitian.
1509
+ [`Hermitian`](@ref) view of a `SparseMatrixCSC`. Note that if `A` doesn't
1510
+ have the type tag, it must itself be symmetric or Hermitian.
1511
1511
1512
1512
See also [`cholesky`](@ref).
1513
1513
@@ -1542,8 +1542,8 @@ end
1542
1542
1543
1543
Compute the Cholesky factorization of a sparse positive definite matrix `A`.
1544
1544
`A` must be a [`SparseMatrixCSC`](@ref) or a [`Symmetric`](@ref)/[`Hermitian`](@ref)
1545
- view of a `SparseMatrixCSC`. Note that even if `A` doesn't
1546
- have the type tag, it must still be symmetric or Hermitian.
1545
+ view of a `SparseMatrixCSC`. Note that if `A` doesn't
1546
+ have the type tag, it must itself be symmetric or Hermitian.
1547
1547
If `perm` is not given, a fill-reducing permutation is used.
1548
1548
`F = cholesky(A)` is most frequently used to solve systems of equations with `F\\ b`,
1549
1549
but also the methods [`diag`](@ref), [`det`](@ref), and
@@ -1676,8 +1676,8 @@ end
1676
1676
1677
1677
Compute the ``LDL'`` factorization of `A`, reusing the symbolic factorization `F`.
1678
1678
`A` must be a [`SparseMatrixCSC`](@ref) or a [`Symmetric`](@ref)/[`Hermitian`](@ref)
1679
- view of a `SparseMatrixCSC`. Note that even if `A` doesn't
1680
- have the type tag, it must still be symmetric or Hermitian.
1679
+ view of a `SparseMatrixCSC`. Note that if `A` doesn't
1680
+ have the type tag, it must itself be symmetric or Hermitian.
1681
1681
1682
1682
See also [`ldlt`](@ref).
1683
1683
@@ -1718,8 +1718,8 @@ end
1718
1718
1719
1719
Compute the ``LDL'`` factorization of a sparse matrix `A`.
1720
1720
`A` must be a [`SparseMatrixCSC`](@ref) or a [`Symmetric`](@ref)/[`Hermitian`](@ref)
1721
- view of a `SparseMatrixCSC`. Note that even if `A` doesn't
1722
- have the type tag, it must still be symmetric or Hermitian.
1721
+ view of a `SparseMatrixCSC`. Note that if `A` doesn't
1722
+ have the type tag, it must itself be symmetric or Hermitian.
1723
1723
A fill-reducing permutation is used. `F = ldlt(A)` is most frequently
1724
1724
used to solve systems of equations `A*x = b` with `F\\ b`. The returned
1725
1725
factorization object `F` also supports the methods [`diag`](@ref),
0 commit comments