Answers are grounded in this paper and cite their sources.
A set of bilinear forms can be evaluated with a multiplicative complexity lower than the rank of the associated tensor by allowing an arbitrarily small error. A topological interpretation of this fact is presented together with the error analysis. A complexity measure is introduced which takes into account the numerical stability of algorithms. Relations are established between the complexities of exact and approximate algorithms.
No takes yet. Share an insight, caveat, or question.
Bini et al. (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: