_filtfilt_gust(b, a, x, axis=-1, irlen=None)
Apply the IIR filter defined by :None:None:`(b,a)` to x twice, first forward then backward, using Gustafsson's initial conditions .
Let y_fb
be the result of filtering first forward and then backward, and let y_bf
be the result of filtering first backward then forward. Gustafsson's method is to compute initial conditions for the forward pass and the backward pass such that y_fb == y_bf
.
Typically the return values :None:None:`x0` and :None:None:`x1` are not needed by the caller. The intended use of these return values is in unit tests.
Numerator coefficients of the filter.
Denominator coefficients of the filter.
Data to be filtered.
Axis of x to be filtered. Default is -1.
The length of the nonnegligible part of the impulse response. If :None:None:`irlen` is None, or if the length of the signal is less than 2 * irlen
, then no part of the impulse response is ignored.
The filtered data.
Initial condition for the forward filter.
Initial condition for the backward filter.
Forward-backward IIR filter that uses Gustafsson's method.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them