Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Leugering, G." wg kryterium: Autor


Wyświetlanie 1-5 z 5
Tytuł:
On boundary observability estimates for semi-discretizations of a dynamic network of elastic strings
Autorzy:
Brauer, U.
Leugering, G.
Powiązania:
https://bibliotekanauki.pl/articles/206527.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
filtering
lack of uniform observability
network of strings
semidiscretization
Opis:
We consider a tripod as an exemplaric network of strings. We know that such a network is exactly controllable in the natural finite energy space, if, e.g., the simple nodes are controlled by Dirichlet controls in H^l (0, T ). Assume that we want to calculate the corresponding norm-minimal controls using semi-discretization in space. We then obtain a system of coupled second-order-in-time ordinary differential equations with three control inputs. Controllability of the latter system can easily been checked by Kalman's rank condition on each space discretization level h. One expects, as h tends to zero, that the exact controllability of the continuous system is revealed. This expectation is frustrated, as has been shown by Infante and Zuazua (1998) for a single string and by Zuazua (1999) for a membrane. Indeed, it was shown there that uniformity of observability estimates is lost in the limit. On the other hand, spectral filtering allows to cure this pathology. We show in this paper that similar results hold for our string network. The generalization to arbitrary networks of strings in the out-of-the-plane as well as in the in-plane or 3-d-setup is then a technical matter. Therefore, this paper essentially extends the existing results to semidiscretizations of wave equations on arbitrary irregular computational grids.
Źródło:
Control and Cybernetics; 1999, 28, 3; 421-447
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Topological sensitivity analysis for elliptic problems on graphs
Autorzy:
Leugering, G.
Sokolowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/970307.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
differential equations on metric graphs
obstacles
topology optimization
asymptotic analysis
Opis:
We consider elliptic problems on graphs under given loads and bilateral contact conditions. We ask the question: which graph is best suited to sustain the loads and the constraints. More precisely, given a cost function we may look at a multiple node of the graph with edge degree q and ask as to whether that node should be resolved into a number of nodes of edge degree less than q, in order to decrease the cost. With this question in mind, we are looking into the sensitivity analysis of a graph carrying a second order elliptic equation with respect to changing its topology by releasing nodes with high edge degree or including an edge. With the machinery at hand developed here, we are in the position to define the topological gradient of an elliptic problem on a graph.
Źródło:
Control and Cybernetics; 2008, 37, 4; 971-997
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Adaptive finite elements based on sensitivities fortopological mesh changes
Autorzy:
Friederich, J.
Leugering, G.
Steinmann, P.
Powiązania:
https://bibliotekanauki.pl/articles/205694.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
adaptive mesh refinement
sensitivity-based refinement
topological sensitivity
asymptotic expansion
Opis:
We propose a novel approach to adaptive refinement in FEM based on local sensitivities for node insertion. To this end, we consider refinement as a continuous graph operation, for instance by splitting nodes along edges. Thereby, we introduce the concept of the topological mesh derivative for a given objective function. For its calculation, we rely on the first-order asymptotic expansion of the Galerkin solution of a symmetric linear second-order elliptic PDE. In this work, we apply this concept to the total potential energy, which is related to the approximation error in the energy norm. In fact, our approach yields local sensitivities for minimization of the energy error by refinement. Moreover, we prove that our indicator is equivalent to the classical explicit a posteriori error estimator in a certain sense. Numerical results suggest that our method leads to efficient and competitive adaptive refinement.
Źródło:
Control and Cybernetics; 2014, 43, 2; 279-306
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the relaxation of state-constrained linear control problems via Henig dilating cones
Autorzy:
Kogut, P. I.
Leugering, G.
Schiel, R.
Powiązania:
https://bibliotekanauki.pl/articles/206472.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
optimal control
state constrains
relaxation
Henig dilating cone
optimality conditions
Opis:
We discuss a regularization of state-constrained optimal control problems via a Henig relaxation of ordering cones. Considering a state-constrained optimal control problem, the pointwise state constraint is replaced by an inequality condition involving a so-called Henig dilating cone. It is shown that this class of cones provides a reasonable solid approximation of the typically nonsolid ordering cones which correspond to pointwise state constraints. Thereby, constraint qualifications, which are based on the existence of interior points, can be applied to given problems. Moreover, we characterize admissibility and solvability of the original problem by analyzing the associated relaxed problem. We also show that the optimality system for the original problem can be obtained through the limit passage in the corresponding optimality system for the relaxed problem. As an example of our approach, we derive the optimality conditions for a state constrained Neumann boundary optimal control problem and show that in this case the corresponding Lagrange multipliers are more regular than Borel measures.
Źródło:
Control and Cybernetics; 2016, 45, 2; 131-162
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nonoverlapping domain decomposition for optimal control problems governed by semilinear models for gas flow in networks
Autorzy:
Leugering, G.
Martin, A.
Schmidt, M.
Sirvent, M.
Powiązania:
https://bibliotekanauki.pl/articles/205527.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
optimal control
gas networks
Euler equation
semilinear PDE
nonoverlapping domain decomposition
Opis:
We consider optimal control problems for gas flow in pipeline networks. The equations of motion are taken to be represented by a first-order system of hyperbolic semilinear equations derived from the fully nonlinear isothermal Euler gas equations. We formulate an optimal control problem on a network and introduce a tailored time discretization thereof. In order to further reduce the complexity, we consider an instantaneous control strategy. The main part of the paper is concerned with a nonoverlapping domain decomposition of the optimal control problem on the graph into local problems on smaller sub-graphs—ultimately on single edges. We prove convergence of the domain decomposition method on networks and study the wellposedness of the corresponding time-discrete optimal control problems. The point of the paper is that we establish virtual control problems on the decomposed subgraphs such that the corresponding optimality systems are in fact equal to the systems obtained via the domain decomposition of the entire optimality system.
Źródło:
Control and Cybernetics; 2017, 46, 3; 191-225
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies