An O (n log n) solution algorithm for spectral element methods

被引：0

作者：

Lee, I ^{[1
]}

Raghavan, P ^{[1
]}

Schofield, S ^{[1
]}

Fischer, P ^{[1
]}

机构：

[1] Penn State Univ, Dept Comp Sci & Engn, Pond Lab 220, University Pk, PA 16802 USA

来源：

COMPUTATIONAL FLUID AND SOLID MECHANICS 2003, VOLS 1 AND 2, PROCEEDINGS | 2003年

关键词：

spectral element method; sparse matrices; parallel computing;

D O I：

暂无

中图分类号：

O3 [力学];

学科分类号：

08 ; 0801 ;

摘要：

To leverage significant software development effort, general purpose unstructured codes are often used in structured or semi-structured applications. We show that 0(n log n) computational complexities, competitive with classic Fourier methods, are achievable for some classes of semi-structured spectral element applications.

引用

页码：2039 / 2042

页数：4

共 50 条

[31] An O(n3(log log n/log n)5/4) Time Algorithm for All Pairs Shortest Path
Yijie Han
Algorithmica, 2008, 51 : 428 - 434
[32] An O(n3 log log n/log n) time algorithm for the all-pairs shortest path problem
Takaoka, T
INFORMATION PROCESSING LETTERS, 2005, 96 (05) : 155 - 161
[33] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest path
Han, Yijie
ALGORITHMICA, 2008, 51 (04) : 428 - 434
[34] An O(n√n, log log n) average case algorithm for the maximum induced matching problem in permutation graphs
Viet Cuong Than
Phan Thuan Do
PROCEEDINGS OF THE 2018 5TH ASIAN CONFERENCE ON DEFENSE TECHNOLOGY (ACDT 2018), 2018, : 45 - 49
[35] An O(n) algorithm for Abelian p-group isomorphism and an O(n log n) algorithm for Abelian group isomorphism
Vikas, N
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1996, 53 (01) : 1 - 9
[36] O(n) algorithm for Abelian p-group isomorphism and an O(n log n) algorithm for Abelian group isomorphism
Indian Inst of Technology, New Delhi, India
J Comput Syst Sci, 1600, 1 (1-9):
[37] An O (N log M) algorithm for catalogue crossmatching
Devereux, D
Abel, DJ
Power, RA
Lamb, PR
ASTRONOMICAL DATA ANALYSIS SOFTWARE AND SYSTEMS XIV, PROCEEDINGS, 2005, 347 : 346 - 349
[38] AN O(N LOG M) ALGORITHM FOR THE JOSEPHUS PROBLEM
LLOYD, EL
JOURNAL OF ALGORITHMS, 1983, 4 (03) : 262 - 270
[39] A Novel In-Place Sorting Algorithm with O(n log z) Comparisons and O(n log z) Moves
Mahmoud, Hanan Ahmed-Hosni
Al-Ghreimil, Nadia
PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 16, 2006, 16 : 239 - 244
[40] PROMETHEE is not quadratic: An O(qn log(n)) algorithm
Calders, Toon
Van Assche, Dimitri
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2018, 76 : 63 - 69

← 1 2 3 4 5 →