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 条

[41] An O(n log log n) time algorithm for constructing a graph of maximum connectivity with prescribed degrees
Asano, T
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 51 (03) : 503 - 510
[42] An O (n(log n)2/log log n) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees
Spoerhase, J.
Wirth, H. -C.
INFORMATION PROCESSING LETTERS, 2009, 109 (08) : 391 - 394
[43] AN O(N-LOG-N) UNIDIRECTIONAL ALGORITHM FOR THE CIRCULAR EXTREMA PROBLEM
PETERSON, GL
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (04): : 758 - 762
[44] An O(n(log n)3) algorithm for maximum matching in trapezoid graphs
Ngoc-Khang Le
Phan-Thuan Do
PROCEEDINGS OF 2013 IEEE RIVF INTERNATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION TECHNOLOGIES: RESEARCH, INNOVATION, AND VISION FOR THE FUTURE (RIVF), 2013, : 157 - 162
[45] An O(n log n)-time algorithm for the restriction scaffold assignment problem
Colannino, Justin
Damian, Mirela
Hurtado, Ferran
Iacono, John
Meijer, Henk
Ramaswami, Suneeta
Toussaint, Godfried
JOURNAL OF COMPUTATIONAL BIOLOGY, 2006, 13 (04) : 979 - 989
[46] An O(n log n) algorithm for finding a shortest central link segment
Aleksandrov, LG
Djidjev, HN
Sack, JR
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2000, 10 (02) : 157 - 188
[47] An O(n log n) Cutting Plane Algorithm for Structured Output Ranking
Blaschko, Matthew B.
Mittal, Arpit
Rahtu, Esa
PATTERN RECOGNITION, GCPR 2014, 2014, 8753 : 132 - 143
[48] A HIERARCHICAL O(N-LOG-N) FORCE-CALCULATION ALGORITHM
BARNES, J
HUT, P
NATURE, 1986, 324 (6096) : 446 - 449
[49] An O(n log n) algorithm for the zoo-keeper's problem
Bespamyatnikh, S
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2003, 24 (02): : 63 - 74
[50] AN O(N LOG N) UNIDIRECTIONAL DISTRIBUTED ALGORITHM FOR EXTREMA FINDING IN A CIRCLE
DOLEV, D
KLAWE, M
RODEH, M
JOURNAL OF ALGORITHMS, 1982, 3 (03) : 245 - 260

← 1 2 3 4 5 →