SearcharxivSearch

arXiv · 1401.7066

A hierarchic multi-level energy method for the control of bi-diagonal and mixed n-coupled cascade systems of PDE's by a reduced number of controls

Abstract

This work is concerned with the exact controllability/observability of abstract cascade hyperbolic systems by a reduced number of controls/observations. We prove that the observation of the last component of the vector state allows to recover the initial energies of all of its components in suitable functional spaces under a necessary and sufficient condition on the coupling operators for cascade bi-diagonal systems. The approach is based on a multi-level energy method which involves $n$-levels of weakened energies. We establish this result for the case of bounded as well as unbounded dual control operators and under the hypotheses of partial coercivity of the $n-1$ coupling operators on the sub-diagonal of the system. We further extend our observability result to mixed bi-diagonal and non bi-diagonal $n+p$-coupled cascade systems by $p+1$ observations. Applying the HUM method, we derive the corresponding exact controllability results for $n$-coupled bi-diagonal cascade and $n+p$-coupled mixed cascade systems. Using the transmutation method for the wave operator, we prove that the corresponding heat (resp. Schrödinger) multi-dimensional cascade systems are null-controllable for control regions and coupling regions which are disjoint from each other and for any positive time for $n \le 5$ for dimensions larger than $2$, and for any $n \ge 2$ in the one-dimensional case. The controls can be localized on a subdomain or on the boundary and in the one-dimensional case the coupling coefficients can be supported in any non-empty subset of the domain.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fatiha Alabau-Boussouira. 2014-01-28. A hierarchic multi-level energy method for the control of bi-diagonal and mixed n-coupled cascade systems of PDE's by a reduced number of controls. https://arxiv.org/abs/1401.7066

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC