An extension of Draghicescu’s fast tree-code algorithm to the vortex method on a sphere

Sakajo, Takashi

Journal of Computational and Applied Mathematics, 2008

Permalink : https://hdl.handle.net/2115/34773

このアイテムのアクセス数:1,861件（2026-08-09 01:22 集計）

ファイル	フォーマット	サイズ	閲覧回数	説明
v	pdf	2.85 MB	1,196

アクセス権	open access
URI	https://hdl.handle.net/2115/34773
タイトル	An extension of Draghicescu’s fast tree-code algorithm to the vortex method on a sphere
著者	e-Rad_Researcher 10303603 著者名 Sakajo, Takashi
言語	英語
キーワード	Fast tree-codenext term algorithms
	Flows on sphere
	Vortex method
	Vortex sheet
発行日	2008
出版者	Elsevier B.V.
収録物名	Journal of Computational and Applied Mathematics
抄録	A fast and accurate algorithm to compute interactions between N point vortices and between N vortex blobs on a sphere is proposed. It is an extension of the fast tree-code algorithm developed by Draghicescu for the vortex method in the plane. When we choose numerical parameters in the fast algorithm suitably, the computational cost of O(N2) is reduced to O(N(logN)4) and the approximation error decreases like O(1/N) when N→∞, as demonstrated in the present article. We also apply the fast method to long-time evolution of two vortex sheets on the sphere to see the efficiency. A key point is to describe the equation of motion for the N points in the three-dimensional Cartesian coordinates.
資源タイプ	学術雑誌論文
出版タイプ	Accepted Manuscript
PISSN	0377-0427
関連情報	URI http://www.sciencedirect.com/science/journal/03770427
関連情報 (isVersionOf)	出版社版DOI https://doi.org/10.1016/j.cam.2008.07.021