Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 1,009 records · Page 56

Wavefunction matching for solving quantum many-body problems

Ab initio calculations have an essential role in our fundamental understanding of quantum many-body systems across many subfields, from strongly correlated fermions to quantum chemistry and from atomic and molecular systems to nuclear physics. One of the primary challenges is to perform accurate calculations for systems where the interactions may be complicated and difficult for the chosen computational method to handle. Here we address the problem by introducing an approach called wavefunction matching. Wavefunction matching transforms the interaction between particles so that the wavefunctions up to some finite range match that of an easily computable interaction. This allows for calculations of systems that would otherwise be impossible owing to problems such as Monte Carlo sign cancellations. We apply the method to lattice Monte Carlo simulations of light nuclei, medium-mass nuclei, neutron matter and nuclear matter. We use high-fidelity chiral effective field theory interactions and find good agreement with empirical data. These results are accompanied by insights on the nuclear interactions that may help to resolve long-standing challenges in accurately reproducing nuclear binding energies, charge radii and nuclear-matter saturation in ab initio calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Reduced order modeling for flow and transport problems with Barlow Twins self-supervised learning

Abstract We propose a unified data-driven reduced order model (ROM) that bridges the performance gap between linear and nonlinear manifold approaches. Deep learning ROM (DL-ROM) using deep-convolutional autoencoders (DC–AE) has been shown to capture nonlinear solution manifolds but fails to perform adequately when linear subspace approaches such as proper orthogonal decomposition (POD) would be optimal. Besides, most DL-ROM models rely on convolutional layers, which might limit its application to only a structured mesh. The proposed framework in this study relies on the combination of an autoencoder (AE) and Barlow Twins (BT) self-supervised learning, where BT maximizes the information content of the embedding with the latent space through a joint embedding architecture. Through a series of benchmark problems of natural convection in porous media, BT–AE performs better than the previous DL-ROM framework by providing comparable results to POD-based approaches for problems where the solution lies within a linear subspace as well as DL-ROM autoencoder-based techniques where the solution lies on a nonlinear manifold; consequently, bridges the gap between linear and nonlinear reduced manifolds. We illustrate that a proficient construction of the latent space is key to achieving these results, enabling us to map these latent spaces using regression models. The proposed framework achieves a relative error of 2% on average and 12% in the worst-case scenario (i.e., the training data is small, but the parameter space is large.). We also show that our framework provides a speed-up of $$7 \times 10^{6}$$ 7 × 10 6 times, in the best case, and $$7 \times 10^{3}$$ 7 × 10 3 times on average compared to a finite element solver. Furthermore, this BT–AE framework can operate on unstructured meshes, which provides flexibility in its application to standard numerical solvers, on-site measurements, experimental data, or a combination of these sources.

97 MATHEMATICS AND COMPUTING↗

Comparing quantum annealing and spiking neuromorphic computing for sampling binary sparse coding QUBO problems

We consider the problem of computing a sparse binary representation of an image. Given an image and an overcomplete, non-orthonormal basis, we aim to find a sparse binary vector indicating the minimal set of basis vectors that when added together best reconstruct the given input. We formulate this problem with an L 2 loss on the reconstruction error, and an L 0 loss on the binary vector enforcing sparsity. First, we solve the sparse representation QUBOs by solving them both on a D-Wave quantum annealer with Pegasus chip connectivity, as well as on the Intel Loihi 2 spiking neuromorphic processor using a stochastic Non-equilibrium Boltzmann Machine (NEBM). Second, using Quantum Evolution Monte Carlo with Reverse Annealing and iterated warm starting on Loihi 2 to evolve the solution quality from the respective machines. We demonstrate that both quantum annealing and neuromorphic computing are suitable for solving binary sparse coding QUBOs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Formulation and Optimization of Robust Sensor Placement Problems for Drinking Water Contamination Warning Systems

We report that the sensor placement problem in contamination warning system design for municipal water distribution networks involves maximizing the protection level afforded by limited numbers of sensors, typically quantified as the expected impact of a contamination event; the issue of how to mitigate against high-consequence events is either handled implicitly or ignored entirely. Consequently, expected-case sensor placements run the risk of failing to protect against high-consequence 9/11-style attacks. In contrast, robust sensor placements address this concern by focusing strictly on high-consequence events and placing sensors to minimize the impact of these events. We introduce several robust variations of the sensor placement problem, distinguished by how they quantify the potential damage due to high-consequence events. We explore the nature of robust versus expected-case sensor placements on three real-world large-scale distribution networks. We find that robust sensor placements can yield large reductions in the number and magnitude of high-consequence events, with only modest increases in expected impact. Finally, the ability to trade-off between robust and expected-case impacts is a key unexplored dimension in contamination warning system design.

42 ENGINEERING↗

SUSY CP problem and spontaneous CP violation in SUSY GUT

We study spontaneous CP violation in association with so-called SUSY flavor problem, SUSY CP problem, and stability of electroweak (EW) scale on the context of supersymmetric grand unified theory (SUSY GUT). In view of naturalness we retain stop masses on EW scale. Then in order to suppress non-decoupling SUSY contribution to up quark EDM we examine a certain type of flavor structure where up-type quark sector is real whereas down-type quark and charged lepton sectors are complex. We exhibit, as an example, an explicit model based on E{sub 6} SUSY GUT with SU(2) flavor symmetry that realizes these situations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Collisionless plasma expansion into vacuum: Two new twists on an old problem

The paper deals with a generic problem of collisionless plasma expansion into vacuum in the regimes where the expanding plasma consists of hot electrons and cold ions. The expansion is caused by electron pressure and serves as an energy transfer mechanism from electrons to ions. This process is often described under the assumption of Maxwellian electrons, which easily fails in the absence of collisions. The paper discusses two systems with a naturally occurring non-Maxwellian distribution: an expanding laser-irradiated nanoplasma and a supersonic jet coming out of a magnetic nozzle. The presented rigorous kinetic description demonstrates how the deviation from the Maxwellian distribution fundamentally alters the process of ion acceleration during plasma expansion. This result points to the critical importance of a fully kinetic treatment in problems with collisionless plasma expansion.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Hybridization of the Attributes and the Difficulty of the Problem of the Image Recognition and Classification

The problem of the image recognition and classification based on the pattern recognition is of a paramount importance in lots of domains. The present paper discusses new topics like the hybridization of the attributes. This situation gives us proofs that the analysis and modeling of the image recognition and classification problem has to pass to a detailed level.

99 GENERAL AND MISCELLANEOUS↗

Parker problem in Hall magnetohydrodynamics

The Parker problem in Hall magnetohydrodynamics (MHD) is considered. Poloidal shear superposed on the toroidal ion flow associated with the Hall effect is incorporated. This is found to lead to a triple deck structure for the Parker problem in Hall MHD, with the magnetic field falling off in the intermediate Hall-resistive region more steeply (like 1/x{sup 3}) than that (like 1/x) in the outer ideal MHD region.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The Sp(1)-Kepler problems

Let n{>=}2 be a positive integer. To each irreducible representation {sigma} of Sp(1), an Sp(1)-Kepler problem in dimension (4n-3) is constructed and analyzed. This system is superintegrable, and when n=2 it is equivalent to a generalized MICZ-Kepler problem in dimension of 5. The dynamical symmetry group of this system is O-tilde*(4n) with the Hilbert space of bound states H({sigma}) being the unitary highest weight representation of O*-tilde(4n) with highest weight, (-1,{center_dot}{center_dot}{center_dot},-1,-(1+{sigma})), which occurs at the rightmost nontrivial reduction point in the Enright-Howe-Wallach classification diagram for the unitary highest weight modules. Here {sigma} is the highest weight of {sigma}. Furthermore, it is shown that the correspondence {sigma}{r_reversible}H({sigma}) is the theta-correspondence for dual pair (Sp(1),O*(4n))subset Sp(8n,R)

97 MATHEMATICS AND COMPUTING↗

The sign problem in real-time path integral simulations: Using the cumulant action to implement multilevel blocking

A practical method to tackle the sign problem in real-time path integral simulations is proposed based on the multilevel blocking idea. The formulation is made possible by using a cumulant expansion of the action, which in addition to addressing the sign problem, provides an unbiased estimator for the action from a statistically noisy sample of real-time paths. The cumulant formulation also allows the analytical gradients of the action to be computed with little extra computational effort, and it can easily be implemented in a massively parallel environment.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the Boyd-Kadomstev System for the Three-Wave Coupling Problem

The three-wave coupling problem is crucial in plasma physics, specialy for laser-plasma interaction simulations. We study here a related system obtained with a infinite speed of light. After showing that it is well posed, we propose a numerical method which allows large time step and may be extended to the problem with finite speed of light.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

RADIOGRAPHIC BENCHMARK PROBLEM 2009 - SCATTER CALCULATIONS IN MODELLING

Code Validation is a permanent concern in computer simulation, and has been addressed repeatedly in eddy current and ultrasonic modelling. A good benchmark problem is sufficiently simple to be taken into account by various codes without strong requirements on geometry representation capabilities, focuses on few or even a single aspect of the problem at hand to facilitate interpretation and to avoid that compound errors compensate themselves, yields a quantitative result and is experimentally accessible. In this paper we attempt to address code validation for one aspect of radio-graphic modelling, the scattered radiation prediction. An update of the results of the 2008 benchmark is presented. Additionally we discuss the extension of this benchmark on the lower energy part for 60 and 80 keV as well as for higher energies up to 10 MeV to study the contribution of pair production. Of special interest will be the primary radiation (attenuation law as reference), the total scattered radiation, the relative contribution of scattered radiation separated by order of scatter events (1st, 2nd, ..., 20th), and the spectrum of scattered radiation. We present the results of three Monte Carlo codes (MC-Ray, Sindbad and Moderato) as well as an analytical first order scattering code (VXI) and compare to MCNP as reference.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Meshfree Cell-based Smoothed Point Interpolation Method for Solid Mechanics Problems

In the framework of a weakened weak (W{sup 2}) formulation using a generalized gradient smoothing operation, this paper introduces a novel meshfree cell-based smoothed point interpolation method (CS-PIM) for solid mechanics problems. The W{sup 2} formulation seeks solutions from a normed G space which includes both continuous and discontinuous functions and allows the use of much more types of methods to create shape functions for numerical methods. When PIM shape functions are used, the functions constructed are in general not continuous over the entire problem domain and hence are not compatible. Such an interpolation is not in a traditional H{sup 1} space, but in a G{sup 1} space. By introducing the generalized gradient smoothing operation properly, the requirement on function is now further weakened upon the already weakened requirement for functions in a H{sup 1} space and G{sup 1} space can be viewed as a space of functions with weakened weak (W{sup 2}) requirement on continuity. The cell-based smoothed point interpolation method (CS-PIM) is formulated based on the W{sup 2} formulation, in which displacement field is approximated using the PIM shape functions, which possess the Kronecker delta property facilitating the enforcement of essential boundary conditions [3]. The gradient (strain) field is constructed by the generalized gradient smoothing operation within the cell-based smoothing domains, which are exactly the triangular background cells. A W{sup 2} formulation of generalized smoothed Galerkin (GS-Galerkin) weak form is used to derive the discretized system equations. It was found that the CS-PIM possesses the following attractive properties: (1) It is very easy to implement and works well with the simplest linear triangular mesh without introducing additional degrees of freedom; (2) it is at least linearly conforming; (3) this method is temporally stable and works well for dynamic analysis; (4) it possesses a close-to-exact stiffness, which is much softer than the overly-stiff FEM model and much stiffer than the overly-soft node-based smoothed point interpolation method (NS-PIM); (5) the results of the present method are of better accuracy and higher convergence rate than the linear FEM model using the same set of triangular meshes.

97 MATHEMATICS AND COMPUTING↗

A Family of Symmetric Linear Multistep Methods for the Numerical Solution of the Schroedinger Equation and Related Problems

We develop a new family of explicit symmetric linear multistep methods for the efficient numerical solution of the Schroedinger equation and related problems with oscillatory solution. The new methods are trigonometrically fitted and have improved intervals of periodicity as compared to the corresponding classical method with constant coefficients and other methods from the literature. We also apply the methods along with other known methods to real periodic problems, in order to measure their efficiency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Weighted Traffic Equilibrium Problem in Non Pivot Hilbert Spaces with Long Term Memory

In the paper we consider a weighted traffic equilibrium problem in a non-pivot Hilbert space and prove the equivalence between a weighted Wardrop condition and a variational inequality with long term memory. As an application we show, using recent results of the Senseable Laboratory at MIT, how wireless devices can be used to optimize the traffic equilibrium problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

How to Solve Schroedinger Problems by Approximating the Potential Function

We give a survey over the efforts in the direction of solving the Schroedinger equation by using piecewise approximations of the potential function. Two types of approximating potentials have been considered in the literature, that is piecewise constant and piecewise linear functions. For polynomials of higher degree the approximating problem is not so easy to integrate analytically. This obstacle can be circumvented by using a perturbative approach to construct the solution of the approximating problem, leading to the so-called piecewise perturbation methods (PPM). We discuss the construction of a PPM in its most convenient form for applications and show that different PPM versions (CPM,LPM) are in fact equivalent.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The U(1)-Kepler Problems

Let n{>=} 2 be a positive integer. To each irreducible representation {sigma} of U(1), a U(1)-Kepler problem in dimension (2n-1) is constructed and analyzed. This system is superintegrable and when n= 2 it is equivalent to a MICZ-Kepler problem. The dynamical symmetry group of this system is U-tilde(n,n), and the Hilbert space of bound states H({sigma}) is the unitary highest weight representation of U-tilde(n,n) with the minimal positive Gelfand-Kirillov dimension. Furthermore, it is shown that the correspondence between {sigma}* (the dual of {sigma}) and H({sigma}) is the theta-correspondence for dual pair (U(1),U(n,n))sub set of p{sub 4n}(R).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗