norm.hpp

Go to the documentation of this file.

// Copyright (c) 2023--present, The Simons Foundation
// This file is part of TRIQS/nda and is licensed under the Apache License, Version 2.0.
// SPDX-License-Identifier: Apache-2.0
// See LICENSE in the root of this distribution for details.
 
#pragma once

 
#pragma once
 
#include "../algorithms.hpp"
#include "../basic_functions.hpp"
#include "../blas/dot.hpp"
#include "../concepts.hpp"
#include "../mapped_functions.hxx"
#include "../traits.hpp"
 
#include <cmath>
#include <complex>
#include <limits>
 
namespace nda {

  template <ArrayOfRank<1> A>
  double norm(A const &a, double p = 2.0) {
    static_assert(Scalar<get_value_t<A>>, "Error in nda::norm: Only scalar value types are allowed");
 
    if (p == 2.0) [[likely]] {
      if constexpr (MemoryArray<A>)
        return std::sqrt(std::real(nda::blas::dotc(a, a)));
      else
        return norm(make_regular(a));
    } else if (p == 1.0) {
      return sum(abs(a));
    } else if (p == 0.0) {
      long count = 0;
      for (long i = 0; i < a.size(); ++i) {
        if (a(i) != get_value_t<A>{0}) ++count;
      }
      return double(count);
    } else if (p == std::numeric_limits<double>::infinity()) {
      return max_element(abs(a));
    } else if (p == -std::numeric_limits<double>::infinity()) {
      return min_element(abs(a));
    } else {
      return std::pow(sum(pow(abs(a), p)), 1.0 / p);
    }
  }
 
} // namespace nda