sum_operator.py 5 KB
Newer Older
Martin Reinecke's avatar
Martin Reinecke committed
1 2 3 4 5 6 7 8 9 10 11 12 13
# 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.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program.  If not, see <http://www.gnu.org/licenses/>.
#
14
# Copyright(C) 2013-2018 Max-Planck-Society
Martin Reinecke's avatar
Martin Reinecke committed
15 16 17 18 19 20 21 22
#
# NIFTy is being developed at the Max-Planck-Institut fuer Astrophysik
# and financially supported by the Studienstiftung des deutschen Volkes.

from .linear_operator import LinearOperator


class SumOperator(LinearOperator):
23 24 25
    def __init__(self, ops, neg, _callingfrommake=False):
        if not _callingfrommake:
            raise NotImplementedError
Martin Reinecke's avatar
Martin Reinecke committed
26
        super(SumOperator, self).__init__()
27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
        self._ops = ops
        self._neg = neg
        self._capability = self.TIMES | self.ADJOINT_TIMES
        for op in ops:
            self._capability &= op.capability

    @staticmethod
    def simplify(ops, neg):
        from .scaling_operator import ScalingOperator
        from .diagonal_operator import DiagonalOperator
        # Step 1: verify domains
        for op in ops[1:]:
            if op.domain != ops[0].domain or op.target != ops[0].target:
                raise ValueError("domain mismatch")
        # Step 2: unpack SumOperators
        opsnew = []
        negnew = []
44
        for op, ng in zip(ops, neg):
45 46 47
            if isinstance(op, SumOperator):
                opsnew += op._ops
                if ng:
Martin Reinecke's avatar
fixes  
Martin Reinecke committed
48
                    negnew += [not n for n in op._neg]
49
                else:
Martin Reinecke's avatar
fixes  
Martin Reinecke committed
50
                    negnew += list(op._neg)
51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79
            else:
                opsnew.append(op)
                negnew.append(ng)
        ops = opsnew
        neg = negnew
        # Step 3: collect ScalingOperators
        sum = 0.
        opsnew = []
        negnew = []
        lastdom = ops[-1].domain
        for op, ng in zip(ops, neg):
            if isinstance(op, ScalingOperator):
                sum += op._factor * (-1 if ng else 1)
            else:
                opsnew.append(op)
                negnew.append(ng)
        if sum != 0.:
            # try to absorb the factor into a DiagonalOperator
            for i in range(len(opsnew)):
                if isinstance(opsnew[i], DiagonalOperator):
                    sum *= (-1 if negnew[i] else 1)
                    opsnew[i] = DiagonalOperator(opsnew[i].diagonal()+sum,
                                                 domain=opsnew[i].domain,
                                                 spaces=opsnew[i]._spaces)
                    sum = 0.
                    break
        if sum != 0:
            # have to add the scaling operator at the end
            opsnew.append(ScalingOperator(sum, lastdom))
80
            negnew.append(False)
81 82 83
        ops = opsnew
        neg = negnew
        # Step 4: combine DiagonalOperators where possible
84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103
        processed = [False] * len(ops)
        opsnew = []
        negnew = []
        for i in range(len(ops)):
            if not processed[i]:
                if isinstance(ops[i], DiagonalOperator):
                    diag = ops[i].diagonal()*(-1 if neg[i] else 1)
                    for j in range(i+1, len(ops)):
                        if (isinstance(ops[j], DiagonalOperator) and
                                ops[i]._spaces == ops[j]._spaces):
                            diag += ops[j].diagonal()*(-1 if neg[j] else 1)
                            processed[j] = True
                    opsnew.append(DiagonalOperator(diag, ops[i].domain,
                                                   ops[i]._spaces))
                    negnew.append(False)
                else:
                    opsnew.append(ops[i])
                    negnew.append(neg[i])
        ops = opsnew
        neg = negnew
104 105 106 107 108 109
        return ops, neg

    @staticmethod
    def make(ops, neg):
        ops = tuple(ops)
        neg = tuple(neg)
110
        if len(ops) != len(neg):
111 112 113 114 115
            raise ValueError("length mismatch between ops and neg")
        ops, neg = SumOperator.simplify(ops, neg)
        if len(ops) == 1 and not neg[0]:
            return ops[0]
        return SumOperator(ops, neg, _callingfrommake=True)
Martin Reinecke's avatar
Martin Reinecke committed
116 117 118

    @property
    def domain(self):
Martin Reinecke's avatar
Martin Reinecke committed
119
        return self._ops[0].domain
Martin Reinecke's avatar
Martin Reinecke committed
120 121 122

    @property
    def target(self):
Martin Reinecke's avatar
Martin Reinecke committed
123
        return self._ops[0].target
Martin Reinecke's avatar
Martin Reinecke committed
124 125 126

    @property
    def capability(self):
Martin Reinecke's avatar
Martin Reinecke committed
127
        return self._capability
Martin Reinecke's avatar
Martin Reinecke committed
128 129 130

    def apply(self, x, mode):
        self._check_mode(mode)
Martin Reinecke's avatar
Martin Reinecke committed
131 132 133 134 135 136 137 138 139
        for i, op in enumerate(self._ops):
            if i == 0:
                res = -op.apply(x, mode) if self._neg[i] else op.apply(x, mode)
            else:
                if self._neg[i]:
                    res -= op.apply(x, mode)
                else:
                    res += op.apply(x, mode)
        return res