کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4605340 | 1337564 | 2012 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A fast algorithm for multilinear operators
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
آنالیز ریاضی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied and Computational Harmonic Analysis - Volume 33, Issue 1, July 2012, Pages 148-158
Journal: Applied and Computational Harmonic Analysis - Volume 33, Issue 1, July 2012, Pages 148-158