Elsevier

Journal of Complexity

Volume 6, Issue 4, December 1990, Pages 389-408
Journal of Complexity

Regular article
Complexity of multilinear problems in the worst case setting

https://doi.org/10.1016/0885-064X(90)90030-HGet rights and content
Under a Creative Commons license
open archive

Abstract

This is the first of two papers on multilinear problems, and it is devoted to the worst case setting. A second paper will analyze the average case setting. We show how to reduce the analysis of multilinear problems to linear subproblems. In particular, it is proven that adaption can help by a factor of at most k and k-linear problems. The error of multilinear algorithms is analyzed and optimality properties of spline algorithms for the Hilbert case are established. We illustrate our analysis with an example of a multilinear problem from signal processing.

Cited by (0)