Search results for "Computation"
showing 10 items of 7362 documents
Regular and singular pulse and front solutions and possible isochronous behavior in the Extended-Reduced Ostrovsky Equation: Phase-plane, multi-infin…
2016
In this paper we employ three recent analytical approaches to investigate several classes of traveling wave solutions of the so-called extended-reduced Ostrovsky Equation (exROE). A recent extension of phase-plane analysis is first employed to show the existence of breaking kink wave solutions and smooth periodic wave (compacton) solutions. Next, smooth traveling waves are derived using a recent technique to derive convergent multi-infinite series solutions for the homoclinic orbits of the traveling-wave equations for the exROE equation. These correspond to pulse solutions respectively of the original PDEs. We perform many numerical tests in different parameter regime to pinpoint real saddl…
Optimal Starting Conditions for the Rendezvous Maneuver, Part 1: Optimal Control Approach
2008
We consider the three-dimensional rendezvous between two spacecraft: a target spacecraft on a circular orbit around the Earth and a chaser spacecraft initially on some elliptical orbit yet to be determined. The chaser spacecraft has variable mass, limited thrust, and its trajectory is governed by three controls, one determining the thrust magnitude and two determining the thrust direction. We seek the time history of the controls in such a way that the propellant mass required to execute the rendezvous maneuver is minimized. Two cases are considered: (i) time-to-rendezvous free and (ii) time-to-rendezvous given, respectively equivalent to (i) free angular travel and (ii) fixed angular trave…
Conical Two-Phase Swirl Flow Atomizers—Numerical and Experimental Study
2021
This paper presents the results of numerical simulations for the developed and discussed conical two-phase atomizers with swirl flow, differing in the ratio of the height of the swirl chamber to its diameter. Experiments were carried out for SAN-1 with HS/DS = 1 and SAN-2 with HS/DS = 4 atomizers. The study was conducted over a range of Reynolds number for liquid ReL = (1400
Resonance of minimizers forn-level quantum systems with an arbitrary cost
2004
We consider an optimal control problem describing a laser-induced population transfer on a n-level quantum system. For a convex cost depending only on the moduli of controls ( i.e. the lasers intensities), we prove that there always exists a minimizer in resonance. This permits to justify some strategies used in experimental physics. It is also quite important because it permits to reduce remarkably the complexity of the problem (and extend some of our previous results for n=2 and n=3): instead of looking for minimizers on the sphere one is reduced to look just for minimizers on the sphere . Moreover, for the reduced problem, we investigate on the question of existence of strict abnormal mi…
Symmetry breaking in a constrained cheeger type isoperimetric inequality
2015
We study the optimal constant in a Sobolev inequality for BV functions with zero mean value and vanishing outside a bounded open set. We are interested in finding the best possible embedding constant in terms of the measure of the domain alone. We set up an optimal shape problem and we completely characterize the behavior of optimal domains.
Computing Euclidean Steiner trees over segments
2020
In the classical Euclidean Steiner minimum tree (SMT) problem, we are given a set of points in the Euclidean plane and we are supposed to find the minimum length tree that connects all these points, allowing the addition of arbitrary additional points. We investigate the variant of the problem where the input is a set of line segments. We allow these segments to have length 0, i.e., they are points and hence we generalize the classical problem. Furthermore, they are allowed to intersect such that we can model polygonal input. As in the GeoSteiner approach of Juhl et al. (Math Program Comput 10(2):487–532, 2018) for the classical case, we use a two-phase approach where we construct a superse…
Guidance Trajectories for Spacecraft Rendezvous
2007
In a previous paper of Miele et al. (J. Optim. Theory Appl. 132(1), 2007), we employed the single-subarc sequential gradient-restoration algorithm to optimize the three-dimensional rendezvous between a target spacecraft in a planar circular orbit and a chaser spacecraft with an initial separation distance and separation velocity. The achieved continuous solutions are characterized by two, three, or four subarcs depending on the performance index (time, fuel) and the constraints. In this paper, based on the solutions in Miele et al. (J. Optim. Theory Appl. 132(1), 2007), we employ the multiple-subarc sequential gradient-restoration algorithm to produce pieced guidance trajectories implementa…
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
1997
We introduce a new multidimensional pattern matching problem that is a natural generalization of string matching, a well studied problem1. The motivation for its algorithmic study is mainly theoretical. LetA1:n1,?,1:nd be a text matrix withN=n1?ndentries andB1:m1,?,1:mr be a pattern matrix withM=m1?mrentries, whered?r?1 (the matrix entries are taken from an ordered alphabet ?). We study the problem of checking whether somer-dimensional submatrix ofAis equal toB(i.e., adecisionquery).Acan be preprocessed andBis given on-line. We define a new data structure for preprocessingAand propose CRCW-PRAM algorithms that build it inO(logN) time withN2/nmaxprocessors, wherenmax=max(n1,?,nd), such that …
A quantitative reverse Faber-Krahn inequality for the first Robin eigenvalue with negative boundary parameter
2021
The aim of this paper is to prove a quantitative form of a reverse Faber-Krahn type inequality for the first Robin Laplacian eigenvalueλβwith negative boundary parameter among convex sets of prescribed perimeter. In that framework, the ball is the only maximizer forλβand the distance from the optimal set is considered in terms of Hausdorff distance. The key point of our stategy is to prove a quantitative reverse Faber-Krahn inequality for the first eigenvalue of a Steklov-type problem related to the original Robin problem.
Optimistic NAUTILUS navigator for multiobjective optimization with costly function evaluations
2022
AbstractWe introduce novel concepts to solve multiobjective optimization problems involving (computationally) expensive function evaluations and propose a new interactive method called O-NAUTILUS. It combines ideas of trade-off free search and navigation (where a decision maker sees changes in objective function values in real time) and extends the NAUTILUS Navigator method to surrogate-assisted optimization. Importantly, it utilizes uncertainty quantification from surrogate models like Kriging or properties like Lipschitz continuity to approximate a so-called optimistic Pareto optimal set. This enables the decision maker to search in unexplored parts of the Pareto optimal set and requires …