SEARCH · Search NASA

Results for “Overlapping Schwarz”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

13 records

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Overlapping Schwarz Methods Are Not Anisotropy‐Robust Multigrid Smoothers

We analyze overlapping multiplicative Schwarz methods as smoothers in the geometric multigrid solution of two-dimensional anisotropic diffusion problems. For diffusion equations, it is well known that the smoothing properties of point-wise smoothers, such as Gauss Seidel, rapidly deteriorate as the strength of anisotropy increases. On the other hand, global smoothers based on line smoothing are known to generally provide good smoothing for diffusion problems, independent of the anisotropy strength. Here, a natural question is whether global methods are really necessary to achieve good smoothing in such problems, or whether it can be obtained with locally overlapping block smoothers using sufficiently large blocks and overlap. Through local Fourier analysis and careful numerical experimentation, we show that global methods are indeed necessary to achieve anisotropy-robust smoothing. Specifically, for any fixed block size bounded sufficiently far away from the global domain size, we find that the smoothing properties of overlapping multiplicative Schwarz rapidly deteriorate with increasing anisotropy, irrespective of the amount of overlap between blocks. Moreover, our results indicate that anisotropy-robust smoothing requires blocks of diameter 𝒪⁡(𝜖 −1/2 ) for anisotropy ratio 𝜖 ∈(0,1] .

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Two-level overlapping additive Schwarz preconditioner for training scientific machine learning applications

In this work we introduce a novel two-level overlapping additive Schwarz preconditioner for accelerating the training of scientific machine learning applications. The design of the proposed preconditioner is motivated by the nonlinear two-level overlapping additive Schwarz preconditioner. The neural network parameters are decomposed into groups (subdomains) with overlapping regions. In addition, the network’s feed-forward structure is indirectly imposed through a novel subdomain-wise synchronization strategy and a coarse-level training step. Through a series of numerical experiments, which consider physicsinformed neural networks and operator learning approaches, we demonstrate that the proposed two-level preconditioner significantly speeds up the convergence of the standard (LBFGS) optimizer while also yielding more accurate machine learning models. Moreover, the devised preconditioner is designed to take advantage of model-parallel computations, which can further reduce the training time.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1996

Parallel Newton-Krylov-Schwarz algorithms for the transonic full potential equation

We study parallel two-level overlapping Schwarz algorithms for solving nonlinear finite element problems, in particular, for the full potential equation of aerodynamics discretized in two dimensions with bilinear elements. The overall algorithm, Newton-Krylov-Schwarz (NKS), employs an inexact finite-difference Newton method and a Krylov space iterative method, with a two-level overlapping Schwarz method as a preconditioner. We demonstrate that NKS, combined with a density upwinding continuation strategy for problems with weak shocks, is robust and, economical for this class of mixed elliptic-hyperbolic nonlinear partial differential equations, with proper specification of several parameters. We study upwinding parameters, inner convergence tolerance, coarse grid density, subdomain overlap, and the level of fill-in in the incomplete factorization, and report their effect on numerical convergence rate, overall execution time, and parallel efficiency on a distributed-memory parallel computer.

Cai, Xiao-Chuan↗

NASA NTRS1995

Local multiplicative Schwarz algorithms for convection-diffusion equations

We develop a new class of overlapping Schwarz type algorithms for solving scalar convection-diffusion equations discretized by finite element or finite difference methods. The preconditioners consist of two components, namely, the usual two-level additive Schwarz preconditioner and the sum of some quadratic terms constructed by using products of ordered neighboring subdomain preconditioners. The ordering of the subdomain preconditioners is determined by considering the direction of the flow. We prove that the algorithms are optimal in the sense that the convergence rates are independent of the mesh size, as well as the number of subdomains. We show by numerical examples that the new algorithms are less sensitive to the direction of the flow than either the classical multiplicative Schwarz algorithms, and converge faster than the additive Schwarz algorithms. Thus, the new algorithms are more suitable for fluid flow applications than the classical additive or multiplicative Schwarz algorithms.

Cai, Xiao-Chuan↗

DOE OSTI2025

A Fundamentally New Coupled Approach to Contact Mechanics via the Dirichlet‐Neumann Schwarz Alternating Method

Contact phenomena are crucial for understanding the behavior of mechanical systems. However, existing computational approaches for simulating mechanical contact often face numerical challenges, such as inaccurate physical predictions, energy conservation errors, and unwanted oscillations. Here, we introduce an alternative technique for simulating dynamic contact based on the non‐overlapping Schwarz alternating method, originally developed for domain decomposition. In multibody contact scenarios, this method treats each body as a separate, non‐overlapping domain and prevents interpenetration using an alternating Dirichlet–Neumann iterative process. This approach has a strong theoretical foundation, eliminates the need for contact constraints, and offers flexibility, making it ideal for multiscale and multiphysics applications. We conducted a numerical comparison between the Schwarz method and traditional methods, such as the Lagrange multiplier and penalty methods, focusing on a benchmark impact problem. Our results indicate that the Schwarz alternating method outperforms traditional methods in several key areas: it provides more accurate predictions for various measurable quantities and demonstrates exceptional energy conservation capabilities. To address unwanted oscillations in contact velocities and forces, we explored various algorithms and stabilization techniques, ultimately opting for the naïve‐stabilized Newmark scheme for its simplicity and effectiveness. Additionally, we validated the efficiency of the Schwarz method in a three‐dimensional impact problem, highlighting its inherent capacity to accommodate different mesh topologies, time‐integration schemes, and time steps for each interacting body.

Schwarz alternating method↗

NASA NTRS1995

Newton-Krylov-Schwarz: An implicit solver for CFD

Newton-Krylov methods and Krylov-Schwarz (domain decomposition) methods have begun to become established in computational fluid dynamics (CFD) over the past decade. The former employ a Krylov method inside of Newton's method in a Jacobian-free manner, through directional differencing. The latter employ an overlapping Schwarz domain decomposition to derive a preconditioner for the Krylov accelerator that relies primarily on local information, for data-parallel concurrency. They may be composed as Newton-Krylov-Schwarz (NKS) methods, which seem particularly well suited for solving nonlinear elliptic systems in high-latency, distributed-memory environments. We give a brief description of this family of algorithms, with an emphasis on domain decomposition iterative aspects. We then describe numerical simulations with Newton-Krylov-Schwarz methods on aerodynamics applications emphasizing comparisons with a standard defect-correction approach, subdomain preconditioner consistency, subdomain preconditioner quality, and the effect of a coarse grid.

Cai, Xiao-Chuan↗

NASA NTRS1996

Quasi-Optimal Schwarz Methods for the Conforming Spectral Element Discretization

Fast methods are proposed for solving the system K(sub N)x = b resulting from the discretization of self-adjoint elliptic equations in three dimensional domains by the spectral element method. The domain is decomposed into hexahedral elements, and in each of these elements the discretization space is formed by polynomials of degree N in each variable. Gauss-Lobatto-Legendre (GLL) quadrature rules replace the integrals in the Galerkin formulation. This system is solved by the preconditioned conjugate gradients method. The conforming finite element space on the GLL mesh consisting of piecewise Q(sub 1) elements produces a stiffness matrix K(sub h) that is spectrally equivalent to the spectral element stiffness matrix K(sub N). The action of the inverse of K(sub h) is expensive for large problems, and is therefore replaced by a Schwarz preconditioner B(sub h) of this finite element stiffness matrix. The preconditioned operator then becomes B(sub h)(exp -l)K(sub N). The technical difficulties stem from the nonregularity of the mesh. Tools to estimate the convergence of a large class of new iterative substructuring and overlapping Schwarz preconditioners are developed. This technique also provides a new analysis for an iterative substructuring method proposed by Pavarino and Widlund for the spectral element discretization.

Casarin, Mario↗

NASA NTRS1990

Experiments with elliptic problem solvers on the Cedar multicluster

The implementation and performance of algorithms for the solution of elliptic problems on the Cedar multiprocessor is examined. The algorithms considered are conjugate gradient schemes with or without preconditioning on a rectangular domain and domain decomposition techniques with overlapping (Schwarz Alternating Method) and nonoverlapping subdomains on a T-shaped domain. Some preliminary results from a current research effort are presented.

Frank, G.↗

NASA NTRS1996

Multigrid with Overlapping Patches

Solving boundary value problems with optimal efficiency requires adaptivity and multilevel techniques. Previously, an implementation of the AFACx algorithm is presented that is based on rectangular Cartesian grids. This implementation does not allow for the over]ap of grids that lie on the same level of refinement. We investigate the case in which these grids overlap. A standard technique for overlapping grids is the Schwarz algorithm. Some ways of using the Schwarz algorithm in a standard multigrid scheme are presented. Also, a problem that arises in some situations with non-aligned, overlapping grids is described. This situation comes up in a natural way when the Schwarz algorithm is used as a relaxation scheme within a multilevel algorithm. We identify the reason for the bad convergence and show that by more sophisticated interpolation the difficulties can be overcome. Then we present a multiplicative Schwarz algorithm for a large number of grids that has a high potential for parallelization. Finally we give some numerical results for the FACx algorithm with overlapping grids on each refinement level. The implementation of the described codes uses C++ and the array class libraries A++ and P++. Using the A++/P++ programming environment, it was possible to move from a serial code to a parallel code within a few days.

Berndt, Markus↗

NASA NTRS1993

Multi-grid domain decomposition approach for solution of Navier-Stokes equations in primitive variable form

The new multigrid (or adaptive) pseudospectral element method was carried out for the solution of incompressible flow in terms of primitive variable formulation. The desired features of the proposed method include the following: (1) the ability to treat complex geometry; (2) high resolution adapted in the interesting areas; (3) requires minimal working space; and (4) effective in a multiprocessing environment. The approach for flow problems, complex geometry or not, is to first divide the computational domain into a number of fine-grid and coarse-grid subdomains with the inter-overlapping area. Next, it is necessary to implement the Schwarz alternating procedure (SAP) to exchange the data among subdomains, where the coarse-grid correction is used to remove the high frequency error that occurs when the data interpolation from the fine-grid subdomain to the coarse-grid subdomain is conducted. The strategy behind the coarse-grid correction is to adopt the operator of the divergence of the velocity field, which intrinsically links the pressure equation, into this process. The solution of each subdomain can be efficiently solved by the direct (or iterative) eigenfunction expansion technique with the least storage requirement, i.e. O(N(exp 3)) in 3-D and O(N(exp 2)) in 2-D. Numerical results of both driven cavity and jet flow will be presented in the paper to account for the versatility of the proposed method.

Ku, Hwar-Ching↗

DOE OSTI2024

Accelerating Multivariate Functional Approximation Computation with Domain Decomposition Techniques⋆

Modeling large datasets through Multivariate Functional Approximations (MFA) provide an elegant way to handle many visualization and scientific analysis workflows. The process necessitates scalable data partitioning methods to compute MFA representations efficiently without compromising the accuracy or continuity of the reconstructed solution. We propose a domain -decomposed method for computing the MFA with B -spline bases, which reduces the total work per task and uses a restricted Additive Schwarz (RAS) method to converge the control point data degrees -of -freedom along subdomain boundaries. We provide an in-depth analysis of the parallel approach with domain decomposition solvers, aiming to minimize local subdomain error residuals and recover high -order continuity at subdomain interfaces with appropriate choices of knot overlaps. The communication cost, determined by the overlap regions in the RAS implementation, is optimized to recover the numerical error profile of the single subdomain case. Our proposed method stands in contrast to previous methods, which typically only recover either C 0 or at best C 1 continuity for arbitrary B -spline degree expansions, or those that require post -processing to blend discontinuities in the reconstructed data. We demonstrate the effectiveness of our approach using analytical and real -world datasets in 1D, 2D, and 3D through both strong and weak scaling studies. The performance results indicate that the overall cost of computing the approximation is directly proportional to the underlying nearest -neighbor communication implementation, and is only weakly dependent on the overlap region size that determines the size of the messages. This finding underscores the efficiency and scalability of our proposed method, making it a promising solution for handling large datasets in scientific workflows.

additive Schwarz solvers↗

DOE OSTI2024

Measurement of the production cross section of a Higgs boson with large transverse momentum in its decays to a pair of τ leptons in proton-proton collisions at s = 13 TeV

A measurement of the production cross section of a Higgs boson with transverse momentum greater than 250GeV is presented where the Higgs boson decays to a pair of τ leptons. It is based on proton-proton collision data collected by the CMS experiment at the CERN LHC at a center-of-mass energy of 13TeV. The data sample corresponds to an integrated luminosity of 138 fb − 1 . Because of the large transverse momentum of the Higgs boson the τ leptons from its decays are boosted and produced spatially close, with their decay products overlapping. Therefore, a dedicated algorithm was developed to reconstruct and identify them. The observed (expected) significance of the measured signal with respect to the standard model background-only hypothesis is 3.5 (2.2) standard deviations. The product of the production cross section and branching fraction is measured to be 1.64 − 0.54 + 0.68 times the standard model expectation. The fiducial differential production cross section is also measured as functions of the Higgs boson and leading jet transverse momenta. This measurement extends the probed large-transverse-momentum region in the ττ final state beyond 600GeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2026

Characterizing the initial state and dynamical evolution in XeXe and PbPb collisions using multiparticle cumulants

For the first time, correlations among mixed-order moments of two or three flow harmonics —( v n k , v m l ) and ( v n k , v m l , v p q ), with k, l, and q denoting the respective orders—are measured in xenon–xenon (XeXe) collisions and compared with lead–lead (PbPb) results, providing a novel probe of collective behavior in heavy ion collisions. These measurements compare a nearly spherical, doubly-magic 208 Pb nucleus to a triaxially deformed 129 Xe nucleus, emphasizing the sensitivity to initial-state geometry fluctuations arising from nuclear deformation. The dependence of these results (v n , n = 2 , 3 , 4 ) on the shape and size of the nuclear overlap region is studied. Comparisons between v 2 , v 3 , and v 4 demonstrate the importance of v 3 and v 4 in exploring the nonlinear hydrodynamic response of the quark-gluon plasma (QGP) to the initial spatial anisotropy. The results constrain initial-state model parameters that influence the evolution of the QGP. The CMS detector was used to collect XeXe and PbPb data at nucleon-nucleon center-of-mass energies of S N N = 5.44 and 5.36 TeV, respectively. Correlations are extracted using multiparticle mixed-harmonic cumulants (up to eight-particle cumulants) with charged particles in the pseudorapidity range |η| < 2.4 and transverse momentum range 0.5 < p T < 3 GeV/c.

CMS↗