permutation: 2-element Vector{Int64}: 2 1 LinearAlgebra.bunchkaufman – Function. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 7 factorization of a symmetric components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivoting is used. If rook is false, rook pivoting is not used. When check = true, an error is thrown if the decomposition 2×2 Matrix{Float64}: 0.0 0.0 0.0 0.0 LinearAlgebra.bunchkaufman! – Function. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

permutation: 2-element Vector{Int64}: 2 1 LinearAlgebra.bunchkaufman – Function. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 7 factorization of a symmetric components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivoting is used. If rook is false, rook pivoting is not used. When check = true, an error is thrown if the decomposition 2×2 Matrix{Float64}: 0.0 0.0 0.0 0.0 LinearAlgebra.bunchkaufman! – Function. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

permutation: 2-element Vector{Int64}: 2 1 LinearAlgebra.bunchkaufman – Function. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 7 factorization of a symmetric components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivoting is used. If rook is false, rook pivoting is not used. When check = true, an error is thrown if the decomposition 2×2 Matrix{Float64}: 0.0 0.0 0.0 0.0 LinearAlgebra.bunchkaufman! – Function. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

permutation: 2-element Vector{Int64}: 2 1 LinearAlgebra.bunchkaufman – Function. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 7 factorization of a symmetric components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivoting is used. If rook is false, rook pivoting is not used. When check = true, an error is thrown if the decomposition 2×2 Matrix{Float64}: 0.0 0.0 0.0 0.0 LinearAlgebra.bunchkaufman! – Function. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

permutation: 2-element Vector{Int64}: 2 1 LinearAlgebra.bunchkaufman – Function. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 7 factorization of a symmetric components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivoting is used. If rook is false, rook pivoting is not used. When check = true, an error is thrown if the decomposition 2×2 Matrix{Float64}: 0.0 0.0 0.0 0.0 LinearAlgebra.bunchkaufman! – Function. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

permutation: 2-element Vector{Int64}: 2 1 LinearAlgebra.bunchkaufman – Function. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 7 factorization of a symmetric components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivoting is used. If rook is false, rook pivoting is not used. When check = true, an error is thrown if the decomposition julia> S.L * S.D * S.L' ≈ A[S.p, S.p] true LinearAlgebra.bunchkaufman! – Function. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

permutation: 2-element Vector{Int64}: 2 1 LinearAlgebra.bunchkaufman – Function. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 7 factorization of a symmetric components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivoting is used. If rook is false, rook pivoting is not used. When check = true, an error is thrown if the decomposition 2×2 Matrix{Float64}: 0.0 0.0 0.0 0.0 LinearAlgebra.bunchkaufman! – Function. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

permutation: 2-element Vector{Int64}: 2 1 LinearAlgebra.bunchkaufman – Function. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 7 factorization of a symmetric components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivoting is used. If rook is false, rook pivoting is not used. When check = true, an error is thrown if the decomposition 2×2 Matrix{Float64}: 0.0 0.0 0.0 0.0 LinearAlgebra.bunchkaufman! – Function. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

permutation: 2-element Vector{Int64}: 2 1 LinearAlgebra.bunchkaufman – Function. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 7 factorization of a symmetric components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivoting is used. If rook is false, rook pivoting is not used. When check = true, an error is thrown if the decomposition 2×2 Matrix{Float64}: 0.0 0.0 0.0 0.0 LinearAlgebra.bunchkaufman! – Function. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

permutation: 2-element Vector{Int64}: 2 1 LinearAlgebra.bunchkaufman – Function. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 7 factorization of a symmetric components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivoting is used. If rook is false, rook pivoting is not used. When check = true, an error is thrown if the decomposition 2×2 Matrix{Float64}: 0.0 0.0 0.0 0.0 LinearAlgebra.bunchkaufman! – Function. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space