Set-theoretical properties of extreme combinatorial problems.
Several dissipativity and passivity implications in the linear discrete-time setting.
Shape and topology optimization of the robust compliance via the level set method
The goal of this paper is to study the so-called worst-case or robust optimal design problem for minimal compliance. In the context of linear elasticity we seek an optimal shape which minimizes the largest, or worst, compliance when the loads are subject to some unknown perturbations. We first prove that, for a fixed shape, there exists indeed a worst perturbation (possibly non unique) that we characterize as the maximizer of a nonlinear energy. We also propose a stable algorithm to compute it....
Shape and topology optimization of the robust compliance via the level set method
The goal of this paper is to study the so-called worst-case or robust optimal design problem for minimal compliance. In the context of linear elasticity we seek an optimal shape which minimizes the largest, or worst, compliance when the loads are subject to some unknown perturbations. We first prove that, for a fixed shape, there exists indeed a worst perturbation (possibly non unique) that we characterize as the maximizer of a nonlinear energy. We also propose a stable algorithm to compute...
Shape optimization of control problems described by wave equations
Shape optimization of piezoelectric sensors or actuators for the control of plates
This paper deals with a new method to control flexible structures by designing non-collocated sensors and actuators satisfying a pseudo-collocation criterion in the low-frequency domain. This technique is applied to a simply supported plate with a point force actuator and a piezoelectric sensor, for which we give some theoretical and numerical results. We also compute low-order controllers which stabilize pseudo-collocated systems and the closed-loop behavior show that this approach is very promising....
Shape optimization of piezoelectric sensors or actuators for the control of plates
This paper deals with a new method to control flexible structures by designing non-collocated sensors and actuators satisfying a pseudo-collocation criterion in the low-frequency domain. This technique is applied to a simply supported plate with a point force actuator and a piezoelectric sensor, for which we give some theoretical and numerical results. We also compute low-order controllers which stabilize pseudo-collocated systems and the closed-loop behavior show that this approach is very promising. ...
Shape sensitivity analysis in flow models using a finite-difference approach.
Sharp summability for Monge transport density via interpolation
Using some results proved in De Pascale and Pratelli [Calc. Var. Partial Differ. Equ. 14 (2002) 249-274] (and De Pascale et al. [Bull. London Math. Soc. 36 (2004) 383-395]) and a suitable interpolation technique, we show that the transport density relative to an source is also an function for any .
Sharp summability for Monge Transport density via Interpolation
Using some results proved in De Pascale and Pratelli [Calc. Var. Partial Differ. Equ.14 (2002) 249-274] (and De Pascale et al. [Bull. London Math. Soc.36 (2004) 383-395]) and a suitable interpolation technique, we show that the transport density relative to an Lp source is also an Lp function for any .
Shields-Harary numbers of graphs with respect to continuous concave cost functions.
Sign changes in linear combinations of derivatives and convolutions of Polya frequency functions.
Signal Group: Definitions and Algorithms
Sign-consistency and solvability of constrained linear systems.
Signpost systems and spanning trees of graphs
By a ternary system we mean an ordered pair , where is a finite nonempty set and . By a signpost system we mean a ternary system satisfying the following conditions for all : if , then and ; if , then there exists such that . In this paper, a signpost system is used as a common description of a connected graph and a spanning tree of the graph. By a ct-pair we mean an ordered pair , where is a connected graph and is a spanning tree of . If is a ct-pair, then by the guide to...
Simple correspondence analysis of nominal-ordinal contingency tables.
Simple counter examples for the unsolvability of the Fermat- and Steiner-Weber-problem by compass and ruler.
Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem
Simulated annealing algorithms and Markov chains with rare transitions
Simulated Annealing and Joint Manufacturing Batch- Sizing