کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1702847 | 1519398 | 2016 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Laguerre-Galerkin methods with reduced sum-products
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مکانیک محاسباتی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Laguerre-Galerkin methods with reduced sum-products Laguerre-Galerkin methods with reduced sum-products](/preview/png/1702847.png)
چکیده انگلیسی
The always stable solution of time-domain integral equations by plain implementation of the classical marching-on-in-degree (MOD) methods demands O(M2N3) operations, where M and N are, respectively, the spatial and temporal degrees of freedom. Diverse caching and basis reordering approaches are first explored to reduce the number of matrix-vector multiplications necessary to compute the right hand side of the MOD system. The new schemes primarily eliminate the existing O(N) innermost vector summations on all past polynomial orders. This complexity reduction facilitates the usage of FFT approaches to accelerate the calculation of existing temporal convolutions. In an additive secondary stage, the recursive time convolution products of the Toeplitz block aggregates of the retarded interaction matrices are expedited by array multiplications in spectral domain. When the translation invariancy on time-order indices are placed on the outermost possible nested Toeplitz levels due to the space shift invariancy, the overall computational complexities and memory requirements can be further reduced to O(MNlog(MN)) and O(MN), respectively.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematical Modelling - Volume 40, Issues 13â14, July 2016, Pages 6267-6279
Journal: Applied Mathematical Modelling - Volume 40, Issues 13â14, July 2016, Pages 6267-6279
نویسندگان
Amir Geranmayeh,