22,353 research outputs found
Dynamic p-enrichment schemes for multicomponent reactive flows
We present a family of p-enrichment schemes. These schemes may be separated
into two basic classes: the first, called \emph{fixed tolerance schemes}, rely
on setting global scalar tolerances on the local regularity of the solution,
and the second, called \emph{dioristic schemes}, rely on time-evolving bounds
on the local variation in the solution. Each class of -enrichment scheme is
further divided into two basic types. The first type (the Type I schemes)
enrich along lines of maximal variation, striving to enhance stable solutions
in "areas of highest interest." The second type (the Type II schemes) enrich
along lines of maximal regularity in order to maximize the stability of the
enrichment process. Each of these schemes are tested over a pair of model
problems arising in coastal hydrology. The first is a contaminant transport
model, which addresses a declinature problem for a contaminant plume with
respect to a bay inlet setting. The second is a multicomponent chemically
reactive flow model of estuary eutrophication arising in the Gulf of Mexico.Comment: 29 pages, 7 figures, 3 table
Inexact Convex Relaxations for AC Optimal Power Flow: Towards AC Feasibility
Convex relaxations of AC optimal power flow (AC-OPF) problems have attracted
significant interest as in several instances they provably yield the global
optimum to the original non-convex problem. If, however, the relaxation is
inexact, the obtained solution is not AC-feasible. The quality of the obtained
solution is essential for several practical applications of AC-OPF, but
detailed analyses are lacking in existing literature. This paper aims to cover
this gap. We provide an in-depth investigation of the solution characteristics
when convex relaxations are inexact, we assess the most promising AC
feasibility recovery methods for large-scale systems, and we propose two new
metrics that lead to a better understanding of the quality of the identified
solutions. We perform a comprehensive assessment on 96 different test cases,
ranging from 14 to 3120 buses, and we show the following: (i) Despite an
optimality gap of less than 1%, several test cases still exhibit substantial
distances to both AC feasibility and local optimality and the newly proposed
metrics characterize these deviations. (ii) Penalization methods fail to
recover an AC-feasible solution in 15 out of 45 cases, and using the proposed
metrics, we show that most failed test instances exhibit substantial distances
to both AC-feasibility and local optimality. For failed test instances with
small distances, we show how our proposed metrics inform a fine-tuning of
penalty weights to obtain AC-feasible solutions. (iii) The computational
benefits of warm-starting non-convex solvers have significant variation, but a
computational speedup exists in over 75% of the cases
Level Set Methods for Stochastic Discontinuity Detection in Nonlinear Problems
Stochastic physical problems governed by nonlinear conservation laws are
challenging due to solution discontinuities in stochastic and physical space.
In this paper, we present a level set method to track discontinuities in
stochastic space by solving a Hamilton-Jacobi equation. By introducing a speed
function that vanishes at discontinuities, the iso-zero of the level set
problem coincide with the discontinuities of the conservation law. The level
set problem is solved on a sequence of successively finer grids in stochastic
space. The method is adaptive in the sense that costly evaluations of the
conservation law of interest are only performed in the vicinity of the
discontinuities during the refinement stage. In regions of stochastic space
where the solution is smooth, a surrogate method replaces expensive evaluations
of the conservation law. The proposed method is tested in conjunction with
different sets of localized orthogonal basis functions on simplex elements, as
well as frames based on piecewise polynomials conforming to the level set
function. The performance of the proposed method is compared to existing
adaptive multi-element generalized polynomial chaos methods
- …