Skip to content

Upper bound to error propagator #51

@ffreyer

Description

@ffreyer

Saving the full covariance matrix can be expensive, as it uses O(N^2) memory (where N is the number of inputs). A way to get around this would be to use an upper/lower limit for the covariance matrix.

Cauchy Schwarz tells us that |<u, v>|^2 <= <u><v>, i.e.

-var(x)var(y) <= cov(x, y)^2 <= var(x)var(y)

(see also Pearsons correlation coefficient) With the variance of f given by sum_ij df/dx_i df/x_j cov(x_i, x_j) we can calculate an upper limit:

var(f) <= sum_ij | df/dx_i df/dx_j sqrt(var(x_i) var (x_j)) |

This only requires O(N) memory, where N is the number of arguments.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions