Skip to main content
Article thumbnail
Location of Repository

An O(n log n) Solution Algorithm for Spectral Element Methods

By I. Lee, P. Raghavan, S. Schofield and P. Fischer

Abstract

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

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.349
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.mcs.anl.gov/~fische... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.