Search NASA⌕ Search

SEARCH · Search NASA

Results for “problem”

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 127 records · Page 7

Improved Bayesian regularization of inverse problems in vibrations and acoustics using noise-only measurements

Here, this paper studies Tikhonov regularization (ridge regression) parameter selection for problems in vibrations and acoustics. The selection method is based on a popular Bayesian method, but it incorporates measurements of sensor noise. The regularization parameter is closely related to the ratio of system input energy to noise energy, so noise measurements inform the inference procedure and improve parameter identification. In cases where standard Bayesian regularization identifies zero as the optimal regularization parameter, noise measurements guarantee a unique nonzero optimum. Sufficient theoretical criteria are developed for this guarantee. The method is verified in even-determined and under-determined configurations in an acoustic source localization simulation and a vibration load identification experiment. It is shown to yield significant improvements over existing empirical Bayesian regularization. Improvements are larger in the even-determined case and smaller in the under-determined case, wherein the inverse solution is less sensitive to the regularization parameter.

42 ENGINEERING↗

Dynamic flux surrogate-based partitioned methods for interface problems

Loosely coupled partitioned methods for multiphysics problems treat each subproblem as a separate entity and advance them independently in time. In so doing these methods enable code reuse, increase concurrency and provide a convenient framework for plug-and-play multiphysics simulations. However, mathematically loosely coupled schemes are equivalent to a single step of an iterative solution method, which can compromise their accuracy and stability. We present a new data-driven partitioned method for coupled parametric PDEs that can improve upon the accuracy of traditional loosely coupled methods without incurring a performance penalty. To that end, we replace conventional field transfers across the interface by a surrogate for the dynamics of the interface flux exchanged between the subdomains. To develop this surrogate we apply dynamic mode decomposition to a non-standard staggered-in-time state, comprising the interface flux and small solution patches near the interface. The new approach shifts the main computational burden to an offline training phase, whereas application of the surrogate in the online phase amounts to a single matrix–vector multiplication. In conclusion, we provide stability analysis of the surrogate-based partitioned scheme and include numerical results that demonstrate its potential.

Dynamic mode decomposition (DMD)↗

Adaptive Interface-PINNs (AdaI-PINNs) for inverse problems: Determining material properties for heterogeneous systems

Here, we determine spatially varying discontinuous material properties using a domain-decomposition based physics-informed neural networks (PINNs) framework named the Adaptive Interface-PINNs or AdaI-PINNs (Roy et al., 2024). We propose the use of distinct neural networks for the field variables and material properties within each material, utilizing adaptive activation functions. While the neural networks across different materials share the same weights and biases, their activation functions are uniquely tailored using a hyperparameter that influences the slope of the activation function. The proposed framework is tested on several one-dimensional and two-dimensional benchmark examples, and its performance is compared with conventional PINNs and existing domain-decomposition PINNs frameworks, namely, the Multi-domain physics-informed neural network (M-PINN), and the eXtended physics-informed neural networks (XPINNs). The results demonstrate that the proposed approach can determine randomly distributed discontinuous material properties with an L 2 error of $\mathscr{O}$ (10 -3 ) for the material property and the root-mean-square error of $\mathscr{O}$ (10 -3 ) for the primary variable while the other approaches yield errors that are approximately two orders of magnitude larger (that is, $\mathscr{O}$ (10 -1 )). Moreover, the spatial distribution of material properties obtained using the proposed framework is in close agreement with the true distribution, whereas the other approaches fare much worse. Additionally, the proposed approach is approximately 40% faster than its competitors, indicating its potential as a robust alternative for solving inverse problems in heterogeneous materials.

36 MATERIALS SCIENCE↗

Scalable semidefinite programming approach to variational embedding for quantum many-body problems

In quantum embedding theories, a quantum many-body system is divided into localized clusters of sites which are treated with an accurate ‘high-level’ theory and glued together self-consistently by a less accurate ‘low-level’ theory at the global scale. The recently introduced variational embedding approach for quantum many-body problems combines the insights of semidefinite relaxation and quantum embedding theory to provide a lower bound on the ground-state energy that improves as the cluster size is increased. The variational embedding method is formulated as a semidefinite program (SDP), which can suffer from poor computational scaling when treated with black-box solvers. Here, we exploit the interpretation of this SDP as an embedding method to develop an algorithm which alternates parallelizable local updates of the high-level quantities with updates that enforce the low-level global constraints. Moreover, we show how translation invariance in lattice systems can be exploited to reduce the complexity of projecting a key matrix to the positive semidefinite cone.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving the “Coloring Problem” in InPd 3– x Ag x ( x = 0–0.7) by Phase Diagrams Modeling and Diffraction Experiments

Here, a series of InPd 3–x Ag x (x = 0–1) compositions were synthesized by conventional high-temperature synthesis, and as-synthesized samples were characterized by powder X-ray diffraction experiments. Up to x = 0.7, InPd 3–x Ag x adopts the ternary substitutional variant of the InPd 3 structure (TiAl 3 -type), when x > 0.7, elemental Ag starts to segregate along with the main phase. Accurate structural characterization in InPd 3–x Ag x faces a critical challenge due to the narrow X-ray scattering contrast among constituents In, Pd, and Ag and nearly identical neutron scattering lengths of Pd and Ag. To overcome this “coloring problem”, a combination of calculation of phase diagrams modeling (CALPHAD) and diffraction techniques (X-ray and neutron) was employed. In the compositional range 0 ≤ x ≤ 0.7, InPd 3–x Ag x presents a ternary variant of the TiAl 3 -type structure, where Ag atoms selectively substitute one (the 2b Wyckoff site) of the two Pd sites in InPd 3 . Notably, in contrast to the isologous InPd 3–x Cu x (x = 0–1) system, Ag substitution does not form an ordered VRh 2 Sn-type structure at the limiting composition. The distinct site preference in InPd 3–x Ag x is elucidated by charge population analysis, electronic structure calculations, and orbital-resolved chemical bonding investigations, and the extent of substitution is supported by formation free energy calculations.

36 MATERIALS SCIENCE↗

Semi-analytic solutions to the Noh problem with a black box EoS

The objective of this paper is to derive a method of constructing semi-analytic solutions to the Noh problem when the equation of state is a black box. Such solutions can be used for verification tests of hydrodynamics codes. We present the underlying theory, the method for finding solutions, and several examples of derived semi-analytic solutions. We end by performing a classic verification convergence test comparing numerical results from a hydrodynamics code against a non-trivial semi-analytic solution.

97 MATHEMATICS AND COMPUTING↗

Genetic programming for the nuclear many-body problem: a guide

Genetic Programming (GP) is an evolutionary algorithm that generates computer programs, or mathematical expressions, to solve complex problems. In this Guide, we demonstrate how to use GP to develop surrogate models to mitigate the computational costs of modeling atomic nuclei with ever increasing complexity. The computational burden escalates when uncertainty quantification is pursued, or when observables must be globally computed for thousands of nuclei. By studying three models in which the mean field depends on the total particle density self-consistently, we show that by constructing reduced order models supported by GP one can speed up many-body computations by several orders of magnitude with a negligible loss in accuracy.

dimensionality reduction↗

Hierarchical Bayesian Inverse Problems: A High-Dimensional Statistics Viewpoint

This paper analyzes hierarchical Bayesian inverse problems using techniques from highdimensional statistics. Furthermore, our analysis leverages a property of hierarchical Bayesian regularizers that we call approximate decomposability to obtain non-asymptotic bounds on the reconstruction error attained by maximum a posteriori estimators. The new theory explains how hierarchical Bayesian models that exploit sparsity, group sparsity, and sparse representations of the unknown parameter can achieve accurate reconstructions in high-dimensional settings.

MAP estimation↗

Exploring Professor Motivations and Implementations of a Real-World Problem-Solving Project

Engineering education literature offers a variety of theoretical and conceptual frameworks for project-based learning. This study explores the implementation of real-world problem-solving projects in engineering education. The research team analyzed the motivations and methods behind professors' adoption of such projects through exploratory qualitative interviews with seven professor participants who integrated a nation-wide student competition into their courses. We analyzed the resulting data using a constructivist grounded theory approach to identify key themes of professor practices. Findings reveal that the real-world aspect of the projects and alignment with values and research interests were primary motivators for implementation. While implementation methods varied significantly based on context (i.e., university setting, course type), we found that these projects could be effectively integrated into various classroom settings. The findings support the recommendation for non-academic institutions to develop and manage competitions that can be integrated into classrooms and which offer a point of engagement that is available to professors from a wide range of disciplines.

42 ENGINEERING↗

Exploring Professor Motivations and Implementations of a Real-World Problem-Solving Project: A Case Study in Preparing Students for the Emerging Building Science Industry: Preprint

Engineering education literature offers a variety of theoretical and conceptual frameworks for project-based learning. This study explores the implementation of real-world problem-solving projects in engineering education. The research team analyzed the motivations and methods behind professors' adoption of such projects through exploratory qualitative interviews with seven professor participants who integrated a nation-wide student competition into their courses. We analyzed the resulting data using a constructivist grounded theory approach to identify key themes of professor practices. Findings reveal that the real-world aspect of the projects and alignment with values and research interests were primary motivators for implementation. While implementation methods varied significantly based on context (i.e., university setting, course type), we found that these projects could be effectively integrated into various classroom settings. The findings support the recommendation for non-academic institutions to develop and manage competitions that can be integrated into classrooms and which offer a point of engagement that is available to professors from a wide range of disciplines.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A GPU Accelerated Mixed‐Precision Finite Difference Informed Random Walker (FDiRW) Solver for Strongly Inhomogeneous Diffusion Problems

In nature, many complex multi‐physics coupling problems exhibit significant diffusivity inhomogeneity, where one process occurs several orders of magnitude faster than others temporally. Simulating rapid diffusion alongside slower processes demands intensive computational resources due to the necessity for small time steps. To address these computational challenges, we have developed an efficient numerical solver named Finite Difference informed Random Walker (FDiRW). In this study, we propose a GPU‐accelerated, mixed‐precision configuration for the FDiRW solver to maximize efficiency through GPU multi‐threaded parallel computation and lower precision computation. Numerical evaluation results reveal that the proposed GPU‐accelerated mixed‐precision FDiRW solver can achieve a 117× speedup over the CPU baseline, while an additional 1.75× speedup is achieved by employing lower precision GPU computation. Notably, for large model sizes, the GPU‐accelerated mixed‐precision FDiRW solver demonstrates strong scaling with the number of nodes used in simulation. When simulating radionuclide absorption processes by porous wasteform particles with a medium‐sized model of 192 × 192 × 192, this approach reduces the total computational time to 10 min, enabling the simulation of larger systems with strongly inhomogeneous diffusivity.

97 MATHEMATICS AND COMPUTING↗

Optimal Polynomial Smoothers and One‐Sided V‐Cycles for Poisson Problems

The solution to the Poisson equation arising from the spectral element discretization of the incompressible Navier‐Stokes equations needs robust preconditioning strategies. One such strategy is multigrid. To realize the potential of multigrid methods, effective smoothing strategies are needed. Chebyshev polynomial smoothers, in conjunction with pointwise Jacobi or additive Schwarz methods (ASMs), prove to be an effective smoother. Other polynomial smoothers, however, may provide superior convergence to the multigrid preconditioner. The authors compare the standard Chebyshev polynomial smoothers to both the novel fourth‐kind Chebyshev polynomial smoothers proposed by Lottes as well as smoothers based on the polynomial of best uniform approximation to as proposed by Kraus, Vassilevski, and Zikatanov. At the cost of symmetry, further improvements may be made. For example, a order polynomial smoother on both sides of the V‐cycle may be substituted with an order polynomial smoother on one side at no additional cost. The choice of omitting the postsmoother in favor of higher‐order polynomial presmoothing is advantageous in cases where the multigrid approximation property constant is large. The authors consider a 2D model problem based on finite differences to motivate the choice of polynomial smoother, order, and whether to apply postsmoothing for the target application of high‐order ‐geometric multigrid methods for GPU architectures. Results from both domains demonstrate the substantial improvement of these approaches over the standard Chebyshev polynomial smoother with a symmetric V‐cycle.

97 MATHEMATICS AND COMPUTING↗

Leptogenesis in parity solutions to the strong CP problem and Standard Model parameters

We study the simplest theories with exact spacetime parity that solve the strong CP problem and successfully generate the cosmological baryon asymmetry via decays of right-handed neutrinos. Lower bounds are derived for the masses of the right-handed neutrinos and for the scale of spontaneous parity breaking, v R . For generic thermal leptogenesis, v R ≳ 10 12 GeV, unless the small observed neutrino masses arise from fine-tuning. We compute v R in terms of the top quark mass, the QCD coupling, and the Higgs boson mass and find this bound is consistent with current data at 1σ. Future precision measurements of these parameters may provide support for the theory or, if v R is determined to be below 10 12 GeV, force modifications. However, modified cosmologies do not easily allow reductions in v R — no reduction is possible if leptogenesis occurs in the collisions of domain walls formed at parity breaking, and at most a factor 10 reduction is possible with non-thermal leptogenesis. Standard Model parameters that yield low values for v R can only be accommodated by having a high degree of degeneracy among the right-handed neutrinos involved in leptogenesis. If future precision measurements determine v R to be above 10 12 GeV, it is likely that higher-dimensional operators of the theory will yield a neutron electric dipole moment accessible to ongoing experiments. This is especially true in a simple UV completion of the neutrino sector, involving gauge singlet fermions, where the bound from successful leptogenesis is strengthened to v R ≳ 10 13 GeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

All loop scattering as a counting problem

Abstract This is the first in a series of papers presenting a new understanding of scattering amplitudes based on fundamentally combinatorial ideas in the kinematic space of the scattering data. We study the simplest theory of colored scalar particles with cubic interactions, at all loop orders and to all orders in the topological ’t Hooft expansion. We find novel integral formulas for the amplitudes of this theory, with no trace of the conventional sum over Feynman diagrams, but instead determined by a beautifully simple counting problem attached to any order of the topological expansion. These results represent a significant step forward in the decade-long quest to formulate the fundamental physics of the real world in a radically new language, where the rules of spacetime and quantum mechanics, as reflected in the principles of locality and unitarity, are seen to emerge from deeper mathematical structures.

1/N Expansion↗

Outcomes and Conclusions from the 2022 AM Bench Measurements, Challenge Problems, Modeling Submissions, and Conference

The Additive Manufacturing Benchmark Test Series (AM Bench) provides rigorous measurement data for validating additive manufacturing (AM) simulations for a broad range of AM technologies and material systems. AM Bench includes extensive in situ and ex situ measurements, simulation challenges for the AM modeling community, and a corresponding conference series. In 2022, the second round of AM Bench measurements, challenge problems, and conference were completed, focusing primarily upon laser powder bed fusion (LPBF) processing of metals, and both material extrusion processing and vat photopolymerization of polymers. In all, more than 100 people from 10 National Institute of Standards and Technology (NIST) divisions and 21 additional organizations were directly involved in the AM Bench 2022 measurements, data management, and conference organization. The international AM community submitted 138 sets of blind modeling simulations for comparison with the in situ and ex situ measurements, up from 46 submissions for the first round of AM Bench in 2018. Analysis of these submissions provides valuable insight into current AM modeling capabilities. The AM Bench data are permanently archived and freely accessible online. The AM Bench conference also hosted an embedded workshop on qualification and certification of AM materials and components.

36 MATERIALS SCIENCE↗

On the convergence of the fixed point method for solving neutron transport alpha eigenvalue problems

It was shown that the Fixed Point Method (also known as the Rayleigh Quotient Method) is several times faster than the Critical Search Method for solving neutron transport alpha eigenvalue problems. It was also shown that the Fixed Point Method is able to determine the alpha eigenvalues of sub-critical systems that are beyond the reach of the Critical Search Method. Despite these significant advances, the Fixed Point Method remains an unproven algorithm. Here, this report provides a proof.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A cohesive zone treatment for the material point method involving problems of large deformation and damage

A new algorithm is described that permits the use of cohesive zones in the material point method for problems involving large deformation and fracture. In contrast to previous cohesive zone implementations, this method does not utilize massless surface-element particles. Instead, cohesive tractions are computed using the shape function mappings from a reference grid configuration in combination with explicitly defined particle surface normals and surface positions. These normals and relative surface positions are updated each time step according to particle deformation. The tractions are converted to cohesive forces using the nodal areas and mapped back to particles using the same reference shape function mappings. These forces are then remapped by conventional particle-to-grid interpolation as external forces using the current-configuration shape-function mappings. This allows highly compliant cohesive zones to function over jump displacements larger than a grid cell. Upon damage, these interfaces can revert to conventional multi-field contact surfaces. This approach is general and readily applies to two and three dimensions as well as being compatible with damage-field gradient partitioning offering exceptional computational flexibility. The framework for this method enables other capabilities, such as improved contact precision using explicitly defined surface normals and positions, and a method to mitigate spurious material damage at weak discontinuities between stiff brittle materials and soft or compliant materials.

Cohesive zone↗