ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Algorithm 543: FFT9, Fast Solution of Helmholtz-Type Partial Differential Equations [D3]
Full text PdfPdf (171 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 5 ,  Issue 4  (December 1979) table of contents
Pages: 490 - 493  
Year of Publication: 1979
ISSN:0098-3500
Authors
E. N. Houstis  Department of Computer Science, Purdue University, West Lafayette, IN
T. S. Papatheodorou  Department of Mathematics, Clarkson College of Technology, Potsdam, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 27,   Citation Count: 1
Additional Information:

appendices and supplements   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/355853.355865
What is a DOI?

APPENDICES and SUPPLEMENTS
gZipFFT9 (543.gz) (10 KB)
4th and 6th order accurate 9-point finite difference approximations and fast Fourier solution techniques: Dirichlet problem for the Helmholtz equation on a rectangle
Gams: I2b1a1a


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
E. N. Houstis , T. S. Papatheodorou, High-Order Fast Elliptic Equation Solvers, ACM Transactions on Mathematical Software (TOMS), v.5 n.4, p.431-441, Dec. 1979  [doi>10.1145/355853.355859]

CITED BY
E. N. Houstis , T. S. Papatheodorou, High-Order Fast Elliptic Equation Solvers, ACM Transactions on Mathematical Software (TOMS), v.5 n.4, p.431-441, Dec. 1979

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.1 Numerical Algorithms and Problems
          Subjects: Computation of transforms (e.g., fast Fourier transform)


General Terms:
Algorithms, Theory

Collaborative Colleagues:
E. N. Houstis: colleagues
T. S. Papatheodorou: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player