Choose the best answer from the followings.

Group of answer choices

The LU decomposition of an

matrix cost

arithmetic complexity.

The LU decomposition with partial pivoting leads to a numerically unstable algorithm.

When a given matrix is symmetric, then it can be factored into

$,$ where

$.$

If the given matrix is an

discrete Fourier transform $($DFT$)$ matrix, we could use the divide and conquer technique to factor the DFT matrix into a product of sparse matrices with

complexity.