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 343 records · Page 19

On the singular Sturm-Liouville problems that have the same spectrum

The problem of efficaciously constucting the potential q (x) and the numbers h and H was solved in [1]. Trubowitz [2] investigated the isospectrality problem which have the same spectrum with other same type of problems. Then Jodeit and Levitan [3] considered this problem with a different approach, based on transmutation operators and integral equation. In this work, we discussed this problem for singular Sturm-Liouville operator and obtained some important formulas for the number H, the potential q (x) and the norming constants α{sub n}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On a problem of reconstruction of a discontinuous function by its Radon transform

A problem of reconstruction of a discontinuous function by its Radon transform is considered. One of the approaches to the numerical solution for the problem consists in the next sequential steps: a visualization of a set of breaking points; an identification of this set; a determination of jump values; an elimination of discontinuities. We consider three of listed problems except the problem of jump values. The problems are investigated by mathematical modeling using numerical experiments. The results of simulation are satisfactory and allow to hope for the further development of the approach.

97 MATHEMATICS AND COMPUTING↗

Exact sub-grid interface correction schemes for elliptic interface problems

We introduce a non-conforming finite element method for second order elliptic interface problems. Our approach applies to problems in which discontinuous coefficients and singular sources on the interface may give rise to jump discontinuities in either the solution or its normal derivative. Given a standard background mesh and an interface that passes between elements, the key idea is to construct a singular correction function which satisfies the prescribed jump conditions, providing accurate sub-grid resolution of the discontinuities. Utilizing the closest point extension and an implicit interface representation by the signed distance function, an algorithm is established to construct the correction function. The result is a function which is supported only on the interface elements, represented by the regular basis functions, and bounded independently of the interface location with respect to the background mesh. In the particular case of a constant second order coefficient, our regularization by singular function is straightforward, and the resulting left-hand-side is identical to that of a regular problem without introducing any instability. The influence of the regularization appears solely on the right-hand-side, which simplifies the implementation. In the more general case of discontinuous second order coefficients, a normalization is invoked which introduces a constraint equation on the interface. This results in a problem statement similar to that of a saddle-point problem. We employ two-level-iteration as the solution strategy, which exhibits aspects similar to those of iterative preconditioning strategies.

97 MATHEMATICS AND COMPUTING↗

A New Shutdown Dose Rate Benchmark Problem for Representative Fusion Applications

Here, this work introduces a new benchmark problem for calculating shutdown dose rates (SDDRs) aimed at fusion reactor applications. The model is designed to represent a simplified version of a typical ITER port plug. The responses of interest include neutron flux, gamma flux, and gamma SDDR at 12 different locations scattered throughout the port. This article outlines the geometry specifications of the problem, provides material definitions for the components, specifies the required responses to be calculated, and presents the source definition information. The need for this benchmark arises from the limited availability of publicly accessible references, with only one benchmark representing the typical dimensions and materials found in fusion systems. This existing benchmark has been cited extensively, reflecting the demand within the scientific community to test both established and novel workflows for SDDR calculations. However, since its presentation at a conference in 2011, the results have become increasingly well known. Moreover, the absence of formal publication and peer review has led to the details of this benchmark being extracted from secondary sources, such as subsequent studies that reference it. As a result, analysts are left with significant flexibility in interpreting the key parameters, which can be adjusted to account for unknown systematic errors, ultimately reproducing the already well-known responses. This new benchmark serves as an updated version of that earlier work, with the aim of providing a more reliable description of the materials and their impurities, which is crucial for assessing activation and subsequent gamma emission. Additionally, it seeks to provide a geometry that more closely represents an ITER port plug. The improvements in the problem definition will lead to a more reproducible benchmark problem, while also presenting the radiation transport community with a completely new challenge. The results will be published in a future article to allow analysts adequate time to analyze this problem independently.

Benchmark↗

USING A PHENOMENOLOGICAL MODEL TO TEST THE COINCIDENCE PROBLEM OF DARK ENERGY

By assuming a phenomenological form for the ratio of the dark energy and matter densities rho{sub X} {proportional_to} rho{sub m} a {sup x}i, we discuss the cosmic coincidence problem in light of current observational data. Here, xi is a key parameter to denote the severity of the coincidence problem. In this scenario, xi = 3 and xi = 0 correspond to LAMBDACDM and the self-similar solution without the coincidence problem, respectively. Hence, any solution with a scaling parameter 0 < xi < 3 makes the coincidence problem less severe. In addition, the standard cosmology without interaction between dark energy and dark matter is characterized by xi + 3omega{sub X} = 0, where omega{sub X} is the equation of state of the dark energy component, whereas the inequality xi + 3omega{sub X} {ne} 0 represents non-standard cosmology. We place observational constraints on the parameters (OMEGA{sub X,0}, omega{sub X}, xi) of this model, where OMEGA{sub X,0} is the present value of density parameter of dark energy OMEGA{sub X}, by using the Constitution Set (397 supernovae of type Ia data, hereafter SNeIa), the cosmic microwave background shift parameter from the five-year Wilkinson Microwave Anisotropy Probe and the Sloan Digital Sky Survey baryon acoustic peak. Combining the three samples, we get OMEGA{sub X,0} = 0.72 +- 0.02, omega{sub X} = -0.98 +- 0.07, and xi = 3.06 +- 0.35 at 68.3% confidence level. The result shows that the LAMBDACDM model still remains a good fit to the recent observational data, and the coincidence problem indeed exists and is quite severe, in the framework of this simple phenomenological model. We further constrain the model with the transition redshift (deceleration/acceleration). It shows that if the transition from deceleration to acceleration happens at the redshift z > 0.73, within the framework of this model, we can conclude that the interaction between dark energy and dark matter is necessary.

79 ASTRONOMY AND ASTROPHYSICS↗

A domain decomposition preconditioning for an inverse volume scattering problem

In this work, we propose domain decomposition preconditioners for the solution of an integral equation formulation of the acoustic forward and inverse scattering problems. We study both forward and inverse volume problems and propose preconditioning techniques to accelerate the iterative solvers. For the forward scattering problem, we extend the domain decomposition based preconditioning techniques presented for partial differential equations in Cai and Sarkis (1999 SIAM J. Sci. Comput. 21 792–797), to integral equations. We combine this domain decomposition preconditioner with a low-rank correction, which is easy to construct, forming a new preconditioner. For the inverse scattering problem, we use the forward problem preconditioner as a building block for constructing a preconditioner for the Gauss–Newton Hessian. We present numerical results that demonstrate the performance of both preconditioning strategies.

97 MATHEMATICS AND COMPUTING↗

An autoencoder compression approach for accelerating large-scale inverse problems

Abstract Partial differential equation (PDE)-constrained inverse problems are some of the most challenging and computationally demanding problems in computational science today. Fine meshes required to accurately compute the PDE solution introduce an enormous number of parameters and require large-scale computing resources such as more processors and more memory to solve such systems in a reasonable time. For inverse problems constrained by time-dependent PDEs, the adjoint method often employed to compute gradients and higher order derivatives efficiently requires solving a time-reversed, so-called adjoint PDE that depends on the forward PDE solution at each timestep. This necessitates the storage of a high-dimensional forward solution vector at every timestep. Such a procedure quickly exhausts the available memory resources. Several approaches that trade additional computation for reduced memory footprint have been proposed to mitigate the memory bottleneck, including checkpointing and compression strategies. In this work, we propose a close-to-ideal scalable compression approach using autoencoders to eliminate the need for checkpointing and substantial memory storage, thereby reducing the time-to-solution and memory requirements. We compare our approach with checkpointing and an off-the-shelf compression approach on an earth-scale ill-posed seismic inverse problem. The results verify the expected close-to-ideal speedup for the gradient and Hessian-vector product using the proposed autoencoder compression approach. To highlight the usefulness of the proposed approach, we combine the autoencoder compression with the data-informed active subspace (DIAS) prior showing how the DIAS method can be affordably extended to large-scale problems without the need for checkpointing and large memory.

Mathematics↗

An update on the big bang nucleosynthesis prediction for {sup 7}Li: the problem worsens

The lithium problem arises from the significant discrepancy between the primordial {sup 7}Li abundance as predicted by big bang nucleosynthesis (BBN) theory and the Wilkinson Microwave Anisotropy Probe (WMAP) baryon density, and the pre-Galactic lithium abundance inferred from observations of metal-poor (Population II) stars. This problem has loomed for the past decade, with a persistent discrepancy of a factor of 2-3 in {sup 7}Li/H. Recent developments have sharpened all aspects of the Li problem. Namely: (1) BBN theory predictions have sharpened due to new nuclear data; in particular, the uncertainty on the reaction rate for{sup 3}He({alpha},{gamma}){sup 7}Be has reduced to 7.4%, nearly a factor of 2 tighter than previous determinations. (2) The WMAP five-year data set now yields a cosmic baryon density with an uncertainty reduced to 2.7%. (3) Observations of metal-poor stars have tested for systematic effects. With these, we now find that the BBN+WMAP predicts{sup 7}Li/H = (5.24{sub -0.67}{sup +0.71}) Multiplication-Sign 10{sup -10}. The central value represents an increase by 23%, most of which is due to the upward shift in the{sup 3}He({alpha},{gamma}){sup 7}Be rate. More significant is the reduction in the{sup 7}Li/H uncertainty by almost a factor of 2, tracking the reduction in the{sup 3}He({alpha},{gamma}){sup 7}Be error bar. These changes exacerbate the Li problem; the discrepancy is now a factor 2.4 or 4.2{sigma} (from globular cluster stars) to 4.3 or 5.3{sigma} (from halo field stars). Possible resolutions to the lithium problem are briefly reviewed, and key experimental and astronomical measurements highlighted.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Agnesi weighting for the measure problem of cosmology

The measure problem of cosmology is how to assign normalized probabilities to observations in a universe so large that it may have many observations occurring at many different spacetime locations. I have previously shown how the Boltzmann brain problem (that observations arising from thermal or quantum fluctuations may dominate over ordinary observations if the universe expands sufficiently and/or lasts long enough) may be ameliorated by volume averaging, but that still leaves problems if the universe lasts too long. Here a solution is proposed for that residual problem by a simple weighting factor 1/(1+t{sup 2}) to make the time integral convergent. The resulting Agnesi measure appears to avoid problems other measures may have with vacua of zero or negative cosmological constant.

79 ASTRONOMY AND ASTROPHYSICS↗

Domain wall and isocurvature perturbation problems in axion models

Axion models have two serious cosmological problems, domain wall and isocurvature perturbation problems. In order to solve these problems we investigate the Linde's model in which the field value of the Peccei-Quinn (PQ) scalar is large during inflation. In this model the fluctuations of the PQ field grow after inflation through the parametric resonance and stable axionic strings may be produced, which results in the domain wall problem. We study formation of axionic strings using lattice simulations. It is found that in chaotic inflation the axion model is free from both the domain wall and the isocurvature perturbation problems if the initial misalignment angle θ{sub a} is smaller than O(10{sup −2}). Furthermore, axions can also account for the dark matter for the breaking scale v ≅ 10{sup 12−16} GeV and the Hubble parameter during inflation H{sub inf}∼<10{sup 11−12} GeV in general inflation models.

79 ASTRONOMY AND ASTROPHYSICS↗

Paired autoencoders for likelihood-free estimation in inverse problems

Abstract We consider the solution of nonlinear inverse problems where the forward problem is a discretization of a partial differential equation. Such problems are notoriously difficult to solve in practice and require minimizing a combination of a data-fit term and a regularization term. The main computational bottleneck of typical algorithms is the direct estimation of the data misfit. Therefore, likelihood-free approaches have become appealing alternatives. Nonetheless, difficulties in generalization and limitations in accuracy have hindered their broader utility and applicability. In this work, we use a paired autoencoder framework as a likelihood-free estimator (LFE) for inverse problems. We show that the use of such an architecture allows us to construct a solution efficiently and to overcome some known open problems when using LFEs. In particular, our framework can assess the quality of the solution and improve on it if needed. We demonstrate the viability of our approach using examples from full waveform inversion and inverse electromagnetic imaging.

Chung, Matthias (ORCID:0000000178224539)↗

Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems

We present an algorithm to compute the pseudospectral abscissa for a nonlinear eigenvalue problem. The algorithm relies on global under-estimator and over-estimator functions for the eigenvalue and singular value functions involved. These global models follow from eigenvalue perturbation theory. The algorithm has three particular features. First, it converges to the globally rightmost point of the pseudospectrum, and it is immune to nonsmoothness. The global convergence assertion is under the assumption that a global lower bound is available for the second derivative of a singular value function depending on one parameter. It may not be easy to deduce such a lower bound analytically, but assigning large negative values works robustly in practice. Second, it is applicable to large-scale problems since the dominant cost per iteration stems from computing the smallest singular value and associated singular vectors, for which efficient iterative solvers can be used. Furthermore, a significant increase in computational efficiency can be obtained by subspace acceleration, that is, by restricting the domains of the linear maps associated with the matrices involved to small but suitable subspaces, and solving the resulting reduced problems. Occasional restarts of these subspaces further enhance the efficiency for large-scale problems. Finally, in contrast to existing iterative approaches based on constructing low-rank perturbations and rightmost eigenvalue computations, the algorithm relies on computing only singular values of complex matrices. Hence, the algorithm does not require solutions of nonlinear eigenvalue problems, thereby further increasing efficiency and reliability. This work is accompanied by a robust implementation of the algorithm that is publicly available.

97 MATHEMATICS AND COMPUTING↗

Solving generalized eigenvalue problems by ordinary differential equations on a quantum computer

Many eigenvalue problems arising in practice are often of the generalized form A x = λ B x . One particularly important case is symmetric, namely A , B are Hermitian and B is positive definite. The standard algorithm for solving this class of eigenvalue problems is to reduce them to Hermitian eigenvalue problems. For a quantum computer, quantum phase estimation is a useful technique to solve Hermitian eigenvalue problems. In this work, we propose a new quantum algorithm for symmetric generalized eigenvalue problems using ordinary differential equations. The algorithm has lower complexity than the standard one based on quantum phase estimation. Moreover, it works for a wider case than symmetric: B is invertible, B - 1 A is diagonalizable and all the eigenvalues are real.

Science & Technology - Other Topics↗

Quantum phase estimation for a class of generalized eigenvalue problems

Quantum phase estimation provides a path to quantum computation of solutions to Hermitian eigenvalue problems Hv = λv , such as those occurring in quantum chemistry. It is natural to ask whether the same technique can be applied to generalized eigenvalue problems Av = λBv , which arise in many areas of science and engineering. Here, we answer this question affirmatively. A restricted class of generalized eigenvalue problems could be solved as efficiently as standard eigenvalue problems. A paradigmatic example is provided by Sturm-Liouville problems. Another example comes from linear ideal magnetohydrodynamics, where phase estimation could be used to determine the stability of magnetically confined plasmas in fusion reactors.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Advances in Rosetta structure prediction for difficult molecular-replacement problems

Modeling advances using Rosetta structure prediction to aid in solving difficult molecular-replacement problems are discussed. Recent work has shown the effectiveness of structure-prediction methods in solving difficult molecular-replacement problems. The Rosetta protein structure modeling suite can aid in the solution of difficult molecular-replacement problems using templates from 15 to 25% sequence identity; Rosetta refinement guided by noisy density has consistently led to solved structures where other methods fail. In this paper, an overview of the use of Rosetta for these difficult molecular-replacement problems is provided and new modeling developments that further improve model quality are described. Several variations to the method are introduced that significantly reduce the time needed to generate a model and the sampling required to improve the starting template. The improvements are benchmarked on a set of nine difficult cases and it is shown that this improved method obtains consistently better models in less running time. Finally, strategies for best using Rosetta to solve difficult molecular-replacement problems are presented and future directions for the role of structure-prediction methods in crystallography are discussed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Large Scale Parallel Solution of Incompressible Flow Problems Using Uintah and Hypre

The Uintah Software framework was developed to provide an environment for solving fluid-structure interaction problems on structured adaptive grids on large-scale, long-running, data-intensive problems. Uintah uses a combination of fluid-flow solvers and particle-based methods for solids together with a novel asynchronous task-based approach with fully automated load balancing. As Uintah is often used to solve incompressible flow problems in combustion applications it is important to have a scalable linear solver. While there are many such solvers available, the scalability of those codes varies greatly. The hypre software offers a range of solvers and pre-conditioners for different types of grids. The weak scalability of Uintah and hypre is addressed for particular examples of both packages when applied to a number of incompressible flow problems. After careful software engineering to reduce startup costs, much better than expected weak scalability is seen for up to 100K cores on NSFs Kraken architecture and up to260K cpu cores, on DOEs new Titan machine. The scalability is found to depend in a crtitical way on the choice of algorithm used by hypre for a realistic application problem.

Computer Science↗

Solving Eco-Driving Problems Using Indirect Collocation Method and Smooth Representation

Here, we discuss the eco-driving problem, considering both electric and conventional powertrains, and presents a pathway to solving it numerically using an indirect collocation method. Despite the low-order system dynamics, the piecewise fuel/efficiency map, gear shifting, and real-world traffic/road situations bring system discontinuities/switchings and pure state constraints into the problem formulation, which make the problem highly nonlinear and nontrivial to solve. This letter introduces smooth approximations to convert the original problem to an unconstrained (and penalized) smooth boundary-value problem. This approach eliminates the discussion of the switching structure and leads to a lightweight Newton-method-based solution procedure.

42 ENGINEERING↗

Computing the Feasible Spaces of Optimal Power Flow Problems

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem’s feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem’s inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation (NPHC) algorithm. To improve computational tractability, “bound tightening” and “grid pruning” algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. Here, the proposed algorithm is used to generate the feasible spaces of two small test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗