rg_space.py 6.73 KB
Newer Older
1
2
3
4
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
5
#
6
7
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
8
9
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU General Public License for more details.
#
11
# You should have received a copy of the GNU General Public License
12
# along with this program.  If not, see <http://www.gnu.org/licenses/>.
Theo Steininger's avatar
Theo Steininger committed
13
14
15
16
17
#
# Copyright(C) 2013-2017 Max-Planck-Society
#
# NIFTy is being developed at the Max-Planck-Institut fuer Astrophysik
# and financially supported by the Studienstiftung des deutschen Volkes.
Marco Selig's avatar
Marco Selig committed
18
19

from __future__ import division
Martin Reinecke's avatar
Martin Reinecke committed
20
from builtins import range
Martin Reinecke's avatar
Martin Reinecke committed
21
from functools import reduce
Marco Selig's avatar
Marco Selig committed
22
import numpy as np
Martin Reinecke's avatar
Martin Reinecke committed
23
from .space import Space
24
25
from .. import Field
from ..basic_arithmetics import exp
Martin Reinecke's avatar
Martin Reinecke committed
26
from .. import dobj
csongor's avatar
csongor committed
27

Marco Selig's avatar
Marco Selig committed
28

Theo Steininger's avatar
Theo Steininger committed
29
class RGSpace(Space):
Martin Reinecke's avatar
Martin Reinecke committed
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
    """NIFTY subclass for spaces of regular Cartesian grids.

    Parameters
    ----------
    shape : {int, numpy.ndarray}
        Number of grid points or numbers of gridpoints along each axis.
    distances : {float, numpy.ndarray}, *optional*
        Distance between two grid points along each axis
        (default: None).
        If distances==None:
            if harmonic==True, all distances will be set to 1
            if harmonic==False, the distance along each axis will be
              set to the inverse of the number of points along that
              axis.
    harmonic : bool, *optional*
    Whether the space represents a grid in position or harmonic space.
        (default: False).
Marco Selig's avatar
Marco Selig committed
47
    """
48

Martin Reinecke's avatar
Martin Reinecke committed
49
    def __init__(self, shape, distances=None, harmonic=False):
Martin Reinecke's avatar
Martin Reinecke committed
50
        super(RGSpace, self).__init__()
51
        self._needed_for_hash += ["_distances", "_shape", "_harmonic"]
52

Martin Reinecke's avatar
Martin Reinecke committed
53
        self._harmonic = bool(harmonic)
Martin Reinecke's avatar
Martin Reinecke committed
54
55
56
        if np.isscalar(shape):
            shape = (shape,)
        self._shape = tuple(int(i) for i in shape)
57
        self._distances = self._parse_distances(distances)
58
        self._dvol = float(reduce(lambda x, y: x*y, self._distances))
Martin Reinecke's avatar
Martin Reinecke committed
59
        self._dim = int(reduce(lambda x, y: x*y, self._shape))
Marco Selig's avatar
Marco Selig committed
60

61
    def __repr__(self):
Martin Reinecke's avatar
Martin Reinecke committed
62
63
        return ("RGSpace(shape=%r, distances=%r, harmonic=%r)"
                % (self.shape, self.distances, self.harmonic))
64

65
66
67
68
69
70
71
72
73
74
    @property
    def harmonic(self):
        return self._harmonic

    @property
    def shape(self):
        return self._shape

    @property
    def dim(self):
Martin Reinecke's avatar
Martin Reinecke committed
75
        return self._dim
76

77
78
    def scalar_dvol(self):
        return self._dvol
79

80
    def get_k_length_array(self):
Martin Reinecke's avatar
PEP8    
Martin Reinecke committed
81
82
        if (not self.harmonic):
            raise NotImplementedError
Martin Reinecke's avatar
Martin Reinecke committed
83
        out = Field((self,), dtype=np.float64)
Martin Reinecke's avatar
Martin Reinecke committed
84
85
86
        oloc = dobj.local_data(out.val)
        ibegin = dobj.ibegin(out.val)
        res = np.arange(oloc.shape[0], dtype=np.float64) + ibegin[0]
Martin Reinecke's avatar
Martin Reinecke committed
87
88
        res = np.minimum(res, self.shape[0]-res)*self.distances[0]
        if len(self.shape) == 1:
Martin Reinecke's avatar
Martin Reinecke committed
89
90
            oloc[()] = res
            return out
Martin Reinecke's avatar
Martin Reinecke committed
91
92
        res *= res
        for i in range(1, len(self.shape)):
Martin Reinecke's avatar
Martin Reinecke committed
93
            tmp = np.arange(oloc.shape[i], dtype=np.float64) + ibegin[i]
Martin Reinecke's avatar
Martin Reinecke committed
94
95
96
            tmp = np.minimum(tmp, self.shape[i]-tmp)*self.distances[i]
            tmp *= tmp
            res = np.add.outer(res, tmp)
Martin Reinecke's avatar
Martin Reinecke committed
97
98
        oloc[()] = np.sqrt(res)
        return out
theos's avatar
theos committed
99

100
    def get_unique_k_lengths(self):
Martin Reinecke's avatar
PEP8    
Martin Reinecke committed
101
102
        if (not self.harmonic):
            raise NotImplementedError
Martin Reinecke's avatar
Martin Reinecke committed
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
        dimensions = len(self.shape)
        if dimensions == 1:  # extra easy
            maxdist = self.shape[0]//2
            return np.arange(maxdist+1, dtype=np.float64) * self.distances[0]
        if np.all(self.distances == self.distances[0]):  # shortcut
            maxdist = np.asarray(self.shape)//2
            tmp = np.sum(maxdist*maxdist)
            tmp = np.zeros(tmp+1, dtype=np.bool)
            t2 = np.arange(maxdist[0]+1, dtype=np.int64)
            t2 *= t2
            for i in range(1, dimensions):
                t3 = np.arange(maxdist[i]+1, dtype=np.int64)
                t3 *= t3
                t2 = np.add.outer(t2, t3)
            tmp[t2] = True
            return np.sqrt(np.nonzero(tmp)[0])*self.distances[0]
        else:  # do it the hard way
Martin Reinecke's avatar
tweaks    
Martin Reinecke committed
120
            # FIXME: this needs to improve for MPI. Maybe unique()/gather()?
Martin Reinecke's avatar
Martin Reinecke committed
121
122
            tmp = dobj.to_global_data(self.get_k_length_array().val)
            tmp = np.unique(tmp)
Martin Reinecke's avatar
Martin Reinecke committed
123
124
125
126
127
128
129
            tol = 1e-12*tmp[-1]
            # remove all points that are closer than tol to their right
            # neighbors.
            # I'm appending the last value*2 to the array to treat the
            # rightmost point correctly.
            return tmp[np.diff(np.r_[tmp, 2*tmp[-1]]) > tol]

Martin Reinecke's avatar
Martin Reinecke committed
130
131
132
133
    @staticmethod
    def _kernel(x, sigma):
        tmp = x*x
        tmp *= -2.*np.pi*np.pi*sigma*sigma
134
        exp(tmp, out=tmp)
Martin Reinecke's avatar
Martin Reinecke committed
135
136
        return tmp

137
    def get_fft_smoothing_kernel_function(self, sigma):
Martin Reinecke's avatar
PEP8    
Martin Reinecke committed
138
139
        if (not self.harmonic):
            raise NotImplementedError
Martin Reinecke's avatar
Martin Reinecke committed
140
        return lambda x: self._kernel(x, sigma)
theos's avatar
theos committed
141

Martin Reinecke's avatar
Martin Reinecke committed
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
    def get_default_codomain(self):
        distances = 1. / (np.array(self.shape)*np.array(self.distances))
        return RGSpace(self.shape, distances, not self.harmonic)

    def check_codomain(self, codomain):
        if not isinstance(codomain, RGSpace):
            raise TypeError("domain is not a RGSpace")

        if self.shape != codomain.shape:
            raise AttributeError("The shapes of domain and codomain must be "
                                 "identical.")

        if self.harmonic == codomain.harmonic:
            raise AttributeError("domain.harmonic and codomain.harmonic must "
                                 "not be the same.")

        # Check if the distances match, i.e. dist' = 1 / (num * dist)
        if not np.all(
            np.absolute(np.array(self.shape) *
                        np.array(self.distances) *
Martin Reinecke's avatar
Martin Reinecke committed
162
                        np.array(codomain.distances)-1) < 1e-7):
Martin Reinecke's avatar
Martin Reinecke committed
163
164
165
            raise AttributeError("The grid-distances of domain and codomain "
                                 "do not match.")

166
167
    @property
    def distances(self):
Martin Reinecke's avatar
Martin Reinecke committed
168
        """Distance between grid points along each axis. It is a tuple
Theo Steininger's avatar
Theo Steininger committed
169
        of positive floating point numbers with the n-th entry giving the
Martin Reinecke's avatar
Martin Reinecke committed
170
        distance between neighboring grid points along the n-th dimension.
171
        """
172
173
174
175
176
        return self._distances

    def _parse_distances(self, distances):
        if distances is None:
            if self.harmonic:
Martin Reinecke's avatar
Martin Reinecke committed
177
                temp = np.ones_like(self.shape, dtype=np.float64)
178
            else:
Martin Reinecke's avatar
Martin Reinecke committed
179
                temp = 1./np.array(self.shape, dtype=np.float64)
180
        else:
Martin Reinecke's avatar
Martin Reinecke committed
181
            temp = np.empty(len(self.shape), dtype=np.float64)
182
183
            temp[:] = distances
        return tuple(temp)