We consider an optimal control problem governed by parameterized stationary Maxwell's system with the Gauss's law. The parameters enter through dielectric, magnetic permeability, and charge density. Moreover, the parameter set is assumed to be compact. We discretize the electric field by a finite element method and use variational discretization concept for the control. We present a reduced basis method for the optimal control problem and establish the uniform convergence of the reduced order solutions to that of the original fulldimensional problem provided that the snapshot parameter sample is dense in the parameter set, with an appropriate parameter separability rule. Finally, we establish the absolute a posteriori error estimator for the reduced order solutions and the corresponding cost functions in terms of the state and adjoint residuals.
 Publication Date:
 NSFPAR ID:
 10345645
 Journal Name:
 Mathematical Control & Related Fields
 Volume:
 0
 Issue:
 0
 Page Range or eLocationID:
 0
 ISSN:
 21568472
 Sponsoring Org:
 National Science Foundation
More Like this

Goaoc, Xavier ; Kerber, Michael (Ed.)We consider the following surveillance problem: Given a set P of n sites in a metric space and a set R of k robots with the same maximum speed, compute a patrol schedule of minimum latency for the robots. Here a patrol schedule specifies for each robot an infinite sequence of sites to visit (in the given order) and the latency L of a schedule is the maximum latency of any site, where the latency of a site s is the supremum of the lengths of the time intervals between consecutive visits to s. When k = 1 the problem is equivalent to the travelling salesman problem (TSP) and thus it is NPhard. For k ≥ 2 (which is the version we are interested in) the problem becomes even more challenging; for example, it is not even clear if the decision version of the problem is decidable, in particular in the Euclidean case. We have two main results. We consider cyclic solutions in which the set of sites must be partitioned into 𝓁 groups, for some 𝓁 ≤ k, and each group is assigned a subset of the robots that move along the travelling salesman tour of the group atmore »

In its most traditional setting, the main concern of optimization theory is the search for optimal solutions for instances of a given computational problem. A recent trend of research in artificial intelligence, called solution diversity, has focused on the development of notions of optimality that may be more appropriate in settings where subjectivity is essential. The idea is that instead of aiming at the development of algorithms that output a single optimal solution, the goal is to investigate algorithms that output a small set of sufficiently good solutions that are sufficiently diverse from one another. In this way, the user has the opportunity to choose the solution that is most appropriate to the context at hand. It also displays the richness of the solution space.When combined with techniques from parameterized complexity theory, the paradigm of diversity of solutions offers a powerful algorithmic framework to address problems of practical relevance. In this work, we investigate the impact of this combination in the field of Kemeny Rank Aggregation, a wellstudied class of problems lying in the intersection of order theory and social choice theory and also in the field of order theory itself. In particular, we show that KRA is fixedparameter tractablemore »

For a given PDE problem, three main factors affect the accuracy of FEM solutions: basis order, mesh resolution, and mesh element quality. The first two factors are easy to control, while controlling element shape quality is a challenge, with fundamental limitations on what can be achieved. We propose to use prefinement (increasing element degree) to decouple the approximation error of the finite element method from the domain mesh quality for elliptic PDEs. Our technique produces an accurate solution even on meshes with badly shaped elements, with a slightly higher running time due to the higher cost of highorder elements. We demonstrate that it is able to automatically adapt the basis to badly shaped elements, ensuring an error consistent with highquality meshing, without any permesh parameter tuning. Our construction reduces to traditional fixeddegree FEM methods on highquality meshes with identical performance. Our construction decreases the burden on meshing algorithms, reducing the need for often expensive mesh optimization and automatically compensates for badly shaped elements, which are present due to boundary con straints or limitations of current meshing methods. By tackling mesh gen eration and finite element simulation jointly, we obtain a pipeline that is both more efficient and more robust thanmore »

Abstract We consider a singular perturbation for a family of analytic symplectic maps of the annulus possessing a KAM torus. The perturbation introduces dissipation and contains an adjustable parameter. By choosing the adjustable parameter, one can ensure that the torus persists under perturbation. Such models are common in celestial mechanics. In field theory, the adjustable parameter is called the counterterm and in celestial mechanics, the drift . It is known that there are formal expansions in powers of the perturbation both for the quasiperiodic solution and the counterterm. We prove that the asymptotic expansions for the quasiperiodic solutions and the counterterm satisfy Gevrey estimates. That is, the n th term of the expansion is bounded by a power of n !. The Gevrey class (the power of n !) depends only on the Diophantine condition of the frequency and the order of the friction coefficient in powers of the perturbative parameter. The method of proof we introduce may be of interest beyond the problem considered here. We consider a modified Newton method in a space of power expansions. As is custumary in KAM theory, each step of the method is estimated in a smaller domain. In contrast with the KAMmore »

In this paper, we consider a multiobjective control problem for stochastic systems that seeks to minimize a cost of interest while ensuring safety. We introduce a novel measure of safety risk using the conditional valueatrisk and a set distance to formulate a safety riskconstrained optimal control problem. Our reformulation method using an extremal representation of the safety risk measure provides a computationally tractable dynamic programming solution. A useful byproduct of the proposed solution is the notion of a riskconstrained safe set, which is a new stochastic safety verification tool. We also establish useful connections between the riskconstrained safe sets and the popular probabilistic safe sets. The tradeoff between the risk tolerance and the mean performance of our controller is examined through an inventory control problem.