A fast algorithm for solving the tensor product collocation equations

Weiwei Sun; N. G. Zamani

doi:10.1016/0016-0032(89)90076-8

A fast algorithm for solving the tensor product collocation equations

Weiwei Sun, N. G. Zamani

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

13 Citations (Scopus)

Abstract

A fast algorithm is presented for solving the tensor product collocation equations (A_x ⊗ B_y + B_x ⊗ A_y)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(N²log₂N) which makes the overall calculations very economical. © 1989.

Original language	English
Pages (from-to)	295-307
Journal	Journal of the Franklin Institute
Volume	326
Issue number	2
DOIs	https://doi.org/10.1016/0016-0032(89)90076-8
Publication status	Published - 1989
Externally published	Yes

Access Output

10.1016/0016-0032(89)90076-8

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{e4dd2fcb9ab14c42906c6c75346e5822,

title = "A fast algorithm for solving the tensor product collocation equations",

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. {\textcopyright} 1989.",

author = "Weiwei Sun and Zamani, {N. G.}",

year = "1989",

doi = "10.1016/0016-0032(89)90076-8",

language = "English",

volume = "326",

pages = "295--307",

journal = "Journal of the Franklin Institute",

issn = "0016-0032",

publisher = "Elsevier Ltd.",

number = "2",

}

TY - JOUR

T1 - A fast algorithm for solving the tensor product collocation equations

AU - Sun, Weiwei

AU - Zamani, N. G.

PY - 1989

Y1 - 1989

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38249026426&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-38249026426&origin=recordpage

U2 - 10.1016/0016-0032(89)90076-8

DO - 10.1016/0016-0032(89)90076-8

M3 - RGC 21 - Publication in refereed journal

SN - 0016-0032

VL - 326

SP - 295

EP - 307

JO - Journal of the Franklin Institute

JF - Journal of the Franklin Institute

IS - 2

ER -

A fast algorithm for solving the tensor product collocation equations

Abstract

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this