iteration julia> l == S.L && q == S.Q true LinearAlgebra.bunchkaufman – Func�on. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 3 factoriza�on of a Symmetric the components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivo�ng is used. If rook is false, rook pivo�ng is not used. When check = true, an error is thrown if the decomposi�on julia> d == S.D && u == S.U && p == S.p true LinearAlgebra.bunchkaufman! – Func�on. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

iteration julia> l == S.L && q == S.Q true LinearAlgebra.bunchkaufman – Func�on. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 3 factoriza�on of a Symmetric the components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivo�ng is used. If rook is false, rook pivo�ng is not used. When check = true, an error is thrown if the decomposi�on julia> d == S.D && u == S.U && p == S.p true LinearAlgebra.bunchkaufman! – Func�on. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

iteration julia> l == S.L && q == S.Q true LinearAlgebra.bunchkaufman – Func�on. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 3 factoriza�on of a Symmetric the components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivo�ng is used. If rook is false, rook pivo�ng is not used. When check = true, an error is thrown if the decomposi�on julia> d == S.D && u == S.U && p == S.p true LinearAlgebra.bunchkaufman! – Func�on. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

iteration julia> l == S.L && q == S.Q true LinearAlgebra.bunchkaufman – Func�on. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 3 factoriza�on of a Symmetric the components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivo�ng is used. If rook is false, rook pivo�ng is not used. When check = true, an error is thrown if the decomposi�on julia> d == S.D && u == S.U && p == S.p true LinearAlgebra.bunchkaufman! – Func�on. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

permutation: 2-element Array{Int64,1}: 2 1 LinearAlgebra.bunchkaufman – Function. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 3 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 permutation: 2-element Array{Int64,1}: 2 1 LinearAlgebra.bunchkaufman! – Function. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

permutation: 2-element Array{Int64,1}: 2 1 LinearAlgebra.bunchkaufman – Func�on. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 3 factoriza�on of a symmetric the components S.D, S.U or S.L as appropriate given S.uplo, and S.p. If rook is true, rook pivo�ng is used. If rook is false, rook pivo�ng is not used. When check = true, an error is thrown if the decomposi�on permutation: 2-element Array{Int64,1}: 2 1 LinearAlgebra.bunchkaufman! – Func�on. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space

permutation: 2-element Array{Int64,1}: 2 1 LinearAlgebra.bunchkaufman – Function. bunchkaufman(A, rook::Bool=false; check = true) -> S::BunchKaufman Compute the Bunch-Kaufman 3 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 permutation: 2-element Array{Int64,1}: 2 1 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 3 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 permutation: 2-element Vector{Int64}: 2 1 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 3 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 permutation: 2-element Vector{Int64}: 2 1 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 3 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 permutation: 2-element Vector{Int64}: 2 1 LinearAlgebra.bunchkaufman! – Function. bunchkaufman!(A, rook::Bool=false; check = true) -> BunchKaufman bunchkaufman! is the same as bunchkaufman, but saves space