potf2.hpp

Go to the documentation of this file.

 
//
// Copyright (c) 2025, University of Colorado Denver. All rights reserved.
//
// This file is part of <T>LAPACK.
// <T>LAPACK is free software: you can redistribute it and/or modify it under
// the terms of the BSD 3-Clause license. See the accompanying LICENSE file.
 
#ifndef TLAPACK_STARPU_POTF2_HH
#define TLAPACK_STARPU_POTF2_HH
 
#include "tlapack/base/types.hpp"
#include "tlapack/lapack/potrf_blocked.hpp"
#include "tlapack/starpu/Matrix.hpp"
#include "tlapack/starpu/tasks.hpp"
 
namespace tlapack {
 
template <class uplo_t, class T>
int potf2(uplo_t uplo, starpu::Matrix<T>& A)
{
    using starpu::idx_t;
 
    // Constants
    const idx_t n = A.nrows();
    const idx_t nx = A.get_nx();
    const idx_t ny = A.get_ny();
 
    // Quick return
    if (nx < 1 || ny < 1 || n < 1) return 0;
 
    // Use blocked algorithm if matrix contains more than one tile
    if (nx > 1 || ny > 1) {
        BlockedCholeskyOpts potrf_opts;
        potrf_opts.nb = min(min(A.nblockrows(), A.nblockcols()), n - 1);
        return potrf_blocked(uplo, A, potrf_opts);
    }
 
    // Insert task to factorize A
    starpu::insert_task_potrf<uplo_t, T>(uplo, A.tile(0, 0));
 
    // Return info
    return 0;
}
 
}  // namespace tlapack
 
#endif  // TLAPACK_POTF2_HH