Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Stefan Volkwein is active.

Publication


Featured researches published by Stefan Volkwein.


SIAM Journal on Numerical Analysis | 2002

Galerkin Proper Orthogonal Decomposition Methods for a General Equation in Fluid Dynamics

Karl Kunisch; Stefan Volkwein

Error estimates for Galerkin proper orthogonal decomposition (POD) methods for nonlinear parabolic systems arising in fluid dynamics are proved. For the time integration the backward Euler scheme is considered. The asymptotic estimates involve the singular values of the POD snapshot set and the grid-structure of the time discretization as well as the snapshot locations.


Numerische Mathematik | 2001

Galerkin proper orthogonal decomposition methods for parabolic problems

Karl Kunisch; Stefan Volkwein

Summary. In this work error estimates for Galerkin proper orthogonal decomposition (POD) methods for linear and certain non-linear parabolic systems are proved. The resulting error bounds depend on the number of POD basis functions and on the time discretization. Numerical examples are included.


Journal of Optimization Theory and Applications | 1999

Control of the Burgers equation by a reduced-order approach using proper orthogonal decomposition

Karl Kunisch; Stefan Volkwein

Proper orthogonal decomposition (POD) is a method to derive reduced-order models for dynamical systems. In this paper, POD is utilized to solve open-loop and closed-loop optimal control problems for the Burgers equation. The relative simplicity of the equation allows comparison of POD-based algorithms with numerical results obtained from finite-element discretization of the optimality system. For closed-loop control, suboptimal state feedback strategies are presented.


Archive | 2005

Proper Orthogonal Decomposition Surrogate Models for Nonlinear Dynamical Systems: Error Estimates and Suboptimal Control

Michael Hinze; Stefan Volkwein

Nonlinear Dynamical System Let V and H be real separable Hilbert spaces and suppose that V is dense in H with compact embedding. By 〈· , ·〉H we denote the inner product in H. The inner product in V is given by a symmetric bounded, coercive, bilinear form a : V × V → IR: 〈φ,ψ〉V = a(φ,ψ) for all φ,ψ ∈ V (10.16) with associated norm given by ‖ · ‖V = √ a(· , ·). Since V is continuously injected into H, there exists a constant cV > 0 such that ‖φ‖H ≤ cV ‖φ‖V for all φ ∈ V. (10.17) We associate with a the linear operator A: 〈Aφ,ψ〉V ′,V = a(φ,ψ) for all φ,ψ ∈ V, where 〈· , ·〉V ′,V denotes the duality pairing between V and its dual. Then, by the Lax-Milgram lemma, A is an isomorphism from V onto V ′. Alternatively, A can be considered as a linear unbounded self-adjoint operator in H with domain D(A) = {φ ∈ V : Aφ ∈ H}. By identifying H and its dual H ′ it follows that 10 POD: Error Estimates and Suboptimal Control 269 D(A) ↪→ V ↪→ H = H ′ ↪→ V ′, each embedding being continuous and dense, when D(A) is endowed with the graph norm of A. Moreover, let F : V × V → V ′ be a bilinear continuous operator mapping D(A) × D(A) into H. To simplify the notation we set F (φ) = F (φ,φ) for φ ∈ V . For given f ∈ C([0, T ];H) and y0 ∈ V we consider the nonlinear evolution problem d dt 〈y(t), φ〉H + a(y(t), φ) + 〈F (y(t)), φ〉V ′,V = 〈f(t), φ〉H (10.18a) for all φ ∈ V and t ∈ (0, T ] a.e. and y(0) = y0 in H. (10.18b) Assumption (A1). For every f ∈ C([0, T ];H) and y0 ∈ V there exists a unique solution of (10.18) satisfying y ∈ C([0, T ];V ) ∩ L(0, T ;D(A)) ∩H(0, T ;H). (10.19) Computation of the POD Basis Throughout we assume that Assumption (A1) holds and we denote by y the unique solution to (10.18) satisfying (10.19). For given n ∈ IN let 0 = t0 < t1 < . . . < tn ≤ T (10.20) denote a grid in the interval [0, T ] and set δtj = tj − tj−1, j = 1, . . . , n. Define ∆t = max (δt1, . . . , δtn) and δt = min (δt1, . . . , δtn). (10.21) Suppose that the snapshots y(tj) of (10.18) at the given time instances tj , j = 0, . . . , n, are known. We set V = span {y0, . . . , y2n}, where yj = y(tj) for j = 0, . . . , n, yj = ∂ty(tj−n) for j = n + 1, . . . , 2n with ∂ty(tj) = (y(tj)−y(tj−1))/δtj , and refer to V as the ensemble consisting of the snapshots {yj} j=0, at least one of which is assumed to be nonzero. Furthermore, we call {tj}j=0 the snapshot grid. Notice that V ⊂ V by construction. Throughout the remainder of this section we let X denote either the space V or H. 270 Michael Hinze and Stefan Volkwein Remark 10.2.1 (compare [KV01, Remark 1]). It may come as a surprise at first that the finite difference quotients ∂ty(tj) are included into the set V of snapshots. To motivate this choice let us point out that while the finite difference quotients are contained in the span of {yj} j=0, the POD bases differ depending on whether {∂ty(tj)}j=1 are included or not. The linear dependence does not constitute a difficulty for the singular value decomposition which is required to compute the POD basis. In fact, the snapshots themselves can be linearly dependent. The resulting POD basis is, in any case, maximally linearly independent in the sense expressed in (P ) and Proposition 10.2.5. Secondly, in anticipation of the rate of convergence results that will be presented in Section 10.3.3 we note that the time derivative of y in (10.18) must be approximated by the Galerkin POD based scheme. In case the terms {∂ty(tj)}j=1 are included in the snapshot ensemble, we are able to utilize the estimate


Computational Optimization and Applications | 2009

POD a-posteriori error estimates for linear-quadratic optimal control problems

Fredi Tröltzsch; Stefan Volkwein

The main focus of this paper is on an a-posteriori analysis for the method of proper orthogonal decomposition (POD) applied to optimal control problems governed by parabolic and elliptic PDEs. Based on a perturbation method it is deduced how far the suboptimal control, computed on the basis of the POD model, is from the (unknown) exact one. Numerical examples illustrate the realization of the proposed approach for linear-quadratic problems governed by parabolic and elliptic partial differential equations.


Siam Journal on Applied Dynamical Systems | 2004

HJB-POD-Based Feedback Design for the Optimal Control of Evolution Problems

Karl Kunisch; Stefan Volkwein; Lei Xie

The numerical realization of closed loop control for distributed parameter systems is still a significant challenge and in fact infeasible unless specific structural techniques are employed. In this paper we propose the combination of model reduction techniques based on proper orthogonal decomposition (POD) with the numerical treatment of the Hamilton--Jacobi--Bellman (HJB) equation for infinite horizon optimal control problems by a modification of an algorithm originated by Gonzales and Rofman and further developed by Falcone and Ferretti. The feasibility of the proposed methodology is demonstrated numerically by means of optimal boundary feedback control for the Burgers equation with noise in the initial condition and in the forcing function.


Computational Optimization and Applications | 2008

Error estimates for abstract linear-quadratic optimal control problems using proper orthogonal decomposition

Michael Hinze; Stefan Volkwein

Abstract In this paper we investigate POD discretizations of abstract linear–quadratic optimal control problems with control constraints. We apply the discrete technique developed by Hinze (Comput. Optim. Appl. 30:45–61, 2005) and prove error estimates for the corresponding discrete controls, where we combine error estimates for the state and the adjoint system from Kunisch and Volkwein (Numer. Math. 90:117–148, 2001; SIAM J. Numer. Anal. 40:492–515, 2002). Finally, we present numerical examples that illustrate the theoretical results.


Computational Optimization and Applications | 2001

Distributed Control Problems for the Burgers Equation

Stefan Volkwein

In this work a distributed optimal control problem for time-dependent Burgers equation is analyzed. To solve the nonlinear control problems the augmented Lagrangian-SQP technique is used depending upon a second-order sufficient optimality condition. Numerical test examples are presented.


Zamm-zeitschrift Fur Angewandte Mathematik Und Mechanik | 2001

Optimal Control of a Phase‐Field Model Using Proper Orthogonal Decomposition

Stefan Volkwein

The proper orthogonal decomposition (POD) is a procedure to determine a reduced basis for a reduced order model. In this article POD is formulated as a minimization problem in a general Hilbert space setting. The POD-basis functions are given by the solution to the first-order necessary optimality conditions. In this work POD is utilized to solve optimal control problems for a phase-field model. The numerical results are compared with finite element solutions.


Mathematical and Computer Modelling | 2003

Control of laser surface hardening by a reduced-order approach using proper orthogonal decomposition

D. Hömberg; Stefan Volkwein

Laser surface hardening of steel is formulated in terms of an optimal control problem, where the state equations are a semilinear heat equation and an ordinary differential equation, which describe the evolution of the high temperature phase. The optimal control problem is analyzed and first-order necessary optimality conditions are derived. An error estimate for POD (proper orthogonal decomposition) Galerkin methods for the state system is proved. Finally, a strategy to obtain suboptimal controls using POD is applied to solve some numerical examples.

Collaboration


Dive into the Stefan Volkwein's collaboration.

Top Co-Authors

Avatar

Laura Iapichino

Eindhoven University of Technology

View shared research outputs
Top Co-Authors

Avatar

Karl Kunisch

Austrian Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Oliver Lass

Technische Universität Darmstadt

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Fredi Tröltzsch

Technical University of Berlin

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge