HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Science / Faculty of Science >
Peer-reviewed Journal Articles, etc >

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

Files in This Item:
fpv.pdf2.92 MBPDFView/Open
Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/34773

Title: An extension of Draghicescu’s fast tree-code algorithm to the vortex method on a sphere
Authors: Sakajo, Takashi Browse this author →KAKEN DB
Keywords: Fast tree-codenext term algorithms
Flows on sphere
Vortex method
Vortex sheet
Issue Date: 2008
Publisher: Elsevier B.V.
Journal Title: Journal of Computational and Applied Mathematics
Publisher DOI: 10.1016/j.cam.2008.07.021
Abstract: 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.
Relation: http://www.sciencedirect.com/science/journal/03770427
Type: article (author version)
URI: http://hdl.handle.net/2115/34773
Appears in Collections:理学院・理学研究院 (Graduate School of Science / Faculty of Science) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: 坂上 貴之

Export metadata:

OAI-PMH ( junii2 , jpcoar_1.0 )

MathJax is now OFF:


 

 - Hokkaido University