A fast algorithm for solving the tensor product collocation equations

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journal

13 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)295-307
Journal / PublicationJournal of the Franklin Institute
Volume326
Issue number2
Publication statusPublished - 1989
Externally publishedYes

Abstract

A fast algorithm is presented for solving the tensor product collocation equations (Ax ⊗ By + Bx ⊗ Ay)u =b, obtained from the discretization of the Poisson equation in a rectangular region by the collocation method. The Fast Fourier Transformation (FFT) algorithm is employed to achieve the above objective. The operation count is shown to be 0(N2log2N) which makes the overall calculations very economical. © 1989.