Bini D. Relations between exact and approximate bilinear algorithms applications. In: Calcolo, vol. 17 (1) pp. 87 - 97. Giardini, 1980. |

Abstract (English) |
Thc relation between APA-algorithms (i.e. approximating the result with small error) and EC-algorithms (i.e. computing exactly the result) is The existence of an APA-algorithm of complexity t_0 and degree d implies the existence of an EC-algorithm of complexity (1 +d) t_0. An application is given for problems associated to sensorial powers of a tensor, such as matrix product. | |

Subject |

1) Download Document PDF |

Open access Restricted Private