Search NASA⌕ Search

SEARCH · Search NASA

Results for “Linear Equation 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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

COMPUTATIONAL MODELING OF IGNITION AND PREMIXED FLAME PROPAGATION INITIATED BY A PRE-CHAMBER TURBULENT JET

Addressing the pressing need for reduced carbon emissions, Turbulent Jet Ignition (TJI) emerges as a promising technology for ultra-lean combustion, offering enhanced thermal efficiencies and minimized cyclic variability in spark-ignited engines. To facilitate rapid testing and integration of this technology, a robust computational modeling framework is crucial. This study delves into the predictive capabilities of computational models for main-chamber ignition and premixed flame propagation using a single-cycle TJI rig measured by Biswas et al. (Applied Thermal Engineering, vol 106, 2016). Employing an open-source compressible flow simulation solver with Large Eddy Simulation (LES) for turbulence modeling, the investigation integrates the conventional Laminar Finite Rate Chemistry (LFRC) model alongside the transported Probability Density Method (PDF) for turbulence-chemistry interaction. A fully-consistent Eulerian Monte-Carlo Fields (EMCF) method is utilized to approximate the transported PDF, while Interaction by Exchange with Mean is employed to close micro-mixing terms in stochastic differential equations. A reduced chemical reaction mechanism with 21 species and 84 reactions (DRM-19) is used for solving chemical kinetics, and a double Gaussian energy deposition model is used to approximate the spark ignition in the pre-chamber. An unstructured O-grid mesh with 0.3 million cells in the prechamber and 1 million cells in the main chamber is employed. Results are divided into two phases: pre-chamber initialization and full TJI simulations. Validation of the predicted pre-chamber flame propagation and the lean ignition in the main-chamber is carried out by using available experimental data. Under quiescent conditions, both the LFRC and transported PDF methods largely underestimate the flame speed and subsequent pressure growth in the pre-chamber. A linear momentum forcing technique is applied to investigate the impact of initial turbulence in the pre-chamber, demonstrating a notable influence on flame propagation. Fine-tuning of the forcing coefficient reproduces the sudden pressure growth observed in the experiment. The experimentally validated pre-chamber simulation serves as the initial condition for the full TJI simulations. It is found that the LFRC model fails to predict lean-ignition in the main-chamber, resulting in a misfiring event. Incorporation of turbulence-chemistry interaction using the transported PDF method substantially improves the prediction of the ignition event in the main-chamber, achieving fair qualitative agreement and quantitative validation of combustion parameters within ±10% of the reported experimental data. The rich simulation results consisting of a full set of statistical description of the thermo-chemical states enable us to gain deep insights into the ignition mechanisms in the main chamber, which is limited when done experimentally. A novel dual ignition phenomenon is revealed in the TJI rig for the first time. Initially, a primary ignition kernel is formed at a downstream location which eventually detaches from the main jet. As the jet momentum decreases, a secondary ignition event follows, this time at a more upstream location which eventually combines with the primary ignition kernel to form a single connected flame front. Investigation of these ignition sequences in chemical composition space reveal distinct differences between the two. The primary ignition event in the main-chamber is followed by a large concentration of active radicals from the pre-chamber jet, accelerating the chain-branching steps, characterizing what has been referred to as flame ignition. In contrast, the secondary ignition occurs in the absence of active radicals in the pre-chamber jet, hence characterized as jet ignition. Further analysis of the effect of pre-chamber jet characteristics on lean ignition in the main-chamber is conducted by setting up cases with different initial pressure ratios (por) between the two chambers, a non-dimensional parameter, ranging from 1.2 to 3.2. As the initial pressure ratio increases, jet momentum increases, with dual ignition observed in cases above por= 2.2. Case with por= 3.2 lead to misfiring. The effect of ignition sequence on global combustion characteristics of TJI is analyzed. Dual ignition events lead to non-monotonicity in combustion characteristics such as global reaction progress variable, flame penetration, and global heat release rate. In dual ignition events, although the rate of fuel consumption and global heat release rate is initially lower, the secondary ignition leads to a sudden increase in flame surface area, resulting in a sudden jump and promoting the overall performance of the TJI system.

42 ENGINEERING↗
DOE OSTI2016

Investigation of the Attila Deterministic Solver for Out-of-Field Organ Dose Calculations for Radiotherapy Patients

An undeniable paradox in the current practice of radiation oncology is that the therapeutic radiation often used to treat cancer is also a known carcinogen. Indeed, the potential for inducing second cancers in patients receiving radiotherapy has been well established. Retrospective epidemiological studies are an important way to assess the risks of late effects in radiotherapy patients. Such investigations attempt to correlate organ dose with the incidence of secondary cancers in a cohort of patients. Individualized patient dosimetry is a critical component of these studies and is challenging for two reasons. First, medical images describing the patient's anatomy are either non-existent or, if they exist, often only cover a portion of the body. This means that whole body computational human phantoms must be used as a surrogate for the patient's true anatomy in order to perform dose calculations far from the treatment site. Second, the gold standard dosimetry approach calls for the use of Monte Carlo radiation transport simulations which are far too slow for studies involving large-scale patient cohorts. This paper describes a preliminary effort at the National Cancer Institute aimed at addressing these dosimetry challenges. The Attila software (Varian Medical Systems, Palo Alto, CA) is investigated as an alternative to Monte Carlo for performing out-of-field organ dose calculations for radiotherapy patients. Whereas as Monte Carlo uses stochastic methods, Attila can deterministically solve the linear Boltzmann equation throughout the entire solution space. It is hypothesized that dose calculations with Attila will offer comparable accuracy to Monte Carlo, but with significant faster computation times. At least one study has demonstrated this for in-field dose calculations [3]. To our knowledge Attila has not yet been used to perform out-of-field organ dosimetry. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2024

A Comprehensive Review of Latent Space Dynamics Identification Algorithms for Intrusive and Non-Intrusive Reduced-Order-Modeling

Numerical solvers of partial differential equations (PDEs) have been widely employed for simulating physical systems. However, the computational cost remains a major bottleneck in various scientific and engineering applications, which has motivated the development of reduced-order models (ROMs). Recently, machine-learning-based ROMs have gained significant popularity and are promising for addressing some limitations of traditional ROM methods, especially for advection dominated systems. In this chapter, we focus on a particular framework known as Latent Space Dynamics Identification (LaSDI), which transforms the high-fidelity data, governed by a PDE, to simpler and low-dimensional latent-space data, governed by ordinary differential equations (ODEs). These ODEs can be learned and subsequently interpolated to make ROM predictions. Each building block of LaSDI can be easily modulated depending on the application, which makes the LaSDI framework highly flexible. In particular, we present strategies to enforce the laws of thermodynamics into LaSDI models (tLaSDI), enhance robustness in the presence of noise through the weak form (WLaSDI), select high-fidelity training data efficiently through active learning (gLaSDI, GPLaSDI), and quantify the ROM prediction uncertainty through Gaussian processes (GPLaSDI). We demonstrate the performance of different LaSDI approaches on Burgers equation, a non-linear heat conduction problem, and a plasma physics problem, showing that LaSDI algorithms can achieve relative errors of less than a few percent and up to thousands of times speed-ups.

Computational Engineering, Finance, and Science (c↗
NASA NTRS2002

Higher Order, Hybrid BEM/FEM Methods Applied to Antenna Modeling

In this presentation, the authors address topics relevant to higher order modeling using hybrid BEM/FEM formulations. The first of these is the limitation on convergence rates imposed by geometric modeling errors in the analysis of scattering by a dielectric sphere. The second topic is the application of an Incomplete LU Threshold (ILUT) preconditioner to solve the linear system resulting from the BEM/FEM formulation. The final tOpic is the application of the higher order BEM/FEM formulation to antenna modeling problems. The authors have previously presented work on the benefits of higher order modeling. To achieve these benefits, special attention is required in the integration of singular and near-singular terms arising in the surface integral equation. Several methods for handling these terms have been presented. It is also well known that achieving ~he high rates of convergence afforded by higher order bases may als'o require the employment of higher order geometry models. A number of publications have described the use of quadratic elements to model curved surfaces. The authors have shown in an EFIE formulation, applied to scattering by a PEC .sphere, that quadratic order elements may be insufficient to prevent the domination of modeling errors. In fact, on a PEC sphere with radius r = 0.58 Lambda(sub 0), a quartic order geometry representation was required to obtain a convergence benefi.t from quadratic bases when compared to the convergence rate achieved with linear bases. Initial trials indicate that, for a dielectric sphere of the same radius, - requirements on the geometry model are not as severe as for the PEC sphere. The authors will present convergence results for higher order bases as a function of the geometry model order in the hybrid BEM/FEM formulation applied to dielectric spheres. It is well known that the system matrix resulting from the hybrid BEM/FEM formulation is ill -conditioned. For many real applications, a good preconditioner is required to obtain usable convergence from an iterative solver. The authors have examined the use of an Incomplete LU Threshold (ILUT) preconditioner . to solver linear systems stemming from higher order BEM/FEM formulations in 2D scattering problems. Although the resulting preconditioner provided aD excellent approximation to the system inverse, its size in terms of non-zero entries represented only a modest improvement when compared with the fill-in associated with a sparse direct solver. Furthermore, the fill-in of the preconditioner could not be substantially reduced without the occurrence of instabilities. In addition to the results for these 2D problems, the authors will present iterative solution data from the application of the ILUT preconditioner to 3D problems.

Fink, P. W.↗
DOE OSTI2017

A Continuous-Discontinuous Hybrid Finite Element Method for S{sub N} Transport

Particle transport phenomenon for neutral particles, such as neutrons and photons, is governed by the linear Boltzmann equation, which is a first-order partial differential equation (PDE). In order to solve the transport equation, discontinuous finite element method (DFEM) is heavily developed. However, the large memory consumption due to the extra degrees of freedom is problematic in multi-D calculations. Another path is to recast the transport equation to a second-order form, such as the well-known self-adjoint angular flux equation (SAAF) and the even parity equations, and spatially discretize the equation using continuous finite element method (CFEM). Yet, such forms generally have problems in void situation as the streaming operator contains a 1/σ{sub t} term and becomes singular in void, which draws numerous efforts on developing void-treatment methods. An intuition to mitigate the shortcomings of both methods is then to develop a method that utilizes DFEM in part of the problem where CFEM has issues while in the other part, CFEM is employed to avoid DFEM's high cost. In this work, we present a novel continuous-discontinuous finite element method (CDFEM) for solving the discrete-ordinates (S{sub N}) transport equations. We perform the hybridization between 1/σ{sub t}-weighted least-squares finite element methods (1/σ{sub t}-LSFEM), with continuous basis functions, and first-order solver. Different solvers are defined in different regions, or subdomains, of the problem. The resulting scheme is such that CFEM-SAAF is performed in subdomains with continuous basis functions while upwinding based DFEM solver is utilized in subdomains with discontinuous basis functions. The connection between subdomains is through an upwinding operation on the interface, which can be performed via the sweep procedure. A foreseeable benefit is such a scheme is compatible with void as first-order DFEM solver can be used in void. On the other hand, as DFEM is only used in part of the problem, CDFEM can effectively avoid the notorious memory consumption of DFEM in multi-D calculation for the future work.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2014

Noiseless Vlasov–Poisson simulations with linearly transformed particles

We introduce a deterministic discrete-particle simulation approach, the Linearly-Transformed Particle-In-Cell (LTPIC) method, that employs linear deformations of the particles to reduce the noise traditionally associated with particle schemes. Formally, transforming the particles is justified by local first order expansions of the characteristic flow in phase space. In practice the method amounts of using deformation matrices within the particle shape functions; these matrices are updated via local evaluations of the forward numerical flow. Because it is necessary to periodically remap the particles on a regular grid to avoid excessively deforming their shapes, the method can be seen as a development of Denavit's Forward Semi-Lagrangian (FSL) scheme (Denavit, 1972 [8]). However, it has recently been established (Campos Pinto, 2012 [20]) that the underlying Linearly-Transformed Particle scheme converges for abstract transport problems, with no need to remap the particles; deforming the particles can thus be seen as a way to significantly lower the remapping frequency needed in the FSL schemes, and hence the associated numerical diffusion. To couple the method with electrostatic field solvers, two specific charge deposition schemes are examined, and their performance compared with that of the standard deposition method. Finally, numerical 1d1v simulations involving benchmark test cases and halo formation in an initially mismatched thermal sheet beam demonstrate some advantages of our LTPIC scheme over the classical PIC and FSL methods. Benchmarked test cases also indicate that, for numerical choices involving similar computational effort, the LTPIC method is capable of accuracy comparable to or exceeding that of state-of-the-art, high-resolution Vlasov schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1997

MFLOP to GFLOP: The Impact on High Fidelity Based Computational Aeroelasticity

Aeroelasticity which involves strong coupling of fluids, structures and controls is an important element in designing an aircraft. Computational aeroelasticity using low fidelity methods such as the linear aerodynamic flow equations coupled with the modal structural equations are well advanced. Though these low fidelity approaches are computationally less intensive, they are not adequate for the analysis of modern aircraft which can experience complex flow/structure interactions. Even at moderate angles of attack supersonic aircraft can experience vortex induced aeroelastic oscillations. Near transonic speeds buffet associated structural oscillations are possible. Aircraft flying in transonic regime may experience a dip in the flutter speed. For accurate aeroelastic computations at these complex fluid/structure interaction situations, high fidelity equations such as the Navier-Stokes for fluids and the finite-elements for structures are needed. Computations using these high fidelity equations require large computational resources both in memory and speed. Current conventional supercomputers have reached their limitations both in memory and speed. As a result, parallel computers have evolved to overco me the limitations of conventional computers. This paper will address the transition that is taking place in computational aeroelasticity from conventional computers to parallel computers. The paper will address special techniques needed to take advantage of the architecture of new parallel computers. Results will be illustrated from computations made on iPSC/860 and IBM SP2 computer by using ENSAERO code that directly couples the Euler/Navier-Stokes flow equations with high resolution finite-element structural equations. Modifications required in both fluids and structural solvers in order to run efficiently on parallel computers will be discussed. Implementation of moving grids and fluid/structural interface on parallel computers will be discussed.

Guruswamy, Guru P.↗
DOE OSTI2021

A solution framework for linear PDE-constrained mixed-integer problems

Abstract We present a general numerical solution method for control problems with state variables defined by a linear PDE over a finite set of binary or continuous control variables. We show empirically that a naive approach that applies a numerical discretization scheme to the PDEs to derive constraints for a mixed-integer linear program (MILP) leads to systems that are too large to be solved with state-of-the-art solvers for MILPs, especially if we desire an accurate approximation of the state variables. Our framework comprises two techniques to mitigate the rise of computation times with increasing discretization level: First, the linear system is solved for a basis of the control space in a preprocessing step. Second, certain constraints are just imposed on demand via the IBM ILOG CPLEX feature of a lazy constraint callback. These techniques are compared with an approach where the relations obtained by the discretization of the continuous constraints are directly included in the MILP. We demonstrate our approach on two examples: modeling of the spread of wildfire and the mitigation of water contamination. In both examples the computational results demonstrate that the solution time is significantly reduced by our methods. In particular, the dependence of the computation time on the size of the spatial discretization of the PDE is significantly reduced.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Real and complex valued geometrical optics inverse ray-tracing for inline field calculations

In this work, a 3-D ray based model for computing laser fields in dissipative and amplifying media is presented. The eikonal equation is solved using inverse ray-tracing on a dedicated nonstructured 3-D mesh. Inverse ray-tracing opens the possibility of using Complex Geometrical Optics (CGO), for which we propose a propagation formalism in a finite element mesh. Divergent fields at caustics are corrected using an etalon integral method for fold-type caustics. This method is successfully applied in dissipative media by modifying the ray-ordering and root selection rules, thereby allowing one to reconstruct the field in the entire caustic region. In addition, we demonstrate how caustics in the CGO framework can disappear entirely for sufficiently dissipative media, making the complex ray approach valid in the entire medium. CGO is shown to offer a more precise modeling of laser refraction and absorption in a dissipative medium when compared to Geometrical Optics (GO). In the framework of Inertial Confinement Fusion (ICF), this occurs mostly at intermediate temperatures or at high temperatures close to the critical density. Additionally, GO is invalid at low temperatures if an approximated expression of the permittivity is used. The inverse ray-tracing algorithm for GO and CGO is implemented in the IFRIIT code, in the framework of a dielectric permittivity described in 3-D using a piecewise linear approximation in tetrahedrons. Fields computed using GO and CGO are compared to results from the electromagnetic wave solver LPSE. Excellent agreement is obtained in 1-D linear and nonlinear permittivity profiles. Good agreement is also obtained for ICF-like Gaussian density profiles in 2-D. Finally, we demonstrate how the model reproduces Gaussian beam diffraction using CGO. The IFRIIT code will be interfaced inline to 3-D radiative hydrodynamic codes to describe the nonlinear laser plasma interaction in ICF and high-energy-density plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Domain-decomposition nonlinear manifold reduced order model

This software combines nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD) techniques. NM-ROMs, which utilize a shallow, sparse autoencoder trained with full order model (FOM) snapshot data, approximate the FOM state on a nonlinear manifold. These models offer advantages over linear-subspace ROMs (LS-ROMs) particularly in scenarios with slowly decaying Kolmogorov n-width. However, the training of NM-ROMs involves a number of parameters that scale with the size of the FOM, and storing high-dimensional FOM snapshots can significantly increase the cost of ROM training for extreme-scale problems. To mitigate these costs, the software employs DD to partition the FOM into smaller subdomains, computes NM-ROMs for each, and then integrates these to form a global NM-ROM. This strategy offers multiple benefits: it enables parallel training of subdomain NM-ROMs, reduces the number of parameters needed, decreases the dimensional requirements of subdomain FOM training data, and allows for customization to the unique characteristics of each FOM subdomain. The use of a shallow, sparse autoencoder architecture in each subdomain NM-ROM facilitates the application of hyper-reduction (HR), simplifying the nonlinear complexities and enhancing computational speed. This software marks the inaugural application of NM-ROM combined with HR to a DD problem. It features an algebraic DD reformulation of the FOM, training of NM-ROMs with HR for each subdomain, and employs a sequential quadratic programming (SQP) solver for the evaluation of the coupled global NMROM. The effectiveness of the DD NM-ROM with HR is numerically demonstrated on the 2D steady-state Burgers' equation, showing an order of magnitude improvement in accuracy over the DD LS-ROM with HR.

Diaz, AlejandroN↗
DOE OSTI2025

Accelerating phase field simulations through a hybrid adaptive Fourier neural operator with U-net backbone

Prolonged contact between a corrosive liquid and metal alloys can cause progressive dealloying. For one such process as liquid-metal dealloying (LMD), phase field models have been developed to understand the mechanisms leading to complex morphologies. However, the LMD governing equations in these models often involve coupled non-linear partial differential equations (PDE), which are challenging to solve numerically. In particular, numerical stiffness in the PDEs requires an extremely refined time step size (on the order of 10 -12 s or smaller). This computational bottleneck is especially problematic when running LMD simulation until a late time horizon is required. This motivates the development of surrogate models capable of leaping forward in time, by skipping several consecutive time steps at-once. In this paper, we propose a U-shaped adaptive Fourier neural operator (U-AFNO), a machine learning (ML) based model inspired by recent advances in neural operator learning. U-AFNO employs U-Nets for extracting and reconstructing local features within the physical fields, and passes the latent space through a vision transformer (ViT) implemented in the Fourier space (AFNO). We use U-AFNOs to learn the dynamics of mapping the field at a current time step into a later time step. We also identify global quantities of interest (QoI) describing the corrosion process (e.g., the deformation of the liquid-metal interface, lost metal, etc.) and show that our proposed U-AFNO model is able to accurately predict the field dynamics, in spite of the chaotic nature of LMD. Most notably, our model reproduces the key microstructure statistics and QoIs with a level of accuracy on par with the high-fidelity numerical solver, while achieving a significant 11, 200 × speed-up on a high-resolution grid when comparing the computational expense per time step. Finally, we also investigate the opportunity of using hybrid simulations, in which we alternate forward leaps in time using the U-AFNO with high-fidelity time stepping. We demonstrate that while advantageous for some surrogate model design choices, our proposed U-AFNO model in fully auto-regressive settings consistently outperforms hybrid schemes.

36 MATERIALS SCIENCE↗
DOE OSTI2015

Impurities in a non-axisymmetric plasma. Transport and effect on bootstrap current

Impurities cause radiation losses and plasma dilution, and in stellarator plasmas the neoclassical ambipolar radial electric field is often unfavorable for avoiding strong impurity peaking. In this work we use a new continuum drift-kinetic solver, the SFINCS code (the Stellarator Fokker-Planck Iterative Neoclassical Conservative Solver) [M. Landreman et al., Phys. Plasmas 21 (2014) 042503] which employs the full linearized Fokker-Planck-Landau operator, to calculate neoclassical impurity transport coefficients for a Wendelstein 7-X (W7-X) magnetic configuration. We compare SFINCS calculations with theoretical asymptotes in the high collisionality limit. We observe and explain a 1/nu-scaling of the inter-species radial transport coefficient at low collisionality, arising due to the field term in the inter-species collision operator, and which is not found with simplified collision models even when momentum correction is applied. However, this type of scaling disappears if a radial electric field is present. We use SFINCS to analyze how the impurity content affects the neoclassical impurity dynamics and the bootstrap current. We show that a change in plasma effective charge Z eff of order unity can affect the bootstrap current enough to cause a deviation in the divertor strike point locations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2017

Diffusion Synthetic Acceleration for High Order S{sub N} Transport on Meshes with Curved Surfaces

Thermal radiation transport is integral to multiphysics applications such as inertial confinement fusion and astrophysics. Materials in these problems can be exceptionally optically thick and diffusive. A transport solver must be capable of accurate and efficient solutions to such problems. Previously, Woods et al. established a proof-of-concept for high order (HO) discontinuous Galerkin finite element (DGFEM) transport on meshes with curved surfaces. They numerically demonstrated the spatial convergence is order p + 1. Remarkably, these convergence rates are relatively invariant to the amount of curvature of the spatial mesh. We present here an extension of this work that demonstrates a rapidly-convergent iterative solver for the FEM transport equations on meshes with curved sides. We use the modified interior penalty (MIP) diffusion synthetic acceleration (DSA) established by Wang and Ragusa. The partially consistent MIP equations stem from the symmetric interior penalty (IP) derivation of the diffusion equation. The IP method is not stable for optically thick cells so it was combined with the diffusion conforming form (DCF), a discretized diffusion equation derived from the discretized S N equations that is not stable for intermediate optical thicknesses. The MIP equations adapt a 'switch' to the IP method in optically thinner regions and the DCF method in optically thicker regions. The literature does not reveal any Fourier analyses performed for iterative transport on meshes with curved surfaces. Wang and Ragusa performed a Fourier analysis for orthogonal meshes and our results appear to be as expected. Previous literature has reported on some of the sensitivities that affect the spectral radius of DSA schemes: polynomial order, and scattering ratios. Presently, we focus on the sensitivity of the spectral radius to polynomial order, scattering ratio, the constant C, and mesh curvature for varying cell thicknesses. We also numerically study the behavior of the spectral radius to verify our DSA implementation. A sequence of problems is designed to exercise the acceleration. As the problems become more optically thick and diffusive, the accelerated solution continues to converge toward the analytic solution. We employ the Modular Finite Element Methods (MFEM) package, developed at Lawrence Livermore National Laboratory, to generate the linear algebraic system of equations for each angle in the discrete ordinates quadrature set, and use UMFPack to solve this system of equations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗
DOE OSTI2024

A fast and accurate domain decomposition nonlinear manifold reduced order model

Here, this paper integrates nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD). NM ROMs approximate the full order model (FOM) state in a nonlinear-manifold by training a shallow, sparse autoencoder using FOM snapshot data. These NM-ROMs can be advantageous over linear-subspace ROMs (LS-ROMs) for problems with slowly decaying Kolmogorov n-width. However, the number of NM-ROM parameters that need to be trained scales with the size of the FOM. Moreover, for “extreme-scale” problems, the storage of high-dimensional FOM snapshots alone can make ROM training expensive. To alleviate the training cost, this paper applies DD to the FOM, computes NM-ROMs on each subdomain, and couples them to obtain a global NM-ROM. This approach has several advantages: Subdomain NM-ROMs can be trained in parallel, involve fewer parameters to be trained than global NM-ROMs, require smaller subdomain FOM dimensional training data, and can be tailored to subdomain specific features of the FOM. The shallow, sparse architecture of the autoencoder used in each subdomain NM-ROM allows application of hyper-reduction (HR), reducing the complexity caused by nonlinearity and yielding computational speedup of the NM-ROM. This paper provides the first application of NM-ROM (with HR) to a DD problem. In particular, this paper details an algebraic DD reformulation of the FOM, training a NM-ROM with HR for each sub domain, and a sequential quadratic programming (SQP) solver to evaluate the coupled global NM-ROM. Theoretical convergence results for the SQP method and a priori and a posteriori error estimates for the DD NM-ROM with HR are provided. The proposed DD NM-ROM with HR approach is numerically compared to a DD LS-ROM with HR on the 2D steady-state Burgers’ equation, showing an order of magnitude improvement in accuracy of the proposed DD NM-ROM over the DD LS-ROM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Response analysis of a laminar premixed M-flame to flow perturbations using a linearized compressible Navier-Stokes solver

The response of a laminar premixed methane-air flame subjected to flow perturbations around a steady state is examined experimentally and using a linearized compressible Navier-Stokes solver with a one-step chemistry mechanism to describe combustion. The unperturbed flame takes an M-shape stabilized both by a central bluff body and by the external rim of a cylindrical nozzle. This base flow is computed by a nonlinear direct simulation of the steady reacting flow, and the flame topology is shown to qualitatively correspond to experiments conducted under comparable conditions. The flame is then subjected to acoustic disturbances produced at different locations in the numerical domain, and its response is examined using the linearized solver. This linear numerical model then allows the componentwise investigation of the effects of flow disturbances on unsteady combustion and the feedback from the flame on the unsteady flow field. It is shown that a wrinkled reaction layer produces hydrodynamic disturbances in the fresh reactant flow field that superimpose on the acoustic field. This phenomenon, observed in several experiments, is fully interpreted here. The additional perturbations convected by the mean flow stem from the feedback of the perturbed flame sheet dynamics onto the flow field by a mechanism similar to that of a perturbed vortex sheet. The different regimes where this mechanism prevails are investigated by examining the phase and group velocities of flow disturbances along an axis oriented along the main direction of the flow in the fresh reactant flow field. It is shown that this mechanism dominates the low-frequency response of the wrinkled shape taken by the flame and, in particular, that it fully determines the dynamics of the flame tip from where the bulk of noise is radiated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2016

Applied Time Domain Stability Margin Assessment for Nonlinear Time-Varying Systems

The baseline stability margins for NASA's Space Launch System (SLS) launch vehicle were generated via the classical approach of linearizing the system equations of motion and determining the gain and phase margins from the resulting frequency domain model. To improve the fidelity of the classical methods, the linear frequency domain approach can be extended by replacing static, memoryless nonlinearities with describing functions. This technique, however, does not address the time varying nature of the dynamics of a launch vehicle in flight. An alternative technique for the evaluation of the stability of the nonlinear launch vehicle dynamics along its trajectory is to incrementally adjust the gain and/or time delay in the time domain simulation until the system exhibits unstable behavior. This technique has the added benefit of providing a direct comparison between the time domain and frequency domain tools in support of simulation validation. This technique was implemented by using the Stability Aerospace Vehicle Analysis Tool (SAVANT) computer simulation to evaluate the stability of the SLS system with the Adaptive Augmenting Control (AAC) active and inactive along its ascent trajectory. The gains for which the vehicle maintains apparent time-domain stability defines the gain margins, and the time delay similarly defines the phase margin. This method of extracting the control stability margins from the time-domain simulation is relatively straightforward and the resultant margins can be compared to the linearized system results. The sections herein describe the techniques employed to extract the time-domain margins, compare the results between these nonlinear and the linear methods, and provide explanations for observed discrepancies. The SLS ascent trajectory was simulated with SAVANT and the classical linear stability margins were evaluated at one second intervals. The linear analysis was performed with the AAC algorithm disabled to attain baseline stability margins. At each time point, the system was linearized about the current operating point using Simulink's built-in solver. Each linearized system in time was evaluated for its rigid-body gain margin (high frequency gain margin), rigid-body phase margin, and aero gain margin (low frequency gain margin) for each control axis. Using the stability margins derived from the baseline linearization approach, the time domain derived stability margins were determined by executing time domain simulations in which axis-specific incremental gain and phase adjustments were made to the nominal system about the expected neutral stability point at specific flight times. The baseline stability margin time histories were used to shift the system gain to various values around the zero margin point such that a precise amount of expected gain margin was maintained throughout flight. When assessing the gain margins, the gain was applied starting at the time point under consideration, thereafter following the variation in the margin found in the linear analysis. When assessing the rigid-body phase margin, a constant time delay was applied to the system starting at the time point under consideration. If the baseline stability margins were correctly determined via the linear analysis, the time domain simulation results should contain unstable behavior at certain gain and phase values. Examples will be shown from repeated simulations with variable added gain and phase lag. Faithfulness of margins calculated from the linear analysis to the nonlinear system will be demonstrated.

Kiefer, J. M.↗
DOE OSTI2013

A semi-intrusive deterministic approach to uncertainty quantification in non-linear fluid flow problems

This paper deals with the formulation of a semi-intrusive (SI) method allowing the computation of statistics of linear and non linear PDEs solutions. This method shows to be very efficient to deal with probability density function of whatsoever form, long-term integration and discontinuities in stochastic space. Given a stochastic PDE where randomness is defined on Ω, starting from (i) a description of the solution in term of a space variables, (ii) a numerical scheme defined for any event ω∈Ω and (iii) a (family) of random variables that may be correlated, the solution is numerically described by its conditional expectancies of point values or cell averages and its evaluation constructed from the deterministic scheme. One of the tools is a tessellation of the random space as in finite volume methods for the space variables. Then, using these conditional expectancies and the geometrical description of the tessellation, a piecewise polynomial approximation in the random variables is computed using a reconstruction method that is standard for high order finite volume space, except that the measure is no longer the standard Lebesgue measure but the probability measure. This reconstruction is then used to formulate a scheme on the numerical approximation of the solution from the deterministic scheme. This new approach is said semi-intrusive because it requires only a limited amount of modification in a deterministic solver to quantify uncertainty on the state when the solver includes uncertain variables. The effectiveness of this method is illustrated for a modified version of Kraichnan–Orszag three-mode problem where a discontinuous pdf is associated to the stochastic variable, and for a nozzle flow with shocks. The results have been analyzed in terms of accuracy and probability measure flexibility. Finally, the importance of the probabilistic reconstruction in the stochastic space is shown up on an example where the exact solution is computable, the viscous Burgers equation.

97 MATHEMATICS AND COMPUTING↗