New Algorithm Cracks Radar Stealth Simulations Nearly 20 Times Faster

For decades, the dream of an aircraft that vanishes from enemy radar has been pursued through exotic shapes, radar-absorbing coatings, and carefully engineered surfaces. But behind every stealth design sits an unglamorous computational bottleneck: engineers must calculate how radar waves scatter off the aircraft from every possible angle, and doing so for large, detailed models can take enormous amounts of computer time. A team of Korean researchers now reports a mathematical upgrade that slashes that burden dramatically, accelerating angular radar cross-section analysis by nearly a factor of twenty in large-scale missile simulations while preserving the accuracy of the original method.

The study, published in the International Journal of Aeronautical and Space Sciences by Seung-Hoon Kang of Sejong University and Younggeun Park and SangJoon Shin of Seoul National University, tackles a problem that has grown steadily worse as stealth analysis has become more demanding. To certify how well a design hides from radar, analysts must compute the monostatic radar cross-section, or RCS, for a sweeping range of illumination angles. Each angle corresponds to a different incident radar wave, and each incident wave requires solving a large system of linear equations derived from a finite-element model of the aircraft or missile. In the language of numerical linear algebra, the analyst faces a system with many right-hand sides, one for every direction the radar might come from.

The finite-element method discretizes the volume of space around and inside the target into millions of small elements, turning Maxwell’s equations of electromagnetism into a gigantic sparse linear system. Solving that system once is already a serious undertaking. Solving it hundreds of times, once per angular sample, multiplies the cost into something that can dominate an entire design cycle. The researchers describe this as the central obstacle in angular monostatic RCS analysis for large-scale finite-element models, and it is precisely the obstacle their new methods are built to remove.

Their starting point is an established technique called the finite element tearing and interconnecting method, or FETI, originally devised in the early 1990s by Charbel Farhat and François-Xavier Roux as a way of tearing a large structural problem into smaller subdomains and then interconnecting the pieces through interface conditions. The dual-primal refinement, FETI-DP, introduced in 2001, added primal constraints at selected interface points that dramatically improved convergence, and the electromagnetic adaptation, FETI-DPEM, extended the approach to wave problems governed by Maxwell’s equations. In FETI-DPEM, the computational domain is partitioned into subdomains, each subdomain problem is solved independently, and an interface problem enforces continuity of the electromagnetic fields across the artificial boundaries between subdomains. The interface problem is solved iteratively with a Krylov-subspace method, a family of algorithms that build up an approximate solution from a sequence of increasingly refined search directions.

The key insight behind the new work is that the many right-hand sides arising from angular sweeps are not independent of one another. When radar illuminates a target from ten degrees and then from eleven degrees, the two incident waves produce scattered-field solutions that are highly correlated. Information generated while solving the first system, in the form of Krylov subspace vectors, is therefore valuable for solving the second. Conventional practice throws that information away after each solve. The researchers’ first proposed variant, which they call recycling FETI-DPEM, or rFETI-DPEM, instead retains and reuses Krylov subspace information from previously solved angles. As each new right-hand side arrives, the method augments the stored subspace with the new search directions using a modified Gram–Schmidt orthogonalization procedure, keeping the recycled vectors orthonormal and computationally cheap to maintain. The result is a sequential solver in which each successive angular solve starts much closer to its answer than a cold start would.

The second variant goes further by attacking the multiple right-hand sides simultaneously. Block FETI-DPEM, or bFETI-DPEM, gathers the incident-wave vectors into a block and first applies a rank-revealing QR decomposition to that block. Rank-revealing QR is a classical matrix factorization technique that identifies which columns of a matrix carry genuinely independent information and which are nearly redundant. In the angular RCS setting, this means the method detects the linear dependency among the incident waves and collapses the block of right-hand sides to a much smaller set of independent representatives. The reduced system is then solved with a block iterative solver, a block version of the BiCGSTAB algorithm that advances all right-hand sides together, sharing search-direction information across the entire set. Because the block dimension has already been pruned, the block solver operates on a far leaner problem than the original sweep would imply.

The numerical experiments reported in the paper show that both variants deliver on their promise. In test cases ranging from canonical scattering objects to large-scale missile geometries, rFETI-DPEM and bFETI-DPEM reproduced the RCS results of the original FETI-DPEM method to the expected accuracy, confirming that the acceleration does not come at the price of fidelity. The speed-ups, however, differed markedly between the two. The block approach proved the more robust of the pair, and in the largest missile analyses it achieved a speed-up factor of up to 19.6 times compared with the baseline method. The researchers attribute this superiority to the block strategy’s ability to exploit the correlation structure among all the right-hand sides at once, rather than only sequentially, and to the dimensionality reduction provided by the rank-revealing QR step, which strips out redundant work before the expensive iterative phase begins.

The significance of such an improvement extends well beyond a single benchmark. Angular RCS analysis sits at the heart of stealth certification, and the cost of that analysis constrains how finely engineers can sample angles, how detailed their finite-element models can be, and how many design iterations they can afford. A nearly twenty-fold acceleration in the large-scale regime effectively multiplies the design exploration budget. It allows analysts to sweep angles more densely, catching narrow specular lobes and grazing-angle signatures that a coarse angular sampling might miss, and it makes it feasible to evaluate radar signatures early in the design process rather than late, when geometric changes are expensive. The work also connects to a broader current in computational electromagnetics, in which domain decomposition, Krylov recycling, and block iterative techniques are being combined to push the frontier of solvable problem sizes.

The methodological lineage of the paper is deep. The recycling idea traces back to foundational work by Parks and colleagues on reusing Krylov subspaces for sequences of linear systems, and recycling BiCGSTAB has found applications from parametric model-order reduction to computational fluid dynamics. Block Krylov methods for multiple right-hand sides have been developed since the early 2000s, including block variants of BiCGSTAB used in lattice quantum chromodynamics. What the Korean team contributes is the careful integration of these ingredients into the electromagnetic FETI-DP framework, together with the observation that angular radar sweeps provide exactly the kind of correlated right-hand-side structure that makes recycling and blocking pay off. The rank-revealing QR reduction, drawn from classical numerical linear algebra, acts as the bridge that makes the block method efficient rather than merely elegant.

For the aerospace community, the message is that the computational wall standing in front of large-scale stealth analysis has just become considerably lower. The authors position the framework as a highly efficient and robust solution for radar stealth analyses of complex aerospace structures, and the reported speed-ups suggest that full-aircraft angular signature studies that once strained computational budgets could become routine. As stealth requirements spread from dedicated attack aircraft to missiles, drones, radomes, and coated components, tools that turn weeks of computation into days, or days into hours, will shape what engineers can design and verify. This study demonstrates that sometimes the most powerful upgrade to a stealth platform is not a new coating or a new shape, but a smarter way of solving the equations that describe it.

Subject of Research: Accelerated domain decomposition methods for angular radar cross-section stealth analysis of aerospace structures

Article Title: Improved Dual-Primal Domain Decomposition Method for the Angular Radar Stealth Analysis

Article References: Kang, S.-H., Park, Y., & Shin, S. (2026). Improved Dual-Primal Domain Decomposition Method for the Angular Radar Stealth Analysis. International Journal of Aeronautical and Space Sciences. https://doi.org/10.1007/s42405-026-01236-1

Image Credits: AI Generated

DOI: 10.1007/s42405-026-01236-1

Keywords: radar cross-section, stealth technology, domain decomposition, FETI-DP, finite element method, Krylov subspace recycling, block iterative solvers, rank-revealing QR, computational electromagnetics, multiple right-hand sides, aerospace engineering, parallel computation