# LDLt factorization for full matrices

**URL:** <https://discourse.julialang.org/t/ldlt-factorization-for-full-matrices/75356>\
**Category:** Numerics\
**Tags:** question, linearalgebra\
**Created:** [January 28, 2022, 12:09pm UTC](https://discourse.julialang.org/t/ldlt-factorization-for-full-matrices/75356 "2022-01-28T12:09:26Z")\
**Posts on this page:** 1\
**Showing post:** 16

<div class="post-metadata">

**Author:** ![zdenek\_hurak](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/zdenek_hurak/32/53118_2.png) [@zdenek\_hurak](https://discourse.julialang.org/u/zdenek_hurak)\
**Post date:** [May 16, 2022, 10:48pm UTC](https://discourse.julialang.org/t/ldlt-factorization-for-full-matrices/75356/16 "2022-05-16T22:48:50Z")

</div>

> [@Shouldn't \`bunchkaufman\` be actually named \`ldlt\`?](https://discourse.julialang.org/t/shouldnt-bunchkaufman-be-actually-named-ldlt/77641):
>
> I am just musing over the choise of the name bunchkaufman for the [bunkaufman](https://docs.julialang.org/en/v1/stdlib/LinearAlgebra/#LinearAlgebra.bunchkaufman) function. If I understand it correctly, the function provides an implementation of an algorithm for LDLᵀ factorization of a symmetric and in general indefinite matrix. The thing is that there is a dedicated function for performing the LDLᵀ factorization – it is named [ldlt](https://docs.julialang.org/en/v1/stdlib/LinearAlgebra/#LinearAlgebra.ldlt). It seems to me that the only difference is that ldlt function works for either dense tridiagonal or sparse matrices, while bunchkaufman works for den…

---

_[View the full topic](https://discourse.julialang.org/t/ldlt-factorization-for-full-matrices/75356)._