Search NASA⌕ Search

SEARCH · Search NASA

Results for “mixed formulation”

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 19 records

A mixed formulation of the plane-stress problem to facilitate reuse of constitutive models in finite-element programs

Here, the plane-stress assumption can be challenging to support in a finite element program because it traditionally requires separate implementations of constitutive models than those intended for three-dimensional or two-dimensional plane-strain simulations. As a solution to this issue, this paper presents a method to solve the plane-stress problem using a mixed formulation. In this formulation, the out-of-plane strain is treated as a field variable that is solved for in addition to the standard in-plane displacement variables, in a manner that weakly enforces the condition that the out-of-plane stress is zero. The proposed formulation is non-intrusive, requiring no modifications to the constitutive models in contrast to the conventional plane-stress formulation. The proposed mixed formulation has been benchmarked against analytical solutions and numerical solutions, with good performance and accuracy.

97 MATHEMATICS AND COMPUTING↗

High-order gradients with the shifted boundary method: An embedded enriched mixed formulation for elliptic PDEs

Here, we propose an extension of the embedded boundary method known as “shifted boundary method” to elliptic diffusion equations in mixed form (e.g., Darcy flow, heat diffusion problems with rough coefficients, etc.). Our aim is to obtain an improved formulation that, for linear finite elements, is at least second-order accurate for both flux and primary variable, when either Dirichlet or Neumann boundary conditions are applied. Following previous work of Nishikawa and Mazaheri in the context of residual distribution methods, we consider the mixed form of the diffusion equation (i.e., with Darcy-type operators), and introduce an enrichment of the primary variable. This enrichment is obtained exploiting the relation between the primary variable and the flux variable, which is explicitly available at nodes in the mixed formulation. The proposed enrichment mimics a formally quadratic pressure approximation, although only nodal unknowns are stored, similar to a linear finite element approximation. We consider both continuous and discontinuous finite element approximations and present two approaches: a non-symmetric enrichment, which, as in the original references, only improves the consistency of the overall method; and a symmetric enrichment, which enables a full error analysis in the classical finite element context. Combined with the shifted boundary method, these two approaches are extended to high-order embedded computations, and enable the approximation of both primary and flux (gradient) variables with second-order accuracy, independently on the type of boundary conditions applied. We also show that the primary variable is third-order accurate, when pure Dirichlet boundary conditions are embedded.

97 MATHEMATICS AND COMPUTING↗

Some domain decomposition algorithms for mixed formulations of elasticity and incompressible fluids.

In this talk, we present a collection of domain decomposition algorithms for mixed finite element formulations of elasticity and incompressible fluids. The key component of each of these algorithms is the coarse space. Here, the coarse spaces are obtained in an algebraic manner by harmonically extending coarse boundary data. Various aspects of the coarse spaces are discussed for both continuous and discontinuous interpolation of pressure. Further, both classical overlapping Schwarz and hybrid iterative substructuring preconditioners are described. Numerical results are presented for almost incompressible elasticity and the Navier Stokes equations which demonstrate the utility of the methods for both structured and irregular mesh decompositions. We also discuss a simple residual scaling approach which often leads to significant reductions in iterations for these algorithms.

99 GENERAL AND MISCELLANEOUS↗

Deep Convective Organization, Moisture Vertical Structure, and Convective Transition Using Deep-Inflow Mixing

It is an open question whether an integrated measure of buoyancy can yield a strong relation to precipitation across tropical land and ocean, across the seasonal and diurnal cycles, and for varying degrees of convective organization. Building on previous work, entraining plume buoyancy calculations reveal that differences in convective onset as a function of column water vapor (CWV) over land and ocean, as well as seasonally and diurnally over land, are largely due to variability in the contribution of lower-tropospheric humidity to the total column moisture. Over land, the relationship between deep convection and lower-free-tropospheric moisture is robust across all seasons and times of day, whereas the relation to boundary layer moisture is robust for the daytime only. Using S-band radar, these transition statistics are examined separately for mesoscale and smaller-scale convection. The probability of observing mesoscale convective systems sharply increases as a function of lower-free-tropospheric humidity. The consistency of this with buoyancy-based parameterization is examined for several mixing formulations. Mixing corresponding to deep inflow of environmental air into a plume that grows with height, which incorporates nearly equal weighting of boundary layer and free-tropospheric air, yields buoyancies consistent with the observed onset of deep convection across the seasonal and diurnal cycles in the Amazon. Furthermore, it provides relationships that are as strong or stronger for mesoscale-organized convection as for smaller-scale convection.

54 ENVIRONMENTAL SCIENCES↗

Disjunctive linear separation conditions and mixed-integer formulations for aircraft conflict resolution

In this paper, we address the aircraft conflict resolution problem in air traffic control. We introduce new mixed-integer programming formulations for aircraft conflict resolution with speed, heading and altitude control which are based on disjunctive linear separation conditions. We first examine the two-dimensional aircraft conflict resolution problem with speed and heading control represented as continuous decision variables. We show that the proposed disjunctive linear separation conditions are equivalent to the classical nonlinear conditions for aircraft separation. Further, we characterise conflict-free trajectories based on aircraft velocity bounds and propose a simple pre-processing algorithm to identify aircraft pairs which are either always conflict-free, or which cannot be separated using speed and heading control only. We then incorporate altitude control and propose a lexicographic optimisation formulation that aims to minimise the number of flight level changes before resolving outstanding conflicts via two-dimensional velocity control. The proposed mixed-integer programming formulations are nonconvex, and we propose convex relaxations, decomposition methods and constraint generation algorithms to solve the two-dimensional and lexicographic optimisation formulations to guaranteed optimality. Numerical experiments on four types of conflict resolution benchmarking instances are conducted to test the performance of the proposed mixed-integer formulations. Further, the proposed method is compared against two benchmarks based on state-of-the-art approaches for the aircraft conflict resolution problem. Our numerical results show that the proposed method largely outperforms both benchmarks in terms of runtime and is able to solve significantly more instances to global optimality.

97 MATHEMATICS AND COMPUTING↗

On Mixed-Integer Programming Formulations for the Unit Commitment Problem

We provide a comprehensive overview of mixed-integer programming formulations for the unit commitment (UC) problem. UC formulations have been an especially active area of research over the past 12 years due to their practical importance in power grid operations, and this paper serves as a capstone for this line of work. We additionally provide publicly available reference implementations of all formulations examined. We computationally test existing and novel UC formulations on a suite of instances drawn from both academic and real-world data sources. Driven by our computational experience from this and previous work, we contribute some additional formulations for both generator production upper bounds and piecewise linear production costs. By composing new UC formulations using existing components found in the literature and new components introduced in this paper, we demonstrate that performance can be significantly improved—and in the process, we identify a new state-of-the-art UC formulation.

97 MATHEMATICS AND COMPUTING↗

Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation

In several areas of economics and engineering, it is often necessary to fit discrete data points or approximate nonlinear functions with continuous functions. Piecewise linear (PWL) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables. Moreover, there is a computational benefit in using PWL functions that have the least possible number of segments. This work proposes a novel hierarchical mixed integer linear programming (MILP) formulation that identifies a continuous PWL approximation with minimum number of linear segments for a given target maximum error. The proposed MILP formulation also identifies the solution with the least maximum error among the solutions with minimum number of segments. Then, this work proposes a fast iterative algorithm that identifies non necessarily continuous PWL approximations by solving O(S log N) linear programming (LP) problems, where N is the number of data points and S is the minimum number of segments in the non necessarily continuous case. This work demonstrates that tight bounds for the MILP problem can be derived from these approximations. Next, a fast algorithm is introduced to transform a non necessarily continuous PWL approximation into a continuous one. Finally, the tight bounds and the continuous PWL approximations are used to tighten and warm start the MILP problem. The tightened formulation is shown in experimental results to be more efficient, especially for large data sets, with a solution time that is up to two orders of magnitude less than the existing literature.

97 MATHEMATICS AND COMPUTING↗

Learning Symbolic Expressions: Mixed-Integer Formulations, Cuts, and Heuristics

Here, in this paper, we consider the problem of learning a regression function without assuming its functional form. This problem is referred to as symbolic regression. An expression tree is typically used to represent a solution function, which is determined by assigning operators and operands to the nodes. Cozad and Sahinidis propose a nonconvex mixed-integer nonlinear program (MINLP), in which binary variables are used to assign operators and nonlinear expressions are used to propagate data values through nonlinear operators, such as square, square root, and exponential. We extend this formulation by adding new cuts that improve the solution of this challenging MINLP. We also propose a heuristic that iteratively builds an expression tree by solving a restricted MINLP. We perform computational experiments and compare our approach with a mixed-integer program–based method and a neural network–based method from the literature.

97 MATHEMATICS AND COMPUTING↗

Operational and Compositional Factors that Affect the Performance Properties of ARP/MCU Saltstone Grout

The Saltstone Production Facility (SPF) receives low level waste (LLW) salt solution from Tank 50H for treatment and disposal. Tank 50H receives transfers from the Effluent Treatment Project (ETP), the H-Canyon General Purpose Evaporator, and the Actinide Removal Process/Modular Caustic Side Solvent Extraction Unit (ARP/MCU) Decontaminated Salt Solution Hold Tank (DSS-HT). At the SPF, the LLW is mixed with premix (a cementitious mixture of portland cement (PC), blast furnace slag (BFS) and Class F fly ash (FA)) in a Readco mixer to produce fresh (uncured) saltstone that is transferred to the Saltstone Disposal Facility (SDF) vaults. The saltstone formulation (mix design) must produce a grout waste form that meets both placement and performance properties. In previous simulated saltstone studies, multiple compositional factors were identified that drive the performance properties of saltstone made from the projected ARP/MCU salt solution. This composition was selected as salt solution simulant since ARP/MCU is the primary influent into Tank 50H. The primary performance property investigated was hydraulic conductivity since it is a variable input property to the saltstone Performance Assessment (PA) transport model. In addition, the porosity, also referred to as void structure, is another variable that impacts the PA response. In addition, Young's modulus and cured density are other performance properties analyzed in this report; however they are indicators of the performance of saltstone and not direct inputs into the PA. The data from previous studies showed that the largest impact on the performance properties of saltstone was due to curing temperature, followed by aluminate concentration in the salt solution, water to premix ratio and premix composition. However, due to the scope of the previous studies, only a few mixes were cured and analyzed at higher temperatures. The samples cured at 60°C had an increased hydraulic conductivity of approximately 600 times that of the sample cured at room temperature. The hydration reactions initiated during the mixing of the premix and salt solution continue during the curing period in the vaults to produce the hardened waste form product. The heat generated from exothermic hydration reactions results in a temperature increase in the vaults that depends on the composition of the decontaminated salt solution being dispositioned, the grout formulation (mix design) and the pour frequency and volume. This heat generation is a contributing factor to the temperature increase in the vaults that leads to an increased cure temperature for the grout. This report will further investigate the impact of curing temperature on saltstone performance properties (hydraulic conductivity, Young's modulus, porosity, etc.) over a range of aluminate concentration, water to premix (w/p) ratio and weight percent fly ash in the premix processed at the SPF. The three curing temperatures selected for this study were chosen to provide data at fixed cure temperatures that represent measured temperatures in the SDF vaults. This does not represent the conditions in the vault where the temperature of the saltstone is continually changing with time. For example, it may take several days for the saltstone to reach 60°C at a given elevation. Previous results demonstrated that the rates at which a selected curing temperature is reached affect the performance properties. The approach taken in this task, a rapid increase to the curing temperature, may be conservative with respect to decreased performance. Nevertheless, the data will provide a basis from which to determine the impact of curing temperature on saltstone performance as a function of key variables. A statistical evaluation of the results for these mixes will be performed to provide the range, and associated uncertainties, of hydraulic conductivity and other properties over this factor space.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Optical spectroscopy of molecular junctions: Nonequilibrium Green’s functions perspective

We consider optical spectroscopy of molecular junctions from the quantum transport perspective when radiation field is quantized and optical response of the system is simulated as photon flux. Using exact expressions for photon and electronic fluxes derived within the nonequilibrium Green function (NEGF) methodology and utilizing fourth order diagrammatic perturbation theory (PT) in molecular coupling to radiation field, we perform simulations employing realistic parameters. Results of the simulations are compared to the bare PT which is usually employed in studies on nonlinear optical spectroscopy to classify optical processes. We show that the bare PT violates conservation laws, while flux conserving NEGF formulation mixes optical processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Three-level BDDC algorithm for saddle point problems

BDDC algorithms have previously been extended to the saddle point problems arising from mixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC algorithms, all iterates are required to be in a benign space, a subspace in which the preconditioned operators are positive definite. This requirement can lead to large coarse problems, which have to be generated and factored by a direct solver at the beginning of the computation and they can ultimately become a bottleneck. An additional level is introduced in this paper to solve the coarse problem approximately and to remove this difficulty. This three-level BDDC algorithm keeps all iterates in the benign space and the conjugate gradient methods can therefore be used to accelerate the convergence. This work is an extension of the three-level BDDC methods for standard finite element discretization of elliptic problems and the same rate of convergence is obtained for the mixed formulation of the same problems. Estimate of the condition number for this three-level BDDC methods is provided and numerical experiments are discussed.

97 MATHEMATICS AND COMPUTING↗

On Mixed Integer Programming Formulations for the Unit Commitment Problem

We provide a comprehensive overview of mixed integer programming formulations for the unit commitment problem (UC). UC formulations have been an especially active area of research over the past twelve years, due to their practical importance in power grid operations, and this paper serves as a capstone for this line of work. We additionally provide publicly available reference implementations of all formulations examined. We computationally test existing and novel UC formulations on a suite of instances drawn from both academic and real-world data sources. Driven by our computational experience from this and previous work, we contribute some additional formulations for both production upper bound and piecewise linear produc- tion costs. By composing new UC formulations using existing components found in the literature and new components introduced in this paper, we demonstrate that performance can be significantly improved – and in the process, we identify a new state-of-the-art UC formulation.

97 MATHEMATICS AND COMPUTING↗