Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear solver”

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.

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

At least 847 records · Page 47

An explicit, energy-conserving particle-in-cell scheme

We present an explicit temporal discretization of particle-in-cell schemes for the non-relativistic Vlasov equation that results in exact energy conservation when combined with an appropriate spatial discretization. The scheme is inspired by a simple, second-order explicit scheme that conserves energy exactly in the Eulerian context. We show that direct translation to particle-in-cell does not result in strict conservation, but derive a simple correction based on an analytically solvable optimization problem that recovers conservation. While this optimization problem is not guaranteed to have a real solution for every particle, we provide a correction that makes imaginary values extremely rare and still admits $\mathcal{O}$(10 –12 ) fractional errors in energy for practical simulation parameters. We present the scheme in both electrostatic – where we use the Ampère formulation – and electromagnetic contexts. With an electromagnetic field solve, the field update is most naturally linearly implicit, but the more computationally intensive particle update remains fully explicit. Here, we also show how the scheme can be extended to use the fully explicit leapfrog and pseudospectral analytic time-domain (PSATD) field solvers. The scheme is tested on standard kinetic plasma problems, confirming its conservation properties.

Energy conservation↗

AREPO-RT : radiation hydrodynamics on a moving mesh

We introduce AREPO-RT , a novel radiation hydrodynamic (RHD) solver for the unstructured moving-mesh code AREPO . Our method solves the moment-based radiative transfer equations using the M1 closure relation. We achieve second-order convergence by using a slope-limited linear spatial extrapolation and a first-order time prediction step to obtain the values of the primitive variables on both sides of the cell interface. A Harten–Lax–van Leer flux function, suitably modified for moving meshes, is then used to solve the Riemann problem at the interface. The implementation is fully conservative and compatible with the individual time-stepping scheme of AREPO . It incorporates atomic hydrogen (H) and helium (He) thermochemistry, which is used to couple the ultraviolet radiation field to the gas. Additionally, infrared (IR) radiation is coupled to the gas under the assumption of local thermodynamic equilibrium between the gas and the dust. We successfully apply our code to a large number of test problems, including applications such as the expansion of HII regions, radiation pressure-driven outflows, and the levitation of optically thick layer of gas by trapped IR radiation. The new implementation is suitable for studying various important astrophysical phenomena, such as the effect of radiative feedback in driving galactic scale outflows, radiation-driven dusty winds in high-redshift quasars, or simulating the reionization history of the Universe in a self-consistent manner.

79 ASTRONOMY AND ASTROPHYSICS↗

Multiscale formulation of frictional contact mechanics at the pore scale

Direct numerical simulation (DNS) yields the highest fidelity predictions of mechanical deformation at the pore scale, but is prohibitively expensive for analyzing large or many samples. Discrete element methods (DEM) are an efficient alternative, but are limited to granular media and incapable of estimating or controlling prediction errors. We present a pore-level multiscale method (PLMM) that approximates DNS efficiently and with controllable accuracy. We focus on the linear elastic response of a consolidated geologic porous medium with arbitrary microstructure, heterogeneous mineralogy, containing cracks or defects. PLMM decomposes the solid phase into non-overlapping subdomains, on which local basis functions are constructed. The bases are then coupled with a global interface problem that accounts for slip or stick contact conditions between the subdomains. PLMM produces an initial, but accurate, approximation to DNS that can be iteratively improved. It is amenable to parallelism and allows for different mesh, models, and physics in each subdomain. An algebraic interpretation of PLMM as a preconditioner is also presented to allow non-intrusive implementation into existing solvers. Lastly, this work extends previous developments of PLMM in fluid dynamics to solid mechanics and enables future extensions towards modeling coupled flow and mechanics problems.

42 ENGINEERING↗

A variational framework for residual-based adaptivity in neural PDE solvers and operator learning

Residual-based adaptive strategies are widely used in scientific machine learning yet remain largely heuristic. We introduce a variational framework that formalizes these methods through convex transformations of the residual, where different transformations correspond to distinct objective functionals. For instance, exponential weights target uniform error minimization, while linear weights recover quadratic error minimization. This perspective reveals adaptive weighting as a means of selecting sampling distributions that optimize a primal objective, directly linking discretization choices to error metrics. This principled approach yields three key benefits: it enables systematic design of adaptive schemes, reduces discretization error by lowering estimator variance, and enhances learning dynamics by improving gradient signal-to-noise ratio. Extending the framework to operator learning, we demonstrate substantial performance gains across diverse optimizers and architectures. Our results provide a theoretical perspective for residual-based adaptivity and establish a foundation for principled discretization and training.

97 MATHEMATICS AND COMPUTING↗

Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement

The standard LU factorization-based solution process for linear systems can be enhanced in speed or accuracy by employing mixed-precision iterative refinement. Most recent work has focused on dense systems. We investigate the potential of mixed-precision iterative refinement to enhance methods for sparse systems based on approximate sparse factorizations. In doing so, we first develop a new error analysis for LU- and GMRES-based iterative refinement under a general model of LU factorization that accounts for the approximation methods typically used by modern sparse solvers, such as low-rank approximations or relaxed pivoting strategies. We then provide a detailed performance analysis of both the execution time and memory consumption of different algorithms, based on a selected set of iterative refinement variants and approximate sparse factorizations. Our performance study uses the multifrontal solver MUMPS, which can exploit block low-rank factorization and static pivoting. We evaluate the performance of the algorithms on large, sparse problems coming from a variety of real-life and industrial applications showing that mixed-precision iterative refinement combined with approximate sparse factorization can lead to considerable reductions of both the time and memory consumption.

97 MATHEMATICS AND COMPUTING↗

THE ANGULAR DISTRIBUTION OF Ly{alpha} RESONANT PHOTONS EMERGING FROM AN OPTICALLY THICK MEDIUM

We investigate the angular distribution of Ly{alpha} photons scattering or emerging from an optically thick medium. Since the evolution of specific intensity I in frequency space and angular space are coupled with each other, we first develop the WENO numerical solver to find the time-dependent solutions of the integro-differential equation of I in frequency and angular space simultaneously. We first show that the solutions with the Eddington approximation, which assume that I is linearly dependent on the angular variable {mu}, yield similar frequency profiles of the photon flux as those without the Eddington approximation. However, the solutions of the {mu} distribution evolution are significantly different from those given by the Eddington approximation. First, the angular distribution of I is found to be substantially dependent on the frequency of the photons. For photons with the resonant frequency {nu}{sub 0}, I contains only a linear term of {mu}. For photons with frequencies at the double peaks of the flux, the {mu}-distribution is highly anisotropic; most photons are emitted radially forward. Moreover, either at {nu}{sub 0} or at the double peaks, the {mu} distributions actually are independent of the initial {mu} distribution of photons of the source. This is because the photons with frequencies either at {nu}{sub 0} or the double peaks undergo the process of forgetting their initial conditions due to resonant scattering. We also show that the optically thick medium is a collimator of photons at the double peaks. Photons from the double peaks form a forward beam with a very small opening angle.

79 ASTRONOMY AND ASTROPHYSICS↗

Extremized nonlinear and linearized responses in soft metamaterials enabled by gradient-based design and grayscale digital light processing

In this study, we develop a gradient-based design approach that exploits grayscale digital light processing (DLP) 3D printing for extremizing the nonlinear and linearized response of soft metamaterials — materials that harness engineered geometric instabilities to undergo large and programmable changes in configuration. Grayscale DLP approaches modulate local mechanical properties at the pixel scale by tuning the light intensity within a single grayscale image, unlocking an exceptionally large design space. To effectively navigate this space, we develop smooth mappings between local light intensity values and global quantities of interest that characterize the behavior of soft metamaterials. Enabling these smooth mappings are robust and differentiable nonlinear finite element simulations powered by a trust region solver. A PDE-constrained optimization problem is then solved to invert these mappings and produce light intensity distributions that endow the printed part with varying stiffness and flexibility in distinctive regions. It is shown that optimizing the distribution of soft and stiff phases throughout a metamaterial structure results in markedly different buckling and self-contact configurations to drive extremized nonlinear compression and linearized vibration responses. Optimized light intensity distributions are translated to grayscale images and directly used to print soft metamaterial samples, showing remarkable agreement between the buckling and self-contact response in simulated and measured deformed configurations.

Additive manufacturing↗

Cosmic microwave background constraints for global strings and global monopoles

We present the first cosmic microwave background (CMB) power spectra from numerical simulations of the global O( N ) linear σ-model, with N =2,3, which have global strings and monopoles as topological defects. In order to compute the CMB power spectra we compute the unequal time correlators (UETCs) of the energy-momentum tensor, showing that they fall off at high wave number faster than naive estimates based on the geometry of the defects, indicating non-trivial (anti-)correlations between the defects and the surrounding Goldstone boson field. We obtain source functions for Einstein-Boltzmann solvers from the UETCs, using a recently developed method that improves the modelling at the radiation-matter transition. We show that the interpolation function that mimics the transition is similar to other defect models, but not identical, confirming the non-universality of the interpolation function. The CMB power spectra for global strings and global monopoles have the same overall shape as those obtained using the non-linear σ-model approximation, which is well captured by a large- N calculation. However, the amplitudes are larger than the large- N calculation would naively predict, and in the case of global strings much larger: a factor of 20 at the peak. Finally we compare the CMB power spectra with the latest CMB data in other to put limits on the allowed contribution to the temperature power spectrum at multipole l = 10 of 1.7% for global strings and 2.4% for global monopoles. These limits correspond to symmetry-breaking scales of 2.9× 10{sup 15} GeV (6.3× 10{sup 14} GeV with the expected logarithmic scaling of the effective string tension between the simulation time and decoupling) and 6.4× 10{sup 15} GeV respectively. The bound on global strings is a significant one for the ultra-light axion scenario with axion masses m {sub a} ∼< 10{sup −28} eV . These upper limits indicate that gravitational waves from global topological defects will not be observable at the gravitational wave observatory LISA.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Comparison of Classical and Aggregation-Based Algebraic Multigrid Preconditioners for High-Fidelity Simulation of Wind Turbine Incompressible Flows

This paper presents a comparison of parallel strong scaling performance of classical and aggregation algebraic multigrid (AMG) preconditioners in the context of wind turbine simulations. Fluid motion is governed by the incompressible Navier--Stokes equations, discretized in space with control-volume finite elements and in time with an inexact projection scheme using an implicit integrator. A discontinuous-Galerkin sliding-mesh algorithm captures rotor motion. The momentum equations are solved with iterative Krylov methods, preconditioned by symmetric Gauss--Seidel (SGS) in Trilinos and $\ell_1$ SGS in hypre. The mass-continuity equation is solved with GMRES preconditioned by AMG and can account for the majority of simulation time. Reducing this continuity solve time is crucial. Wind turbine simulations present two unique challenges for AMG preconditioned solvers: the computational meshes include strongly anisotropic elements, and mesh motion requires matrix reinitialization and computation of preconditioners at each time step. Detailed timing profiles are presented and analyzed, and best practices are discussed for both classical and aggregation-based AMG. Results are presented for simulations of two different wind turbines with up to 6 billion grid points on two different computer architectures. For moving mesh problems that require linear-system reinitialization, the well-established strategy of amortizing preconditioner setup costs over a large number of time steps to reduce the solve time is no longer valid. Instead, results show that faster time to solution is achieved by reducing preconditioner setup costs at the expense of linear-system solve costs. Standard smoothed aggregation with Chebyshev relaxation was found to perform poorly when compared with classical AMG in terms of solve time and robustness. However, plain aggregation was comparable to classical AMG.

97 MATHEMATICS AND COMPUTING↗

Preconditioned steepest descent methods for some nonlinear elliptic equations involving p-Laplacian terms

We describe and analyze preconditioned steepest descent (PSD) solvers for fourth and sixth-order nonlinear elliptic equations that include p-Laplacian terms on periodic domains in 2 and 3 dimensions. The highest and lowest order terms of the equations are constant-coefficient, positive linear operators, which suggests a natural preconditioning strategy. Such nonlinear elliptic equations often arise from time discretization of parabolic equations that model various biological and physical phenomena, in particular, liquid crystals, thin film epitaxial growth and phase transformations. The analyses of the schemes involve the characterization of the strictly convex energies associated with the equations. We first give a general framework for PSD in Hilbert spaces. Based on certain reasonable assumptions of the linear pre-conditioner, a geometric convergence rate is shown for the nonlinear PSD iteration. We then apply the general theory to the fourth and sixth-order problems of interest, making use of Sobolev embedding and regularity results to confirm the appropriateness of our pre-conditioners for the regularized p-Lapacian problems. Our results include a sharper theoretical convergence result for p-Laplacian systems compared to what may be found in existing works. We demonstrate rigorously how to apply the theory in the finite dimensional setting using finite difference discretization methods. Numerical simulations for some important physical application problems – including thin film epitaxy with slope selection and the square phase field crystal model – are carried out to verify the efficiency of the scheme.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

An integral equation-based numerical solver for Taylor states in toroidal geometries

Here we present an algorithm for the numerical calculation of Taylor states in toroidal and toroidal-shell geometries using an analytical framework developed for the solution to the time-harmonic Maxwell equations. Taylor states are a special case of what are known as Beltrami fields, or linear force-free fields. The scheme of this work relies on the generalized Debye source representation of Maxwell fields and an integral representation of Beltrami fields which immediately yields a well-conditioned second-kind integral equation. This integral equation has a unique solution whenever the Beltrami parameter λ is not a member of a discrete, countable set of resonances which physically correspond to spontaneous symmetry breaking. Several numerical examples relevant to magnetohydrodynamic equilibria calculations are provided. Lastly, our approach easily generalizes to arbitrary geometries, both bounded and unbounded, and of varying genus.

42 ENGINEERING↗

Sensitivity analysis on chaotic dynamical systems by Non-Intrusive Least Squares Shadowing (NILSS)

This paper develops the Non-Intrusive Least Squares Shadowing (NILSS) method, which computes the sensitivity for long-time averaged objectives in chaotic dynamical systems. In NILSS, we represent a tangent solution by a linear combination of one inhomogeneous tangent solution and several homogeneous tangent solutions. Next, we solve a least squares problem using this representation; thus, the resulting solution can be used for computing sensitivities. NILSS is easy to implement with existing solvers. In addition, for chaotic systems with many degrees of freedom but few unstable modes, NILSS has a low computational cost. NILSS is applied to two chaotic PDE systems: the Lorenz 63 system and a CFD simulation of flow over a backward-facing step. In both cases, the sensitivities computed by NILSS reflect the trends in the long-time averaged objectives of dynamical systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A process to verify numerical models for seismic fluid-structure interaction in advanced reactor vessels

Seismic design and qualification of a liquid-filled advanced nuclear reactor will have to account for fluid-structure interaction (FSI). Interaction between the tank, internal components, and contained liquid will rely on analysis of numerical models that must be verified and validated. Here this study demonstrates a verification process for models of a base-supported cylindrical tank by comparing numerical predictions and analytical solutions. The numerical models are consistent with the assumptions made to derive analytical solutions, namely, either a rigid or a linear elastic tank, ideal fluid, and small-amplitude, unidirectional, horizontal inputs. One software platform is used to illustrate the process. Seismic FSI analysis is performed using the Arbitrary Lagrangian-Eulerian (ALE) and Incompressible Computational Fluid Dynamics (ICFD) solvers in LS-DYNA. Reported responses are those used for design, including hydrodynamic pressures on the tank wall, shear forces and moments at the tank base, and wave heights of the contained liquid. The accuracy of the numerical results is discussed. The numerical models are verified for calculating the pressures on the tank wall and reactions at its base. Accurate simulation of wave action is challenging for both solvers. Recommendations for modeling, code development, and steps for verification are provided. Although focused on reactor vessels and one software platform, the verification process described herein is broadly applicable to liquid-filled vessels and other finite element codes.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Observation of nonlinear bands in near-field scanning optical microscopy of a photonic-crystal waveguide

We have measured the photonic bandstructure of GaAs photonic-crystal waveguides with high resolution in energy as well as in momentum using near-field scanning optical microscopy. Intriguingly, we observe additional bands that are not predicted by eigenmode solvers, as was recently demonstrated by Huisman et al. [Phys. Rev. B 86, 155154 (2012)]. We study the presence of these additional bands by performing measurements of these bands while varying the incident light power, revealing a non-linear power dependence. Here, we demonstrate experimentally and theoretically that the observed additional bands are caused by a waveguide-specific near-field tip effect not previously reported, which can significantly phase-modulate the detected field.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Scaling Structured Multigrid to 500K+ Cores Through Coarse-Grid Redistribution

The effcient solution of sparse, linear systems resulting from the discretization of partial differential equations is crucial to the performance of many physics-based simulations. The algorithmic optimality of multilevel approaches for common discretizations makes them a good candidate for an efficient parallel solver. Yet, modern architectures for high-performance computing systems continue to challenge the parallel scalability of multilevel solvers. While algebraic multigrid methods are robust for solving a variety of problems, the increasing importance of data locality and cost of data movement in modern architectures motivates the need to carefully exploit structure in the problem. Robust logically structured variational multigrid methods, such as Black Box Multigrid (BoxMG), maintain structure throughout the multigrid hierarchy. This avoids indirection and increased coarse- grid communication costs typical in parallel algebraic multigrid. Nevertheless, the parallel scalability of structured multigrid is challenged by coarse-grid problems where the overhead in communication dominates computation. In this paper, an algorithm is introduced for redistributing coarse-grid problems through incremental agglomeration. Guided by a predictive performance model, this algorithm provides robust redistribution decisions for structured multilevel solvers. A two-dimensional diffusion problem is used to demonstrate the significant gain in performance of this algorithm over the previous approach that used agglomeration to one processor. In addition, the parallel scalability of this approach

97 MATHEMATICS AND COMPUTING↗

Towards an Analysis of the GhostFluid Method

The GhostFluid method is built on the premise that a material interface, such as that shown in Figure 1 (a), can be discretized as two distinct materials that communicate, indirectly, via ghostcells. The situation is shown pictorially in Figure 1 (b). The attraction of the approach is that the two halves of the problem can be integrated using a regular, single material scheme, with none of the complex, book-keeping normally associated with a multi-material solver. On the down side, the reliability of the approach rests with the filling of the ghost states. Specifically, the states must be chosen such that the resultant evolution is consistent with the full problem, and for non-linear systems, there is no guarantee that satisfactory states actually exist.

36 MATERIALS SCIENCE↗

Exploiting Identical Generators in Unit Commitment

Here, we present sufficient conditions under which thermal generators can be aggregated in mixed-integer linear programming (MILP) formulations of the unit commitment (UC) problem, while maintaining feasibility and optimality for the original disaggregated problem. Aggregating thermal generators with identical characteristics (e.g., minimum/maximum power output, minimum up/down-time, and cost curves) into a single unit reduces redundancy in the search space induced by both exact symmetry (permutations of generator schedules) and certain classes of mutually non-dominated solutions. We study the impact of aggregation on two large-scale UC instances, one from the academic literature and another based on real-world operator data. Our computational tests demonstrate that when present, identical generators can negatively affect the performance of modern MILP solvers on UC formulations. Further, we show that our reformation of the UC MILP through aggregation is an effective method for mitigating this source of computational difficulty.

97 MATHEMATICS AND COMPUTING↗

An efficient high-order numerical solver for diffusion equations with strong anisotropy

In this paper, we present an interior penalty discontinuous Galerkin finite element scheme for solving diffusion problems with strong anisotropy arising in magnetized plasmas for fusion applications. Additionally, we demonstrate the accuracy produced by the high-order scheme and develop an efficient preconditioning technique to solve the corresponding linear system, which is robust to the mesh size and anisotropy of the problem. Several numerical tests are provided to validate the accuracy and efficiency of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗