SearcharxivSearch

arXiv · 2606.16345

Output-Feedback Boundary Control of Reaction--Diffusion PDEs on Arbitrary Lipschitz Domains: A Target-Domain Approach

Abstract

We present a domain-extension framework for output-feedback boundary stabilization of reaction-diffusion equations on arbitrary bounded Lipschitz domains, including non-convex and multiply connected geometries. The plant is posed on an irregular domain whose boundary has actuated and uncontrolled portions. Just as backstepping transforms the plant dynamics into a stable target system, the method embeds the plant in a target domain, such as a ball or a rectangle, where a stabilizing design is already known. Every boundary portion through which the extension proceeds must carry actuation and the complementary collocated measurement. Uncontrolled portions are allowed when they are shared with the target boundary and have the same boundary-condition type. The gap between the two domains is filled with a virtual copy of the plant dynamics, coupled to the plant through interface conditions, and the concatenated state evolves exactly as the known closed loop on the target domain. Well-posedness and exponential stability of the physical state follow by restriction. The offline design data are inherited from the target design and are closed-form for constant-coefficient plants on balls and rectangles. Online simulation of the virtual PDE has the same computational character as a full-order PDE observer, a standard component of output-feedback designs. A new explicit Neumann-actuated backstepping law on n-balls enlarges the available target designs. Output feedback is obtained by lifting the target-domain observer, driven by a collocated interface measurement relayed through the virtual domain. Numerical experiments on star-shaped, horseshoe, and multiply connected domains, with a partitioned plant/controller implementation and a shared-wall cavity, test the designs.

Explore related subjects

Keep this discovery

BibTeXRIS

Rafael Vazquez. 2026-06-15. Output-Feedback Boundary Control of Reaction--Diffusion PDEs on Arbitrary Lipschitz Domains: A Target-Domain Approach. https://arxiv.org/abs/2606.16345

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