Accelerated S-NFC for Million-Chaff RCS Computation Using Low-Rank Compression of Concatenated Block Rows
Abstract
Sparsification via neglecting far-field coupling (S-NFC) enables fast full-wave radar-cross-section analysis of large-scale chaff clouds by retaining only significant local electromagnetic interactions. This letter further accelerates S-NFC by concatenating the retained off-diagonal interaction blocks associated with each receiving chaff element and applying a joint low-rank factorization with a shared receiving-side basis. Exact self interactions are preserved, while repeated chaff templates reuse precomputed lower--upper factorizations of the self-interaction blocks. The compressed formulation reduces retained-coupling storage and matrix--vector multiplication cost and also decreases the number of iterations required by the generalized conjugate residual solver. Numerical tests with 100,000 chaff elements demonstrate sub-1% complex-far-field error for low-rank approximations in sparse regimes and identify a practical self-only limit at sufficiently large mean spacing. For a one-million-chaff plume, the proposed compressed S-NFC achieves a 6.92× end-to-end speedup over uncompressed S-NFC while storing only 6.60% of the retained coupling, with a complex-far-field error of 0.253%.
Related
- Random walks in handaxe knapping before 1.2 million years ago in East Africa at Melka Kunture (Upper Awash, Ethiopia)
- Relax and Follow: L0-Path Computation with L0-Bregman Relaxations
- Computation of leading coefficients in asymptotics of relative quantum invariants
- Currently, there are no reasons to doubt the Riemann Hypothesis: The zeta function beyond the realm of computation
- Random Clocks on Computation Paths]{Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?
BibTeX
@misc{na2026accelerated,
title = {{Accelerated S-NFC for Million-Chaff RCS Computation Using Low-Rank Compression of Concatenated Block Rows}},
author = {Dong-Yeop Na and Somyeong Lee and Chung Hyun Lee},
howpublished = {arXiv},
year = {2026},
month = aug,
doi = {10.48550/arxiv.2608.27936},
eprint = {2608.27936},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.27936},
}
RIS
TY - UNPB
TI - Accelerated S-NFC for Million-Chaff RCS Computation Using Low-Rank Compression of Concatenated Block Rows
AU - Dong-Yeop Na
AU - Somyeong Lee
AU - Chung Hyun Lee
PY - 2026
DA - 2026/08/28
PB - arXiv
DO - 10.48550/arxiv.2608.27936
UR - https://arxiv.org/abs/2608.27936
AB - Sparsification via neglecting far-field coupling (S-NFC) enables fast full-wave radar-cross-section analysis of large-scale chaff clouds by retaining only significant local electromagnetic interactions. This letter further accelerates S-NFC by concatenating the retained off-diagonal interaction blocks associated with each receiving chaff element and applying a joint low-rank factorization with a shared receiving-side basis. Exact self interactions are preserved, while repeated chaff templates reuse precomputed lower--upper factorizations of the self-interaction blocks. The compressed formulation reduces retained-coupling storage and matrix--vector multiplication cost and also decreases the number of iterations required by the generalized conjugate residual solver. Numerical tests with 100,000 chaff elements demonstrate sub-1% complex-far-field error for low-rank approximations in sparse regimes and identify a practical self-only limit at sufficiently large mean spacing. For a one-million-chaff plume, the proposed compressed S-NFC achieves a 6.92× end-to-end speedup over uncompressed S-NFC while storing only 6.60% of the retained coupling, with a complex-far-field error of 0.253%.
ER -