Search results for "Computational Mathematic"
showing 10 items of 987 documents
A Fokker–Planck control framework for multidimensional stochastic processes
2013
AbstractAn efficient framework for the optimal control of probability density functions (PDFs) of multidimensional stochastic processes is presented. This framework is based on the Fokker–Planck equation that governs the time evolution of the PDF of stochastic processes and on tracking objectives of terminal configuration of the desired PDF. The corresponding optimization problems are formulated as a sequence of open-loop optimality systems in a receding-horizon control strategy. Many theoretical results concerning the forward and the optimal control problem are provided. In particular, it is shown that under appropriate assumptions the open-loop bilinear control function is unique. The res…
Solving fully randomized first-order linear control systems: Application to study the dynamics of a damped oscillator with parametric noise under sto…
2022
[EN] This paper is devoted to study random linear control systems where the initial condition, the final target, and the elements of matrices defining the coefficients are random variables, while the control is a stochastic process. The so-called Random Variable Transformation technique is adapted to obtain closed-form expressions of the probability density functions of the solution and of the control. The theoretical findings are applied to study the dynamics of a damped oscillator subject to parametric noise.
WENO schemes applied to the quasi-relativistic Vlasov-Maxwell model for laser-plasma interaction
2014
Abstract In this paper we focus on WENO-based methods for the simulation of the 1D Quasi-Relativistic Vlasov–Maxwell (QRVM) model used to describe how a laser wave interacts with and heats a plasma by penetrating into it. We propose several non-oscillatory methods based on either Runge–Kutta (explicit) or Time-Splitting (implicit) time discretizations. We then show preliminary numerical experiments.
Maximal Operators with Respect to the Numerical Range
2018
Let $\mathfrak{n}$ be a nonempty, proper, convex subset of $\mathbb{C}$. The $\mathfrak{n}$-maximal operators are defined as the operators having numerical ranges in $\mathfrak{n}$ and are maximal with this property. Typical examples of these are the maximal symmetric (or accretive or dissipative) operators, the associated to some sesquilinear forms (for instance, to closed sectorial forms), and the generators of some strongly continuous semi-groups of bounded operators. In this paper the $\mathfrak{n}$-maximal operators are studied and some characterizations of these in terms of the resolvent set are given.
Implementation aspects of interactive multiobjective optimization for modeling environments: The case of GAMS-NIMBUS
2014
Abstract. Interactive multiobjective optimization methods have provided promising results in the literature but still their implementations are rare. Here we introduce a core structure of interactive methods to enable their convenient implementation. We also demonstrate how this core structure can be applied when implementing an interactive method using a modeling environment. Many modeling environments contain tools for single objective optimization but not for interactive multiobjective optimization. Furthermore, as a concrete example, we present GAMS-NIMBUS Tool which is an implementation of the classification-based NIMBUS method for the GAMS modeling environment. So far, interactive met…
Two non-zero solutions for Sturm–Liouville equations with mixed boundary conditions
2019
Abstract In this paper, we establish the existence of two non-zero solutions for a mixed boundary value problem with the Sturm–Liouville equation. The approach is based on a recent two critical point theorem.
Annihilation Operators for Exponential Spaces in Subdivision
2022
We investigate properties of differential and difference operators annihilating certain finite-dimensional subspaces of exponential functions in two variables that are connected to the representation of real-valued trigonometric and hyperbolic functions. Although exponential functions appear in a variety of contexts, the motivation behind this work comes from considering subdivision schemes with the capability of preserving those exponential functions required for an exact description of surfaces parametrized in terms of trigonometric and hyperbolic functions.
Computation of the topological type of a real Riemann surface
2014
We present an algorithm for the computation of the topological type of a real compact Riemann surface associated to an algebraic curve, i.e., its genus and the properties of the set of fixed points of the anti-holomorphic involution τ \tau , namely, the number of its connected components, and whether this set divides the surface into one or two connected components. This is achieved by transforming an arbitrary canonical homology basis to a homology basis where the A \mathcal {A} -cycles are invariant under the anti-holomorphic involution τ \tau .
Reaction coordinates and transition states in enzymatic catalysis
2017
Enzymatic reactions are complex chemical processes taking place in complex dynamic environments. Theoretical characterization of these reactions requires the determination of the reaction coordinate and the transition state ensemble. This is not an easy task because many degrees of freedom may be involved in principle. We present recent efforts to find good enzymatic reaction coordinates and the implications of these findings in the interpretation of enzymatic efficiency. In particular, we analyze different strategies based on the use of minimum free energy paths and direct localization of the dividing surface on multidimensional free energy surfaces. Another strategy is based on the genera…
GEPOL: An improved description of molecular surfaces. III. A new algorithm for the computation of a solvent-excluding surface
1994
To understand and calculate the interactions of a solute with a solvent, a good method of computing the molecular surface is needed. Three kinds of surfaces may be used: the van der Waals Surface, the Accessible Surface, and the Molecular Surface. The latter is redefined in this article as the Solvent-Excluding Surface. The new algorithm for computing the Solvent-Excluding Surface included in the GEPOL93 program is described. GEPOL93 follows the same concept as former versions of GEPOL but with a full new algorithm. Thus, it computes the Solvent-Excluding Surface by filling the spaces not accessible to the solvent with a set of new spheres. The computation is controlled by three parameters:…