TY - JOUR
T1 - Orthogonal collocation solution of biharmonic equations
AU - Sun, W.
PY - 1993/1/1
Y1 - 1993/1/1
N2 - In this paper, we present a direct algorithm for solving the linear system arising from the orthogonal collocation discretization of biharmonic equation. In terms of FFT transformation, the cost of algorithm is 0(N3log2N) operations for an N x N mesh. The numerical experiments show that the algorithm is efficient, accurate and less cost. © 1993, Taylor & Francis Group, LLC. All rights reserved.
AB - In this paper, we present a direct algorithm for solving the linear system arising from the orthogonal collocation discretization of biharmonic equation. In terms of FFT transformation, the cost of algorithm is 0(N3log2N) operations for an N x N mesh. The numerical experiments show that the algorithm is efficient, accurate and less cost. © 1993, Taylor & Francis Group, LLC. All rights reserved.
KW - biharmonic equation
KW - Orthogonal collocation
UR - http://www.scopus.com/inward/record.url?scp=0027891708&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0027891708&origin=recordpage
U2 - 10.1080/00207169308804233
DO - 10.1080/00207169308804233
M3 - RGC 21 - Publication in refereed journal
SN - 0020-7160
VL - 49
SP - 221
EP - 232
JO - International Journal of Computer Mathematics
JF - International Journal of Computer Mathematics
IS - 3-4
ER -