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 › peer-review
Author(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 295-307 |
Journal / Publication | Journal of the Franklin Institute |
Volume | 326 |
Issue number | 2 |
Publication status | Published - 1989 |
Externally published | Yes |
Link(s)
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.
Citation Format(s)
A fast algorithm for solving the tensor product collocation equations. / Sun, Weiwei; Zamani, N. G.
In: Journal of the Franklin Institute, Vol. 326, No. 2, 1989, p. 295-307.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review