Member tlapack::GesvdOpts::shapethresh: If either max(m,n)/min(m,n) is larger than shapethresh, a QR factorization is used before
Member tlapack::lasy2 (Op trans_l, Op trans_r, int isign, const matrixT_t &TL, const matrixT_t &TR, const matrixB_t &B, type_t< matrixX_t > &scale, matrixX_t &X, type_t< matrixX_t > &xnorm): Implement for n1=2 and n2=1 or n1=1 and n2=2.
Member tlapack::lauum_recursive (const Uplo &uplo, matrix_t &C): : implement nx to bail out of recursion before 1-by-1 case
Member tlapack::starpu::internal::codelet_init () noexcept: : Check that this is correctly initializing values to 0 and NULL
Member tlapack::trmm_blocked_mixed (side_t side, uplo_t uplo, op_t trans, diag_t diag, const scalar_type< type_t< matrixA_t >, type_t< matrixB_t > > &alpha, const matrixA_t &A, matrixB_t &B, work_t &work, const TrmmBlockedOpts &opts={}): Implement the algorithm for the remaining cases. See what is missing below.
Member tlapack::trtri_recursive (uplo_t uplo, Diag diag, matrix_t &C, const EcOpts &opts={}): : implement nx to bail out of recursion before 1-by-1 case