krylov_sampling.py 2.86 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
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
80
81
82
# 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/>.
#
# Copyright(C) 2013-2018 Max-Planck-Society
#
# NIFTy is being developed at the Max-Planck-Institut fuer Astrophysik
# and financially supported by the Studienstiftung des deutschen Volkes.

from  numpy.random import randn
from numpy import sqrt
from ..field import Field


def generate_krylov_samples(D_inv, S, j=None,  N_samps=1, N_iter=10):
    """
    Generates inverse samples from a curvature D
    This algorithm iteratively generates samples from
    a curvature D by applying conjugate gradient steps
    and resampling the curvature in search direction.

    Parameters
    ----------
    D_inv : EndomorphicOperator
        The curvature which will be the inverse of the covarianc
        of the generated samples
    S : EndomorphicOperator (from which one can sample)
        A prior covariance operator which is used to generate prior
        samples that are then iteratively updated
    j : Field, optional
        A Field to which the inverse of D_inv is applied. The solution
        of this matrix inversion problem is a side product of generating
        the samples.
        If not supplied, it is sampled from the prior.
    N_samps : Int, optional
        How many samples to generate. Default: 1
    N_iter : Int, optional
        How many iterations of the conjugate gradient to run. Default: 10

    Returns
    -------
    (solution, samples) : A tuple of a field 'solution' and a list of fields
        'samples'. The first entry of the tuple is the solution x to
            D_inv(x) = j 
        and the second entry are a list of samples from D_inv.inverse
    """
    if j == None:
        j = S.draw_sample()
    space = D_inv.domain
    x = Field.zeros(space)
    r = j.copy()
    p = r.copy()
    d = p.vdot(D_inv(p))
    y = []
    for i in range(N_samps):
        y += [S.draw_sample()]
    for k in range(1, 1 + N_iter):
        gamma = r.vdot(r) / d
        if gamma == 0.:
            break
        x += gamma * p
        for i in range(N_samps):
            y[i] -= p.vdot(D_inv(y[i])) * p / d
            y[i] += randn() / sqrt(d) * p
        r_new = r - gamma * D_inv(p)
        beta = r_new.vdot(r_new) / (r.vdot(r))
        r = r_new
        p = r + beta * p
        d = p.vdot(D_inv(p))
        if d == 0.:
            break
    return x, y