Search arXivSearch

arXiv · 0902.1207

Feedback control of unstable steady states of flow past a flat plate using reduced-order estimators

Abstract

We present an estimator-based control design procedure for flow control, using reduced-order models of the governing equations, linearized about a possibly unstable steady state. The reduced models are obtained using an approximate balanced truncation method that retains the most controllable and observable modes of the system. The original method is valid only for stable linear systems, and we present an extension to unstable linear systems. The dynamics on the unstable subspace are represented by projecting the original equations onto the global unstable eigenmodes, assumed to be small in number. A snapshot-based algorithm is developed, using approximate balanced truncation, for obtaining a reduced-order model of the dynamics on the stable subspace. The proposed algorithm is used to study feedback control of 2-D flow over a flat plate at a low Reynolds number and at large angles of attack, where the natural flow is vortex shedding, though there also exists an unstable steady state. For control design, we derive reduced-order models valid in the neighborhood of this unstable steady state. The actuation is modeled as a localized body force near the leading edge of the flat plate, and the sensors are two velocity measurements in the near-wake of the plate. A reduced-order Kalman filter is developed based on these models and is shown to accurately reconstruct the flow field from the sensor measurements, and the resulting estimator-based control is shown to stabilize the unstable steady state. For small perturbations of the steady state, the model accurately predicts the response of the full simulation. Furthermore, the resulting controller is even able to suppress the stable periodic vortex shedding, where the nonlinear effects are strong, thus implying a large domain of attraction of the stabilized steady state.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sunil Ahuja, Clarence W. Rowley. 2009-02-07. Feedback control of unstable steady states of flow past a flat plate using reduced-order estimators. https://doi.org/10.1017/s0022112009992655

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

KEEP EXPLORING

Related papers

AdGT: Decentralized Gradient Tracking with Adaptive Per-Agent Stepsizes

In decentralized optimization, gradient-tracking methods typically rely on a single global stepsize. This choice can be conservative when agents have local objectives with different smoothness constants, since the stepsize must remain stable for the agent with the largest smoothness constant. This paper proposes AdGT, a decentralized gradient-tracking method in which each agent adapts its own stepsize using local gradient variation and a single global safety factor. The method reduces fixed-stepsize tuning effort and allows agents to exploit local smoothness information during the iterations. For smooth and strongly convex local objectives over undirected networks, we prove that the analyzed AdGT update converges linearly to the exact consensus optimizer. We also study two adaptive stepsize updates that use changes in the gradient-tracking direction. We characterize when the corresponding candidate determines the stepsize and prove conditional lower and upper stepsize bounds and linear convergence under an additional relative tracking-disagreement condition. Experiments on logistic regression, ridge regression, synthetic quadratic problems, and a linear-regression benchmark against state-of-the-art decentralized solvers show that AdGT often reaches a given accuracy in fewer iterations or gradient evaluations than tuned fixed-stepsize GT and the tested baselines, especially under heterogeneous local smoothness. In the topology experiments, each tested AdGT update uses one common safety factor across all graphs, whereas the fixed GT stepsize is tuned separately for each graph and seed.

math.OC

Brockett cost function for symplectic eigenvalues

The sum of symplectic eigenvalues and corresponding eigenvectors of symmetric positive-definite matrices in the sense of Williamson's theorem can be computed via minimization of a trace cost function under the symplecticity constraint. Optimal solutions to this problem only offer a symplectic basis for the symplectic eigenspace corresponding to the sought symplectic eigenvalues. In this note, we introduce a Brockett cost function and investigate its properties and the connection with the symplectic eigenvalues and eigenvectors of the considered matrix. Specifically, we prove that any stationary point consists of symplectic eigenvectors, characterize the saddle points and global minimizers based on which the trace minimization theorem for the symplectic eigenvalues is re-established, and the nonexistence of local nonglobal minimizers is justified.

math.OC

Riemannian Bilevel Optimization with Gradient Aggregation

We study bilevel optimization on Riemannian manifolds when the lower-level solution set is a positive-dimensional submanifold, so that implicit differentiation fails. We propose Riemannian Bilevel Descent Aggregation (RBDA), which extends bilevel descent aggregation to manifolds. Its inner loop aggregates the lower-level descent direction with the upper-level gradient under a decaying multiplier, and its hypergradient is the reverse-mode derivative of the unrolled loop. Under geodesic convexity and quadratic growth of the lower level, the inner iterates converge to a point of the optimistic solution set at a polynomial rate. Approximate minimizers of the objective with a finite number of inner iterations converge to minimizers of the optimistic value. In the experiments RBDA selects the optimistic solution where the implicit and unrolled estimators remain at the initial point or stop at a larger query loss. While each of its outer steps costs more than that of the unrolled estimator, it attains the highest test accuracy in data hyper-cleaning.

math.OC