A fast algorithm for solving the tensor product collocation equations

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

科研成果详情

发表状态	已发表Published
题名	A fast algorithm for solving the tensor product collocation equations
作者	Sun, Weiwei; Zamani, Nader G.
发表日期	1989
发表期刊	Journal of the Franklin Institute
ISSN/eISSN	0016-0032
卷号	326 期号:2 页码:295-307
摘要	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.
DOI	10.1016/0016-0032(89)90076-8
URL	查看来源
收录类别	SCIE
语种	英语English
WOS研究方向	Automation & Control Systems ; Engineering ; Mathematics
WOS类目	Automation & Control Systems ; Engineering, Multidisciplinary ; Engineering, Electrical & Electronic ; Mathematics, Interdisciplinary Applications
WOS记录号	WOS:A1989T362700010
Scopus入藏号	2-s2.0-38249026426
引用统计	被引频次：18[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	https://repository.uic.edu.cn/handle/39GCC9TT/3336
专题	个人在本单位外知识产出
作者单位	Department of Mathematics and Statistics, University of Windsor, Windsor, Ont., Canada
推荐引用方式 GB/T 7714	Sun, Weiwei,Zamani, Nader G. A fast algorithm for solving the tensor product collocation equations[J]. Journal of the Franklin Institute, 1989, 326(2): 295-307.
APA	Sun, Weiwei, & Zamani, Nader G. (1989). A fast algorithm for solving the tensor product collocation equations. Journal of the Franklin Institute, 326(2), 295-307.
MLA	Sun, Weiwei,et al."A fast algorithm for solving the tensor product collocation equations". Journal of the Franklin Institute 326.2(1989): 295-307.