Accelerated S-NFC for Million-Chaff RCS Computation Using Low-Rank Compression of Concatenated Block Rows
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
[2608.27936] Accelerated S-NFC for Million-Chaff RCS Computation Using Low-Rank Compression of Concatenated Block Rows Skip to main content Search Submit Donate Log in Physics > Computational Physics arXiv:2608.27936 (physics) [Submitted on 28 Aug 2026] Title: Accelerated S-NFC for Million-Chaff RCS Computation Using Low-Rank Compression of Concatenated Block Rows Authors: Dong-Yeop Na , Somyeong Lee , Chung Hyun Lee View PDF HTML (experimental) 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\times$ 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\%$. Subjects: Computational Physics (physics.comp-ph) ; Information Theory (cs.IT) Cite as: arXiv:2608.27936 [physics.comp-ph] (or arXiv:2608.27936v1 [physics.comp-ph] for this version) https://doi.org/10.48550/arXiv.2608.27936 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Chung Hyun Lee [ view email ] [v1] Fri, 28 Aug 2026 05:26:54 UTC (504 KB) Full-text links: Access Paper: View PDF HTML (experimental) TeX Source view license Current browse context: physics.comp-ph < prev | next > new | recent | 2026-08 Change to browse by: cs cs.IT math math.IT physics References & Citations SciX Google Scholar Semantic Scholar export BibTeX citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from (opens in new tab) (opens in new tab) (opens in new tab)
Related documents
- Accelerated S-NFC for Million-Chaff RCS Computation Using Low-Rank Compression of Concatenated Block Rows#779839
- Through-the-wall radar imaging, signal processing and experimentation#195790
- Secrets of Radar#57648
- Détection, caractérisation et classification de signaux radar LPI par méthodes d'intelligence artificielle#670111
- ECMA-362 — NFCIP-1 - Protocol test methods (June 2024)#600267
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive