A fast algorithm for multilinear operators

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

This paper introduces a fast algorithm for computing multilinear integrals which are defined through Fourier multipliers. The algorithm is based on generating a hierarchical decomposition of the summation domain into squares, constructing a low-rank approximation for the multiplier function within each square, and applying an FFT based fast convolution algorithm for the computation associated with each square. The resulting algorithm is accurate and has a linear complexity, up to logarithmic factors, with respect to the number of the unknowns in the input functions. Numerical results are presented to demonstrate the properties of this algorithm. © 2012 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Yang, H., & Ying, L. (2012). A fast algorithm for multilinear operators. Applied and Computational Harmonic Analysis. Academic Press Inc. https://doi.org/10.1016/j.acha.2012.03.010

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free