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 条
  • [1] AN O(LOG-N) ALGORITHM FOR COMPUTING THE NTH ELEMENT OF THE SOLUTION OF A DIFFERENCE EQUATION
    URBANEK, FJ
    INFORMATION PROCESSING LETTERS, 1980, 11 (02) : 66 - 67
  • [2] AN O(N LOG N LOG LOG N) PARALLEL MAXIMUM MATCHING ALGORITHM FOR BIPARTITE GRAPHS
    KIM, T
    CHWA, KY
    INFORMATION PROCESSING LETTERS, 1987, 24 (01) : 15 - 17
  • [3] An O(N log N) algorithm for shape modeling
    Malladi, R.
    Sethian, J. A.
    Proceedings of the National Academy of Sciences of the United States of America, 93 (18):
  • [4] AN O(N LOG N) MANHATTAN PATH ALGORITHM
    LIPSKI, W
    INFORMATION PROCESSING LETTERS, 1984, 19 (02) : 99 - 102
  • [5] An O(N log N) algorithm for shape modeling
    Malladi, R
    Sethian, JA
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1996, 93 (18) : 9389 - 9392
  • [6] An O(log n log log n) space algorithm for undirected st-connectivity
    Trifonov, Vladimir
    SIAM JOURNAL ON COMPUTING, 2008, 38 (02) : 449 - 483
  • [7] An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Asadpour, Arash
    Goemans, Michel X.
    Madry, Aleksander
    Gharan, Shayan Oveis
    Saberi, Amin
    OPERATIONS RESEARCH, 2017, 65 (04) : 1043 - 1061
  • [8] An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Asadpour, Arash
    Goemans, Michel X.
    Madry, Aleksander
    Gharan, Shayan Oveis
    Saberi, Amin
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 379 - +
  • [9] Towards a practical O(n log n) phylogeny algorithm
    Truszkowski, Jakub
    Hao, Yanqi
    Brown, Daniel G.
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2012, 7
  • [10] An O(M(n) log n) Algorithm for the Jacobi Symbol
    Brent, Richard P.
    Zimmermann, Paul
    ALGORITHMIC NUMBER THEORY, 2010, 6197 : 83 - +
12345