TRIQS/nda 1.3.0
Multi-dimensional array library for C++
Loading...
Searching...
No Matches
norm.hpp
Go to the documentation of this file.
1// Copyright (c) 2023-2024 Simons Foundation
2//
3// Licensed under the Apache License, Version 2.0 (the "License");
4// you may not use this file except in compliance with the License.
5// You may obtain a copy of the License at
6//
7// http://www.apache.org/licenses/LICENSE-2.0.txt
8//
9// Unless required by applicable law or agreed to in writing, software
10// distributed under the License is distributed on an "AS IS" BASIS,
11// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12// See the License for the specific language governing permissions and
13// limitations under the License.
14//
15// Authors: Thomas Hahn, Nils Wentzell
16
17#pragma once
18
24#pragma once
25
26#include "../algorithms.hpp"
28#include "../blas/dot.hpp"
29#include "../concepts.hpp"
31#include "../traits.hpp"
32
33#include <cmath>
34#include <complex>
35#include <limits>
36
37namespace nda {
38
57 template <ArrayOfRank<1> A>
58 double norm(A const &a, double p = 2.0) {
59 static_assert(Scalar<get_value_t<A>>, "Error in nda::norm: Only scalar value types are allowed");
60
61 if (p == 2.0) [[likely]] {
62 if constexpr (MemoryArray<A>)
63 return std::sqrt(std::real(nda::blas::dotc(a, a)));
64 else
65 return norm(make_regular(a));
66 } else if (p == 1.0) {
67 return sum(abs(a));
68 } else if (p == 0.0) {
69 long count = 0;
70 for (long i = 0; i < a.size(); ++i) {
71 if (a(i) != get_value_t<A>{0}) ++count;
72 }
73 return double(count);
74 } else if (p == std::numeric_limits<double>::infinity()) {
75 return max_element(abs(a));
76 } else if (p == -std::numeric_limits<double>::infinity()) {
77 return min_element(abs(a));
78 } else {
79 return std::pow(sum(pow(abs(a), p)), 1.0 / p);
80 }
81 }
82
83} // namespace nda
Provides various algorithms to be used with nda::Array objects.
Provides basic functions to create and manipulate arrays and views.
Provides a generic interface to the BLAS dot routine.
Check if a given type satisfies the memory array concept.
Definition concepts.hpp:248
Check if a given type is either an arithmetic or complex type.
Definition concepts.hpp:119
Provides concepts for the nda library.
auto max_element(A const &a)
Find the maximum element of an array.
auto sum(A const &a)
Sum all the elements of an nda::Array object.
auto min_element(A const &a)
Find the minimum element of an array.
decltype(auto) make_regular(A &&a)
Make a given object regular.
auto abs(A &&a)
Function abs for nda::ArrayOrScalar types (lazy and coefficient-wise for nda::Array types).
auto pow(A &&a, double p)
Function pow for nda::ArrayOrScalar types (lazy and coefficient-wise for nda::Array types).
std::decay_t< decltype(get_first_element(std::declval< A const >()))> get_value_t
Get the value type of an array/view or a scalar type.
Definition traits.hpp:192
auto dotc(X const &x, Y const &y)
Interface to the BLAS dotc routine.
Definition dot.hpp:103
double norm(A const &a, double p=2.0)
Calculate the p-norm of an nda::ArrayOfRank<1> object with scalar values. The p-norm is defined as.
Definition norm.hpp:58
Provides lazy, coefficient-wise array operations of standard mathematical functions together with ove...
Provides type traits for the nda library.