Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOptimal fire allocation in a combat model of mixed NCW type
154
0
0.0
(
0
)
Added by
Anh My Vu
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this work, we introduce a nonlinear Lanchester model of NCW-type and study a problem of finding the optimal fire allocation for this model. A Blue party $B$ will fight against a Red party consisting of $A$ and $R$, where $A$ is an independent force and $R$ fights with supports from a supply unit $N$. A battle may consist of several stages but we consider the problem of finding optimal fire allocation for $B$ in the first stage only. Optimal fire allocation is a set of three non-negative numbers whose sum equals to one, such that the remaining force of $B$ is maximal at any instants. In order to tackle this problem, we introduce the notion of textit{threatening rates} which are computed for $A, R, N$ at the beginning of the battle. Numerical illustrations are presented to justify the theoretical findings.
rate research
Read More
We introduce a new sinc-type molecular beam epitaxy model which is derived from a cosine-type energy functional. The landscape of the new functional is remarkably similar to the classical MBE model with double well potential but has the additional advantage that all its derivatives are uniformly bounded. We consider first order IMEX and second order BDF2 discretization schemes. For both cases we quantify explicit time step constraints for the energy dissipation which is in good accord with the practical numerical simulations. Furthermore we introduce a new theoretical framework and prove unconditional uniform energy boundedness with no size restrictions on the time step. This is the first unconditional (i.e. independent of the time step size) result for semi-implicit methods applied to the phase field models without introducing any artificial stabilization terms or fictitious variables.
Recently a Dynamic-Monge-Kantorovich formulation of the PDE-based $L^1$-optimal transport problem was presented. The model considers a diffusion equation enforcing the balance of the transported masses with a time-varying conductivity that volves proportionally to the transported flux. In this paper we present an extension of this model that considers a time derivative of the conductivity that grows as a power law of the transport flux with exponent $beta>0$. A sub-linear growth ($0<beta<1$) penalizes the flux intensity and promotes distributed transport, with equilibrium solutions that are reminiscent of Congested Transport Problems. On the contrary, a super-linear growth ($beta>1$) favors flux intensity and promotes concentrated transport, leading to the emergence of steady-state singular and fractal-like configurations that resemble those of Branched Transport Problems. We derive a numerical discretization of the proposed model that is accurate, efficient, and robust for a wide range of scenarios. For $beta>1$ the numerical model is able to reproduce highly irregular and fractal-like formations without any a-priory structural assumption.
Reduced model spaces, such as reduced basis and polynomial chaos, are linear spaces $V_n$ of finite dimension $n$ which are designed for the efficient approximation of families parametrized PDEs in a Hilbert space $V$. The manifold $mathcal{M}$ that gathers the solutions of the PDE for all admissible parameter values is globally approximated by the space $V_n$ with some controlled accuracy $epsilon_n$, which is typically much smaller than when using standard approximation spaces of the same dimension such as finite elements. Reduced model spaces have also been proposed in [13] as a vehicle to design a simple linear recovery algorithm of the state $uinmathcal{M}$ corresponding to a particular solution when the values of parameters are unknown but a set of data is given by $m$ linear measurements of the state. The measurements are of the form $ell_j(u)$, $j=1,dots,m$, where the $ell_j$ are linear functionals on $V$. The analysis of this approach in [2] shows that the recovery error is bounded by $mu_nepsilon_n$, where $mu_n=mu(V_n,W)$ is the inverse of an inf-sup constant that describe the angle between $V_n$ and the space $W$ spanned by the Riesz representers of $(ell_1,dots,ell_m)$. A reduced model space which is efficient for approximation might thus be ineffective for recovery if $mu_n$ is large or infinite. In this paper, we discuss the existence and construction of an optimal reduced model space for this recovery method, and we extend our search to affine spaces. Our basic observation is that this problem is equivalent to the search of an optimal affine algorithm for the recovery of $mathcal{M}$ in the worst case error sense. This allows us to perform our search by a convex optimization procedure. Numerical tests illustrate that the reduced model spaces constructed from our approach perform better than the classical reduced basis spaces.
We demonstrate that the recently developed Optimal Uncertainty Quantification (OUQ) theory, combined with recent software enabling fast global solutions of constrained non-convex optimization problems, provides a methodology for rigorous model certification, validation, and optimal design under uncertainty. In particular, we show the utility of the OUQ approach to understanding the behavior of a system that is governed by a partial differential equation -- Burgers equation. We solve the problem of predicting shock location when we only know bounds on viscosity and on the initial conditions. Through this example, we demonstrate the potential to apply OUQ to complex physical systems, such as systems governed by coupled partial differential equations. We compare our results to those obtained using a standard Monte Carlo approach, and show that OUQ provides more accurate bounds at a lower computational cost. We discuss briefly about how to extend this approach to more complex systems, and how to integrate our approach into a more ambitious program of optimal experimental design.
In this paper, we systemically review and compare two mixed multiscale finite element methods (MMsFEM) for multiphase transport in highly heterogeneous media. In particular, we will consider the mixed multiscale finite element method using limited global information, simply denoted by MMsFEM, and the mixed generalized multiscale finite element method (MGMsFEM) with residual driven online multiscale basis functions. Both methods are under the framework of mixed multiscale finite element methods, where the pressure equation is solved in the coarse grid with carefully constructed multiscale basis functions for the velocity. The multiscale basis functions in both methods include local and global media information. In terms of MsFEM using limited global information, only one multiscale basis function is utilized in each local neighborhood while multiple basis are used in MGMsFEM. We will test and compare these two methods using the benchmark three-dimensional SPE10 model. A range of coarse grid sizes and different combinations of basis functions (offline and online) will be considered with CPU time reported for each case. In our numerical experiments, we observe good accuracy by the two above methods. Finally, we will discuss and compare the advantages and disadvantages of the two methods in terms of accuracy and computational costs.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
