default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul N. Swarztrauber
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2004
[j16]Paul N. Swarztrauber:
The Communication Machine. Int. J. High Speed Comput. 12(1): 69-82 (2004)- [j15]Paul N. Swarztrauber, William F. Spotz:
Spherical harmonic projectors. Math. Comput. 73(246): 753-760 (2004) - 2003
- [j14]Paul N. Swarztrauber:
On Computing the Points and Weights for Gauss-Legendre Quadrature. SIAM J. Sci. Comput. 24(3): 945-954 (2003) - 2002
- [j13]William F. Spotz, Paul N. Swarztrauber:
Climate modeling. Comput. Sci. Eng. 4(5): 24-25 (2002) - [j12]Natasha Flyer, Paul N. Swarztrauber:
The Convergence of Spectral and Finite Difference Methods for Initial-Boundary Value Problems. SIAM J. Sci. Comput. 23(5): 1731-1751 (2002) - 2001
- [j11]Paul N. Swarztrauber, Steven W. Hammond:
A comparison of optimal FFTs on torus and hypercube multicomputers. Parallel Comput. 27(6): 847-859 (2001) - 2000
- [j10]Paul N. Swarztrauber:
The Vector Multiprocessor. Int. J. High Speed Comput. 11(1): 37-53 (2000) - 1998
- [j9]Paul N. Swarztrauber:
Transposing Arrays on Multicomputers Using de Bruijn Sequences. J. Parallel Distributed Comput. 53(1): 63-77 (1998) - 1995
- [j8]David H. Bailey, Paul N. Swarztrauber:
Efficient Detection of a Continuous-Wave Signal with a Linear Frequency Drift. SIAM J. Sci. Comput. 16(5): 1233-1239 (1995) - 1994
- [j7]David H. Bailey
, Paul N. Swarztrauber:
A Fast Method for the Numerical Evaluation of Continuous Fourier and Laplace Transforms. SIAM J. Sci. Comput. 15(5): 1105-1110 (1994) - 1991
- [j6]Charles Tong, Paul N. Swarztrauber:
Ordered Fast Fourier Transforms on a Massively Parallel Hypercube Multiprocessor. J. Parallel Distributed Comput. 12(1): 50-59 (1991) - [j5]Paul N. Swarztrauber, Roland A. Sweet, William L. Briggs, Van Emden Henson, James S. Otto:
Bluestein's FFT for arbitrary N on the hypercube. Parallel Comput. 17(6-7): 607-617 (1991) - [j4]David H. Bailey, Paul N. Swarztrauber:
The Fractional Fourier Transform and Applications. SIAM Rev. 33(3): 389-404 (1991) - 1987
- [j3]Paul N. Swarztrauber:
Multiprocessor FFTs. Parallel Comput. 5(1-2): 197-210 (1987) - 1984
- [j2]Paul N. Swarztrauber:
FFT algorithms for vector computers. Parallel Comput. 1(1): 45-63 (1984) - 1979
- [j1]Paul N. Swarztrauber, Roland A. Sweet:
Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3]. ACM Trans. Math. Softw. 5(3): 352-364 (1979)
Conference and Workshop Papers
- 1988
- [c2]Richard K. Sato, Paul N. Swarztrauber:
Benchmarking the connection machine 2. SC 1988: 304-309 - 1975
- [c1]Paul N. Swarztrauber, Roland A. Sweet:
Efficient FORTRAN subprograms for the solution of elliptic partial differential equations. SIGNUM 1975: 30
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
