_onenormest_core(A, AT, t, itmax)
This is algorithm 2.4.
A linear operator that can produce matrix products.
The transpose of A.
A positive parameter controlling the tradeoff between accuracy versus time and memory usage.
Use at most this many iterations.
An underestimate of the 1-norm of the sparse matrix.
The vector such that ||Av||_1 == est*||v||_1. It can be thought of as an input to the linear operator that gives an output with particularly large norm.
The vector Av which has relatively large 1-norm. It can be thought of as an output of the linear operator that is relatively large in norm compared to the input.
The number of matrix products that were computed.
The number of times a parallel column was observed, necessitating a re-randomization of the column.
Compute a lower bound of the 1-norm of a sparse matrix.
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