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 181 records · Page 10

Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems

Technologies for a quantum/classical hybrid approach to solving optimization problems is disclosed. In the illustrative embodiment, an optimization problem is decomposed into two sub-problems. The first sub-problem is solved on a classical computer, and a result from the first sub-problem is provided to a quantum computer. The quantum computer then solves the second sub-problem based on the result of the first sub-problem from the classical computer. The quantum computer can then provide a result to the classical computer to re-solve the first problem. The iterative calculation is continued until an end condition is met.

You, Fengqi↗

Classical Solvability of the Radial Viscous Fingering Problem in a Hele–Shaw Cell with Surface Tension

We consider the one-phase problem on radial viscous fingering structures in a Hele–Shaw cell with surface tension. This problem is a nonlinear free-boundary problem for elliptic equations. Unlike the Stefan problem for the heat equation, we deal with a problem of hydrodynamic type. We establish the classical solvability of the one-phase Hele–Shaw problem with radial geometry by using the same method as that used for the Stefan problem and justifying the vanishing coefficient of the time-derivative in the parabolic equation.

97 MATHEMATICS AND COMPUTING↗

Quantum computing for a profusion of postman problem variants

In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.

97 MATHEMATICS AND COMPUTING↗

Green's function-stochastic methods framework for probing nonlinear evolution problems: Burger's equation, the nonlinear Schroedinger's equation, and hydrodynamic organization of near-molecular-scale vorticity

Research Highlights: > Systematic approach for physically probing nonlinear and random evolution problems. > Evolution of vortex sheets corresponds to evolution of an Ornstein-Uhlenbeck process. > Organization of near-molecular scale vorticity mediated by hydrodynamic modes. > Framework allows calculation of vorticity evolution within random strain fields. - Abstract: A framework which combines Green's function (GF) methods and techniques from the theory of stochastic processes is proposed for tackling nonlinear evolution problems. The framework, established by a series of easy-to-derive equivalences between Green's function and stochastic representative solutions of linear drift-diffusion problems, provides a flexible structure within which nonlinear evolution problems can be analyzed and physically probed. As a preliminary test bed, two canonical, nonlinear evolution problems - Burgers' equation and the nonlinear Schroedinger's equation - are first treated. In the first case, the framework provides a rigorous, probabilistic derivation of the well known Cole-Hopf ansatz. Likewise, in the second, the machinery allows systematic recovery of a known soliton solution. The framework is then applied to a fairly extensive exploration of physical features underlying evolution of randomly stretched and advected Burger's vortex sheets. Here, the governing vorticity equation corresponds to the Fokker-Planck equation of an Ornstein-Uhlenbeck process, a correspondence that motivates an investigation of sub-sheet vorticity evolution and organization. Under the assumption that weak hydrodynamic fluctuations organize disordered, near-molecular-scale, sub-sheet vorticity, it is shown that these modes consist of two weakly damped counter-propagating cross-sheet acoustic modes, a diffusive cross-sheet shear mode, and a diffusive cross-sheet entropy mode. Once a consistent picture of in-sheet vorticity evolution is established, a number of analytical results, describing the motion and spread of single, multiple, and continuous sets of Burger's vortex sheets, evolving within deterministic and random strain rate fields, under both viscous and inviscid conditions, are obtained. In order to promote application to other nonlinear problems, a tutorial development of the framework is presented. Likewise, time-incremental solution approaches and construction of approximate, though otherwise difficult-to-obtain backward-time GF's (useful in solution of forward-time evolution problems) are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The mimetic finite difference method for elliptic and parabolic problems with a staggered discretization of diffusion coefficient

Numerical schemes for nonlinear parabolic equations based on the harmonic averaging of cell-centered diffusion coefficients break down when some of these coefficients go to zero or their ratio grows. To tackle this problem, we propose new mimetic finite difference schemes that use a staggered discretization of the diffusion coefficient. The primary mimetic operator approximates div (k•); the derived (dual) mimetic operator approximates - ∇(•). The new mimetic schemes preserve symmetry and positive-definiteness of the continuum problem which allows us to use algebraic solvers with optimal complexity. We perform detailed numerical analysis of the new schemes for linear elliptic problems and a specially designed linear parabolic problem that has solution dynamics typical for nonlinear problems. We also show that the new schemes are competitive with the state-of-the-art schemes for steady-state problems but provide much more accurate solution dynamics for the transient problem.

97 MATHEMATICS AND COMPUTING↗

On relaxations of the max k -cut problem formulations

Here, a tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max k-cut problem is a fundamental combinatorial optimization problem with multiple notorious mixed integer optimization formulations. In this paper, we explore four existing mixed integer optimization formulations of the max k-cut problem. Specifically, we show that the continuous relaxation of a binary quadratic optimization formulation of the problem is: (i) stronger than the continuous relaxation of two mixed integer linear optimization formulations and (ii) at least as strong as the continuous relaxation of a mixed integer semidefinite optimization formulation. We also conduct a set of experiments on multiple sets of instances of the max k-cut problem using state-of-the-art solvers that empirically confirm the theoretical results in item (i). Furthermore, these numerical results illustrate the advances in the efficiency of global non-convex quadratic optimization solvers and more general mixed integer nonlinear optimization solvers. As a result, these solvers provide a promising option to solve combinatorial optimization problems. Our codes and data are available on GitHub.

97 MATHEMATICS AND COMPUTING↗

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗

Robust A-Optimal Experimental Design for Sensor Placement in Bayesian Linear Inverse Problems

Optimal design of experiments for Bayesian inverse problems has recently gained wide popularity and attracted much attention, especially in the computational science and Bayesian inversion communities. An optimal design maximizes a predefined utility function that is formulated in terms of the elements of an inverse problem, an example being optimal sensor placement for parameter identification. The state-of-the-art algorithmic approaches following this simple formulation generally overlook misspecification of the elements of the inverse problem, such as the prior or the measurement uncertainties. This work presents an efficient algorithmic approach for designing optimal experimental design schemes for Bayesian linear inverse problems such that the optimal design is robust to misspecification of elements of the inverse problem. Specifically, we consider a worst-case scenario approach for the uncertain or misspecified parameters, formulate robust objectives, and propose an algorithmic approach for optimizing such objectives. Furthermore, both relaxation and stochastic solution approaches are discussed with detailed analysis and insight into the interpretation of the problem and the proposed algorithmic approach. Extensive numerical experiments to validate and analyze the proposed approach are carried out for sensor placement in a parameter identification problem.

Bayesian inverse problems↗

The nonequilibrium quantum many-body problem as a paradigm for extreme data science

Generating big data pervades much of physics. But some problems, which we call extreme data problems, are too large to be treated within big data science. The nonequilibrium quantum many-body problem on a lattice is just such a problem, where the Hilbert space grows exponentially with system size and rapidly becomes too large to fit on any computer (and can be effectively thought of as an infinite-sized data set). Nevertheless, much progress has been made with computational methods on this problem, which serve as a paradigm for how one can approach and attack extreme data problems. In addition, viewing these physics problems from a computer-science perspective leads to new approaches that can be tried to solve more accurately and for longer times. In this work, we review a number of these different ideas.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

The cosmological moduli problem and naturalness

Nowadays, the cosmological moduli problem (CMP) comes in three parts: 1. potential violation of Big-Bang nucleosynthesis (BBN) constraints from late decaying moduli fields, 2. the moduli-induced gravitino problem wherein gravitinos are overproduced and their decays violate BBN or dark matter overproduction bounds and 3. the moduli-induced lightest SUSY particle (LSP) overproduction problem. Also, the CMP may be regarded as either a problem or else a solution to scenarios with dark matter over- or under-production. We examine the cosmological moduli problem and its connection to electroweak naturalness. We calculate the various two-body decay widths of a light modulus field into MSSM particles and gravitinos within general supersymmetric models. We include both phase space and mixing effects. We examine cases without and with helicity suppression of modulus decays to gravitinos (cases 1 & 2) and/or gauginos (cases A & B). For case B1, we evaluate regions of gravitino mass m 3/2 vs. modulus mass mΦ parameter space constrained by BBN, by overproduction of gravitinos and by overproduction of neutralino dark matter, along with connections to naturalness. For this case, essentially all of parameter space is excluded unless mΦ ≳ 2.5 × 10 3 TeV with mΦ< 2m 3/2 For a potentially most propitious case B2 with Φ decay to Higgs and matter turned off, then modulus branching fractions to SUSY and to gravitinos become highly suppressed at large m Φ . But since the modulus number density increases faster than the branching fractions decrease, there is still gross overproduction of neutralino dark matter. We also show that in this scenario the thermally produced gravitino problem is fixed by huge entropy dilution, but non-thermal gravitino production from moduli decay remains a huge problem unless it is kinematically suppressed with m Φ < 2m 3/2 . In a pedagogical appendix, we present detailed calculations of modulus field two-body decay widths.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An Augmented Lagrangian Method for a Class of Inverse Quadratic Programming Problems

We consider an inverse quadratic programming (QP) problem in which the parameters in the objective function of a given QP problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a minimization problem with a positive semidefinite cone constraint and its dual is a linearly constrained semismoothly differentiable (SC{sup 1}) convex programming problem with fewer variables than the original one. We demonstrate the global convergence of the augmented Lagrangian method for the dual problem and prove that the convergence rate of primal iterates, generated by the augmented Lagrange method, is proportional to 1/r, and the rate of multiplier iterates is proportional to 1/{radical}r, where r is the penalty parameter in the augmented Lagrangian. As the objective function of the dual problem is a SC{sup 1} function involving the projection operator onto the cone of symmetrically semi-definite matrices, the analysis requires extensive tools such as the singular value decomposition of matrices, an implicit function theorem for semismooth functions, and properties of the projection operator in the symmetric-matrix space. Furthermore, the semismooth Newton method with Armijo line search is applied to solve the subproblems in the augmented Lagrange approach, which is proven to have global convergence and local quadratic rate. Finally numerical results, implemented by the augmented Lagrangian method, are reported.

97 MATHEMATICS AND COMPUTING↗

About an Optimal Visiting Problem

In this paper we are concerned with the optimal control problem consisting in minimizing the time for reaching (visiting) a fixed number of target sets, in particular more than one target. Such a problem is of course reminiscent of the famous 'Traveling Salesman Problem' and brings all its computational difficulties. Our aim is to apply the dynamic programming technique in order to characterize the value function of the problem as the unique viscosity solution of a suitable Hamilton-Jacobi equation. We introduce some 'external' variables, one per target, which keep in memory whether the corresponding target is already visited or not, and we transform the visiting problem in a suitable Mayer problem. This fact allows us to overcome the lacking of the Dynamic Programming Principle for the originary problem. The external variables evolve with a hysteresis law and the Hamilton-Jacobi equation turns out to be discontinuous.

97 MATHEMATICS AND COMPUTING↗

Nonoverlapping Localized Exponential Time Differencing Methods for Diffusion Problems

In this paper, we propose nonoverlapping localized exponential time differencing (ETD) methods for diffusion problems. The model time-dependent diffusion equation is first reformulated on subdomains based on the nonoverlapping domain decomposition, in which Neumann boundary conditions are imposed on the interfaces for the subdomain problems and Dirichlet type conditions are enforced to form a space-time interface problem. After spatial discretization by standard central finite differences and temporal integration with the first or second order ETD methods, the fully discrete interface problem is obtained. Such an interface problem is then solved iteratively either at each time step or over the whole time interval: the former involves the solution of stationary problems in each subdomain at each iteration while the latter involves the solution of time-dependent subdomain problems at each iteration. For both approaches, we prove that localized ETD solutions conserve mass exactly and converge in time to the exact space semidiscrete solution. Numerical experiments in two dimensions are also presented to illustrate the performance of the proposed methods.

Mass conservation↗

Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer

NP-hard problems such as the maximum clique or minimum vertex cover problems, two of Karp’s 21 NP-hard problems, have several applications in computational chemistry, biochemistry and computer network security. Adiabatic quantum annealers can search for the optimum value of such NP-hard optimization problems, given the problem can be embedded on their hardware. However, this is often not possible due to certain limitations of the hardware connectivity structure of the annealer. This paper studies a general framework for a decomposition algorithm for NP-hard graph problems aiming to identify an optimal set of vertices. Our generic algorithm allows us to recursively divide an instance until the generated subproblems can be embedded on the quantum annealer hardware and subsequently solved. Furthermore, the framework is applied to the maximum clique and minimum vertex cover problems, and we propose several pruning and reduction techniques to speed up the recursive decomposition. The performance of both algorithms is assessed in a detailed simulation study.

97 MATHEMATICS AND COMPUTING↗

A multitree approach for global solution of ACOPF problems using piecewise outer approximations

Electricity markets rely on the rapid solution of the optimal power flow (OPF) problem to determine generator power levels and set nodal prices. Traditionally, the OPF problem has been formulated using linearized, approximate models, ignoring nonlinear alternating current (AC) physics. These approaches do not guarantee global optimality or even feasibility in the real ACOPF problem. We introduce an outer-approximation approach to solve the ACOPF problem to global optimality based on alternating solution of upper- and lower-bounding problems. The lower-bounding problem is a piecewise relaxation based on strong second-order cone relaxations of the ACOPF, and these piecewise relaxations are selectively refined at each major iteration through increased variable domain partitioning. Our approach is able to efficiently solve all but one of the test cases considered to an optimality gap below 0.1%. This approach opens the door for global solution of MINLP problems with AC power flow equations.

42 ENGINEERING↗

Evaluation of accuracy and convergence of numerical coupling approaches for poroelasticity benchmark problems

Accurate modeling of subsurface flow and transport processes is vital as the prevalence of subsurface activities such as carbon sequestration, geothermal recovery, and nuclear waste disposal increases. Computational modeling of these problems leverages poroelasticity theory, which describes coupled fluid flow and mechanical deformation. Although fully coupled monolithic schemes are accurate for coupled problems, they can demand significant computational resources for large problems. In this work, a fixed stress scheme is implemented into the Sandia Sierra Multiphysics toolkit. Two implementation methods, along with the fully coupled method, are verified with one-dimensional (1D) Terzaghi, 2D Mandel, and 3D Cryer sphere benchmark problems. The impact of a range of material parameters and convergence tolerances on numerical accuracy and efficiency was evaluated. Overall the fixed stress schemes achieved acceptable numerical accuracy and efficiency compared to the fully coupled scheme. However, the accuracy of the fixed stress scheme tends to decrease with low permeable cases, requiring the finer tolerance to achieve a desired numerical accuracy. For the fully coupled scheme, high numerical accuracy was observed in most of cases except a low permeability case where an order of magnitude finer tolerance was required for accurate results. Finally, a two-layer Terzaghi problem and an injection–production well system were used to demonstrate the applicability of findings from the benchmark problems for more realistic conditions over a range of permeability. Simulation results suggest that the fixed stress scheme provides accurate solutions for all cases considered with the proper adjustment of the tolerance. Furthermore, this work clearly demonstrates the robustness of the fixed stress scheme for coupled poroelastic problems, while a cautious selection of numerical tolerance may be required under certain conditions with low permeable materials.

58 GEOSCIENCES↗

Bowel, Urinary, and Sexual Problems Among Long-Term Prostate Cancer Survivors: A Population-Based Study

Purpose: To obtain insight into the long-term (5- to 10-year) effects of prostate cancer and treatment on bowel, urinary, and sexual function, we performed a population-based study. Prostate-specific function was compared with an age-matched normative population without prostate cancer. Methods and Materials: Through the population-based Eindhoven Cancer Registry, we selected all men diagnosed with prostate cancer between 1994 and 1998 in the southern Netherlands. In total, 964 patients, alive in November 2004, received questionnaire; 780 (81%) responded. Results: Urinary problems were most common after a prostatectomy; bowel problems were most common after radiotherapy. Compared with an age-matched normative population both urinary and bowel functioning and bother were significantly worse among survivors. Urinary incontinence was reported by 23-48% of survivors compared with 4% of the normative population. Bowel leakage occurred in 5-14% of patients compared with 2% of norms. Erection problems occurred in 40-74% of patients compared with 18% of norms. Conclusions: These results form an important contribution to the limited information available on prostate-specific problems in the growing group of long-term prostate cancer survivors. Bowel, urinary, and sexual problems occur more often among long-term survivors compared with a reference group and cannot be explained merely by age. Because these problems persist for many years, urologists should provide patients with adequate information before treatment. After treatment, there should be an appropriate focus on these problems.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

High-order partitioned spectral deferred correction solvers for multiphysics problems

We present an arbitrarily high-order, conditionally stable, partitioned spectral deferred correction (SDC) method for solving multiphysics problems using a sequence of pre-existing single-physics solvers. This method extends the work in [1], [2], which used implicit-explicit Runge-Kutta methods (IMEX) to build high-order, partitioned multiphysics solvers. We consider a generic multiphysics problem modeled as a system of coupled ordinary differential equations (ODEs), coupled through coupling terms that can depend on the state of each subsystem; therefore the method applies to both a semi-discretized system of partial differential equations (PDEs) or problems naturally modeled as coupled systems of ODEs. The sufficient conditions to build arbitrarily high-order partitioned SDC schemes are derived. Based on these conditions, various of partitioned SDC schemes are designed. The stability of the first-order partitioned SDC scheme is analyzed in detail on a coupled, linear model problem. We show that the scheme is conditionally stable, and under conditions on the coupling strength, the scheme can be unconditionally stable. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems with moderate coupling strength. They include a stiff linear system of ODEs, advection-diffusion-reaction systems, and fluid-structure interaction problems with both incompressible and compressible flows, where we verify the design order of the SDC schemes and study various stability properties. We also directly compare the accuracy, stability, and cost of the proposed partitioned SDC solver with the partitioned IMEX method in [1], [2] on this suite of test problems. The results suggest that the high-order partitioned SDC solvers are more robust than the partitioned IMEX solvers for the numerical examples considered in this work, while the IMEX methods require fewer implicit solves.

97 MATHEMATICS AND COMPUTING↗