The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A precorrected-FFT method for electrostatic analysis of complicated 3-D structures
Abstract
In this paper we present a new algorithm for accelerating the potential calculation which occurs in the inner loop of iterative algorithms for solving electromagnetic boundary integral equations. Such integral equations arise, for example, in the extraction of coupling capacitances in three-dimensional (3-D) geometries. We present extensive experimental comparisons with the capacitance extraction code FASTCAP and demonstrate that, for a wide variety of geometries commonly encountered in integrated circuit packaging, on-chip interconnect and micro-electro-mechanical systems, the new "precorrected-FFT" algorithm is superior to the fast multipole algorithm used in FASTCAP in terms of execution time and memory use. At engineering accuracies, in terms of a speed-memory product, the new algorithm can be superior to the fast multipole based schemes by more than an order of magnitude.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
(2020) · Electromagnetic Processes · doi:10.2307/j.ctv131bv37.5 · Cited by 21,966
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Saad, Y., & Schultz, M. H. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907058 · Cited by 11,154
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Field Computation by Moment Methods
Harrington, R. F. (1993) · Institute of Electrical and Electronics Engineers eBooks · doi:10.1109/9780470544631 · Cited by 6,763
Computer Simulation Using Particles
Hockney, R. W., & Eastwood, J. W. (1988) · Institute of Physics eBooks · doi:10.1887/0852743920 · Cited by 5,441
Field Computation by Moment Methods
Jones, D. S. (1969) · The Computer Journal · doi:10.1093/comjnl/12.1.37 · Cited by 3,476
Brebbia, C. A., Telles, J. C. F., & Wrobel, L. C. (1984) · Springer eBooks · doi:10.1007/978-3-642-48860-3 · Cited by 3,151
The fast Fourier transform and its applications
(1989) · Choice Reviews Online · doi:10.5860/choice.26-3285 · Cited by 2,117
The Numerical Treatment of Differential Equations
Collatz, L. (1960) · Springer eBooks · doi:10.1007/978-3-642-88434-4 · Cited by 1,502
Rapid solution of integral equations of classical potential theory
Rokhlin, V (1985) · Journal of Computational Physics · doi:10.1016/0021-9991(85)90002-6 · Cited by 1,414
Computational Frameworks for the Fast Fourier Transform
Van Loan, C. (1992) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970999 · Cited by 1,283
The Rapid Evaluation of Potential Fields in Particle Systems
Greengard, L. F. (1988) · The MIT Press eBooks · doi:10.7551/mitpress/5750.001.0001 · Cited by 1,066
Multilevel matrix multiplication and fast solution of integral equations
Brandt, A., & Lubrecht, A. A. (1990) · Journal of Computational Physics · doi:10.1016/0021-9991(90)90171-v · Cited by 445
Efficient Capacitance Calculations for Three-Dimensional Multiconductor Systems
Ruehli, A. E., & Brennan, P. A. (1973) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.1973.1127927 · Cited by 379
Schwinger, J., DeRaad, L. L., Milton, K. A., & Tsai, W.-Y. (2019) · CRC Press eBooks · doi:10.1201/9780429503542 · Cited by 267
Cited by
A Fast Adaptive Multipole Algorithm in Three Dimensions
Cheng, H., Greengard, L., & Rokhlin, V. (1999) · Journal of Computational Physics · doi:10.1006/jcph.1999.6355 · Cited by 702
A common formalism for the Integral formulations of the forward EEG problem
Kybic, J., Clerc, M., Abboud, T., Faugeras, O., Keriven, R., & Papadopoulo, T. (2005) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2004.837363 · Cited by 422
Simulating the dynamics and interactions of flexible fibers in Stokes flows
Tornberg, A.-K., & Shelley, M. J. (2004) · Journal of Computational Physics · doi:10.1016/j.jcp.2003.10.017 · Cited by 396
(2011) · Lecture Notes in Physics · doi:10.1007/978-3-642-20288-9 · Cited by 255
Metadata
- Authors
- Phillips, J. R., & White, J. K.
- Venue
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 1997
- Volume
- 16
- Issue
- 10
- Pages
- 1059-1072
- ISSN
- 0278-0070 (ISSN-L)
- OpenAlex
- W2171879949
- Cited by
- 722
- References
- 17
- FWCI
- 3.51
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.