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,117 records · Page 62

Anthropic versus cosmological solutions to the coincidence problem

In this paper, we investigate possible solutions to the coincidence problem in flat phantom dark-energy models with a constant dark-energy equation of state and quintessence models with a linear scalar field potential. These models are representative of a broader class of cosmological scenarios in which the universe has a finite lifetime. We show that, in the absence of anthropic constraints, including a prior probability for the models inversely proportional to the total lifetime of the universe excludes models very close to the {Lambda} cold dark matter model. This relates a cosmological solution to the coincidence problem with a dynamical dark-energy component having an equation-of-state parameter not too close to -1 at the present time. We further show that anthropic constraints, if they are sufficiently stringent, may solve the coincidence problem without the need for dynamical dark energy.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Can light dark matter solve the core-cusp problem?

Recently, there has been much interest in light dark matter, especially ultralight axions, as they may provide a solution to the core-cusp problem at the center of galaxies. Since very light bosons can have a de Broglie wavelength that is of astrophysical size, they can smooth out the centers of galaxies to produce a core, as opposed to vanilla dark matter models, and so it has been suggested that this solves the core-cusp problem. In this work, we critically examine this claim. While an ultralight particle will indeed lead to a core, we examine whether the relationship between the density of the core and its radius matches the data over a range of galaxies. We first review data that show the core density of a galaxy ρ c varies as a function of the core radius R c as ρ c ∝1/R$^{β}_{c}$ with β ≈ 1. We then compare this to theoretical models. We examine a large class of light scalar dark matter models, governed by some potential V. For simplicity, we take the scalar to be complex with a global U(1) symmetry in order to readily organize solutions by a conserved particle number. However, we expect our central conclusions to persist even for a real scalar, and furthermore, a complex scalar matches the behavior of a real scalar in the nonrelativistic limit which is the standard regime of interest. For any potential V, we find the relationship between ρ c and R c for ground state solutions is always in one of the following regimes: (i) β$\gg$1, or (ii) β$\ll$1, or (iii) unstable, and so it never matches the data. We also find similar conclusions for virialized dark matter, more general scalar field theories, degenerate fermion dark matter, superfluid dark matter, and general polytropes. We conclude that the solution to the core-cusp problem is more likely due to either complicated baryonic effects or some other type of dark matter interactions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Exact solution of a monomer-dimer problem: A single boundary monomer on a nonbipartite lattice

We solve the monomer-dimer problem on a nonbipartite lattice, a simple quartic lattice with cylindrical boundary conditions, with a single monomer residing on the boundary. Due to the nonbipartite nature of the lattice, the well-known method of solving single-monomer problems with a Temperley bijection cannot be used. In this paper, we derive the solution by mapping the problem onto one of closed-packed dimers on a related lattice. Finite-size analysis of the solution is carried out. We find from asymptotic expansions of the free energy that the central charge in the logarithmic conformal field theory assumes the value c=-2.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solution to sign problems in models of interacting fermions and quantum spins

We show that solutions to fermion sign problems that are found in the formulation where the path integral is expanded in powers of the interaction in continuous time can be extended to systems involving fermions interacting with dynamical quantum spins. While these sign problems seem unsolvable in the auxiliary field approach, solutions emerge in the world-line representation of quantum spins. Combining this idea with meron-cluster methods, we are able to further extend the class of models that are solvable. We demonstrate these solutions to sign problems by considering several examples of strongly correlated systems that contain the physics of semimetals, insulators, superfluidity, and antiferromagnetism.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Can Stochastic Quantization Evade the Sign Problem? The Relativistic Bose Gas at Finite Chemical Potential

A nonperturbative study of field theories with a complex action, such as QCD at finite baryon density, is difficult due to the sign problem. We show that the relativistic Bose gas at finite chemical potential has a sign and 'silver blaze' problem, similar to QCD. We then apply stochastic quantization and complex Langevin dynamics to study this theory with nonperturbative lattice simulations. Independence of chemical potential at small and a transition to a condensed phase at large chemical potential are found. Lattices of size N{sup 4}, with N=4, 6, 8, 10, are used. We show that the sign problem is severe, however, we find that it has no negative effect using this approach. This improves the prospects of applying stochastic quantization to QCD at nonzero density.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Mitigating the Sign Problem through Basis Rotations

Quantum Monte Carlo simulations of quantum many-body systems are plagued by the Fermion sign problem. The computational complexity of simulating Fermions scales exponentially in the projection time β and system size. The sign problem is basis dependent and an improved basis, for fixed errors, leads to exponentially quicker simulations. Herein, we show how to use sign-free quantum Monte Carlo simulations to optimize over the choice of basis on large two-dimensional systems. We numerically illustrate these techniques decreasing the “badness” of the sign problem by optimizing over single-particle basis rotations on one- and two-dimensional Hubbard systems. We find a generic rotation which improves the average sign of the Hubbard model for a wide range of U and densities for L×4 systems. In one example improvement, the average sign (and hence simulation cost at fixed accuracy) for the 16×4 Hubbard model at U/t=4 and n=0.75 increases by exp[8.64(6)β]. For typical projection times of β ≳ 100, this accelerates such simulation by many orders of magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Glassy Word Problems: Ultraslow Relaxation, Hilbert Space Jamming, and Computational Complexity

We introduce a family of local models of dynamics based on “word problems” from computer science and group theory, for which we can place rigorous lower bounds on relaxation timescales. These models can be regarded either as random circuit or local Hamiltonian dynamics and include many familiar examples of constrained dynamics as special cases. The configuration space of these models splits into dynamically disconnected sectors, and for initial states to relax, they must “work out” the other states in the sector to which they belong. When this problem has a high time complexity, relaxation is slow. In some of the cases we study, this problem also has high space complexity. When the space complexity is larger than the system size, an unconventional type of jamming transition can occur, whereby a system of a fixed size is not ergodic but can be made ergodic by appending a large reservoir of sites in a trivial product state. This finding manifests itself in a new type of Hilbert space fragmentation that we call fragile fragmentation. We present explicit examples where slow relaxation and jamming strongly modify the hydrodynamics of conserved densities. In one example, density modulations of wave vector q exhibit almost no relaxation until times O ( exp ( 1 / q ) ) , at which point they abruptly collapse. We also comment on extensions of our results to higher dimensions. Published by the American Physical Society 2024

Physics↗

Axions and the strong CP problem

Current upper bounds on the neutron electric dipole moment constrain the physically observable quantum chromodynamic (QCD) vacuum angle |{theta}|(less-or-similar sign)10{sup -11}. Since QCD explains a great deal of experimental data from the 100 MeV to the TeV scale, it is desirable to explain this smallness of |{theta}| in the QCD framework; this is the strong CP problem. There now exist two plausible solutions to this problem, one of which leads to the existence of a very light axion. The axion decay constant window, 10{sup 9}(less-or-similar sign)F{sub a}(less-or-similar sign)10{sup 12} GeV for an O(1) initial misalignment angle {theta}{sub 1}, has been obtained from astrophysical and cosmological data. For F{sub a}(greater-or-similar sign)10{sup 12} GeV with {theta}{sub 1}<O(1), axions may constitute a significant fraction of the dark matter of the universe. The supersymmetrized axion solution of the strong CP problem introduces its superpartner the axino, which might have affected the evolution of the Universe significantly. The very light axion (theory, supersymmetrization, and models) using recent particle, astrophysical, and cosmological data, and present prospects for its discovery is reviewed here.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The inverse problem of bimorph mirror tuning on a beamline

One of the challenges of tuning bimorph mirrors with many electrodes is that the calculated focusing voltages can be different by more than the safety limit (such as 500 V for the mirrors used at 17-ID at the Advanced Photon Source) between adjacent electrodes. A study of this problem at 17-ID revealed that the inverse problem of the tuning in situ, using X-rays, became ill-conditioned when the number of electrodes was large and the calculated focusing voltages were contaminated with measurement errors. Increasing the number of beamlets during the tuning could reduce the matrix condition number in the problem, but obtaining voltages with variation below the safety limit was still not always guaranteed and multiple iterations of tuning were often required. Applying Tikhonov regularization and using the L-curve criterion for the determination of the regularization parameter made it straightforward to obtain focusing voltages with well behaved variations. Some characteristics of the tuning results obtained using Tikhonov regularization are given in this paper.

43 PARTICLE ACCELERATORS↗

Optimal Water-Power Flow Problem: Formulation and Distributed Optimal Solution

This paper formalizes an optimal water-power flow (OWPF) problem to optimize the use of controllable assets across power and water systems while accounting for the couplings between the two infrastructures. Tanks and pumps are optimally managed to satisfy water demand while improving power grid operations; {for the power network, an AC optimal power flow formulation is augmented to accommodate the controllability of water pumps.} Unfortunately, the physics governing the operation of the two infrastructures and coupling constraints lead to a nonconvex (and, in fact, NP-hard) problem; however, after reformulating OWPF as a nonconvex, quadratically-constrained quadratic problem, a feasible point pursuit-successive convex approximation approach is used to identify feasible and optimal solutions. In addition, a distributed solver based on the alternating direction method of multipliers enables water and power operators to pursue individual objectives while respecting the couplings between the two networks. The merits of the proposed approach are demonstrated for the case of a distribution feeder coupled with a municipal water distribution network.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Strengthened MILP formulation for certain gas turbine unit commitment problems

In this study, we derive a strengthened MILP formulation for certain gas turbine unit commitment problems, in which the ramping rates are no smaller than the minimum generation amounts. This type of gas turbines can usually start-up faster and have a larger ramping rate, as compared to the traditional coal-fired power plants. Recently, the number of this type of gas turbines increases significantly due to affordable gas prices and their scheduling flexibilities to accommodate intermittent renewable energy generation. In this study, several new families of strong valid inequalities are developed to help reduce the computational time to solve these types of problems. Meanwhile, the validity and facet-defining proofs are provided for certain inequalities. Finally, numerical experiments on a modified IEEE 118-bus system and the power system data based on recent studies verify the effectiveness of applying our formulation to model and solve this type of gas turbine unit commitment problems, including reducing the computational time to obtain an optimal solution or obtaining a much smaller optimality gap, as compared to the default CPLEX, when the time limit is reached with no optimal solutions obtained.

24 POWER TRANSMISSION AND DISTRIBUTION↗

SU-E-J-161: Inverse Problems for Optical Parameters in Laser Induced Thermal Therapy

Purpose: Magnetic resonance-guided laser-induced thermal therapy (MRgLITT) is investigated as a neurosurgical intervention for oncological applications throughout the body by active post market studies. Real-time MR temperature imaging is used to monitor ablative thermal delivery in the clinic. Additionally, brain MRgLITT could improve through effective planning for laser fiber's placement. Mathematical bioheat models have been extensively investigated but require reliable patient specific physical parameter data, e.g. optical parameters. This abstract applies an inverse problem algorithm to characterize optical parameter data obtained from previous MRgLITT interventions. Methods: The implemented inverse problem has three primary components: a parameter-space search algorithm, a physics model, and training data. First, the parameter-space search algorithm uses a gradient-based quasi-Newton method to optimize the effective optical attenuation coefficient, μ-eff. A parameter reduction reduces the amount of optical parameter-space the algorithm must search. Second, the physics model is a simplified bioheat model for homogeneous tissue where closed-form Green's functions represent the exact solution. Third, the training data was temperature imaging data from 23 MRgLITT oncological brain ablations (980 nm wavelength) from seven different patients. Results: To three significant figures, the descriptive statistics for μ-eff were 1470 m{sup −1} mean, 1360 m{sup −1} median, 369 m{sup −1} standard deviation, 933 m{sup −1} minimum and 2260 m{sup −1} maximum. The standard deviation normalized by the mean was 25.0%. The inverse problem took <30 minutes to optimize all 23 datasets. Conclusion: As expected, the inferred average is biased by underlying physics model. However, the standard deviation normalized by the mean is smaller than literature values and indicates an increased precision in the characterization of the optical parameters needed to plan MRgLITT procedures. This investigation demonstrates the potential for the optimization and validation of more sophisticated bioheat models that incorporate the uncertainty of the data into the predictions, e.g. stochastic finite element methods.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-E-T-398: Evaluation of Radiobiological Parameters Using Serial Tumor Imaging During Radiotherapy as An Inverse Ill-Posed Problem

Purpose: Combination of serial tumor imaging with radiobiological modeling can provide more accurate information on the nature of treatment response and what underlies resistance. The purpose of this article is to improve the algorithms related to imaging-based radiobilogical modeling of tumor response. Methods: Serial imaging of tumor response to radiation therapy represents a sum of tumor cell sensitivity, tumor growth rates, and the rate of cell loss which are not separated explicitly. Accurate treatment response assessment would require separation of these radiobiological determinants of treatment response because they define tumor control probability. We show that the problem of reconstruction of radiobiological parameters from serial imaging data can be considered as inverse ill-posed problem described by the Fredholm integral equation of the first kind because it is governed by a sum of several exponential processes. Therefore, the parameter reconstruction can be solved using regularization methods. Results: To study the reconstruction problem, we used a set of serial CT imaging data for the head and neck cancer and a two-level cell population model of tumor response which separates the entire tumor cell population in two subpopulations of viable and lethally damage cells. The reconstruction was done using a least squared objective function and a simulated annealing algorithm. Using in vitro data for radiobiological parameters as reference data, we shown that the reconstructed values of cell surviving fractions and potential doubling time exhibit non-physical fluctuations if no stabilization algorithms are applied. The variational regularization allowed us to obtain statistical distribution for cell surviving fractions and cell number doubling times comparable to in vitro data. Conclusion: Our results indicate that using variational regularization can increase the number of free parameters in the model and open the way to development of more advanced algorithms which take into account tumor heterogeneity, for example, related to hypoxia.

60 APPLIED LIFE SCIENCES↗

Steady Flow Regimes in the Problem of Intense Wind-Driven Circulation in a Thin Layer of Viscous Rotating Fluid

The problem of wind-driven circulation in a thin layer of homogeneous viscous rotating fluid is considered. In the limit of small Froude and Burger numbers it is described by two parameters—the Rossby number proportional to the forcing and the Ekman number. For small Ekman numbers and moderate Rossby numbers, the regimes of steady fluid circulation are investigated through numerical simulations of a Kármántype flow. Two different types of steady flows are shown to exist, and their physical interpretation based on a simple analytical model is proposed. A regime diagram on the plane of problem parameters is provided. The simultaneous existence of steady flows of two different types turns out to be possible in some domain of parameters, i.e., there is a dependence of the stationary solution to the problem on initial data. The asymptotic dependence of steady flow characteristics is investigated in the limit of small Ekman numbers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method

Here, we propose two multilevel spectral techniques for constructing coarse discretization spaces for saddle-point problems corresponding to PDEs involving a divergence constraint, with a focus on mixed finite element discretizations of scalar self-adjoint second order elliptic equations on general unstructured grids. We use element agglomeration algebraic multigrid (AMGe), which employs coarse elements that can have nonstandard shape since they are agglomerates of fine-grid elements. The coarse basis associated with each agglomerated coarse element is constructed by solving local eigenvalue problems and local mixed finite element problems. This construction leads to stable upscaled coarse spaces and guarantees the inf-sup compatibility of the upscaled discretization. Also, the approximation properties of these upscaled spaces improve by adding more local eigenfunctions to the coarse spaces. The higher accuracy comes at the cost of additional computational effort, as the sparsity of the resulting upscaled coarse discretization (referred to as operator complexity) deteriorates when we introduce additional functions in the coarse space. We also provide an efficient solver for the coarse (upscaled) saddle-point system by employing hybridization, which leads to a symmetric positive definite (s.p.d.) reduced system for the Lagrange multipliers, and to solve the latter s.p.d. system, we use our previously developed spectral AMGe solver. Numerical experiments, in both two and three dimensions, are provided to illustrate the efficiency of the proposed upscaling technique.

97 MATHEMATICS AND COMPUTING↗

A Condensed Constrained Nonconforming Mortar-Based Approach for Preconditioning Finite Element Discretization Problems

This paper presents and studies an approach for constructing auxiliary space preconditioners for finite element problems using a constrained nonconforming reformulation that is based on a proposed modified version of the mortar method. The well-known mortar finite element discretization method is modified to admit a local structure, providing an element-by-element or subdomain-by-subdomain assembly property. This is achieved via the introduction of additional trace finite element spaces and degrees of freedom (unknowns) associated with the interfaces between adjacent elements or subdomains. The resulting nonconforming formulation and a reduced-via-static-condensation Schur complement form on the interfaces are used in the construction of auxiliary space preconditioners for a given conforming finite element discretization problem. Overall, the properties of these preconditioners are studied and their performance is illustrated on model second order scalar elliptic problems utilizing high order elements.

97 MATHEMATICS AND COMPUTING↗

Solving Inverse Stochastic Problems from Discrete Particle Observations Using the Fokker--Planck Equation and Physics-Informed Neural Networks

The Fokker--Planck (FP) equation governing the evolution of the probability density function (PDF) is applicable to many disciplines, but it requires specification of the coefficients for each case, which can be functions of space-time and not just constants and hence require the development of a data-driven modeling approach. When the data available is directly on the PDF, there exist methods for inverse problems that can be employed to infer the coefficients and thus determine the FP equation and subsequently obtain its solution. Herein, we address a more realistic scenario, where only sparse data are given on the particles' positions at a few time instants, which are not sufficient to accurately construct directly the PDF even at those times from existing methods, e.g., kernel estimation algorithms. To this end, we develop a general framework based on physics-informed neural networks (PINNs) that introduces a new loss function using the Kullback--Leibler divergence to connect the stochastic samples with the FP equation to simultaneously learn the equation and infer the multidimensional PDF at all times. In particular, we consider two types of inverse problems, type I, where the FP equation is known but the initial PDF is unknown, and type II, in which, in addition to the unknown initial PDF, the drift and diffusion terms are also unknown. In both cases, we investigate problems with either Brownian or Lévy noise or a combination of both. Here, we demonstrate the new PINN framework in detail in the one-dimensional (1D) case, but we also provide results for up to five dimensions demonstrating that we can infer both the FP equation and dynamics simultaneously at all times with high accuracy using only very few discrete observations of the particles.

97 MATHEMATICS AND COMPUTING↗

Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems

This paper focuses on a time-varying constrained nonconvex optimization problem, and considers the synthesis and analysis of online regularized primal-dual gradient methods to track a Karush-Kuhn-Tucker (KKT) trajectory. The proposed regularized primal-dual gradient method is implemented in a running fashion, in the sense that the underlying optimization problem changes during the execution of the algorithms. In order to study its performance, we first derive its continuous-time limit as a system of differential inclusions. We then study sufficient conditions for tracking a KKT trajectory, and also derive asymptotic bounds for the tracking error (as a function of the time-variability of a KKT trajectory). Further, we provide a set of sufficient conditions for the KKT trajectories not to bifurcate or merge, and also investigate the optimal choice of the parameters of the algorithm. Illustrative numerical results for a time-varying nonconvex problem are provided.

differential inclusion↗