Quartic formulation of Coulomb 3D frictional contact

Size: px
Start display at page:

Download "Quartic formulation of Coulomb 3D frictional contact"

Transcription

1 INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Quartic formulation of Coulomb 3D frictional contact Olivier Bonnefon Gilles Daviet N 0400 January 10, 2011 Modeling, Optimization, and Control of Dynamic Systems apport technique ISSN ISRN INRIA/RT FR+ENG

2

3 Quartic formulation of Coulomb 3D frictional contact Olivier Bonnefon, Gilles Daviet Theme : Modeling, Optimization, and Control of Dynamic Systems Applied Mathematics, Computation and Simulation Équipe-Projet BiPoP Rapport technique n 0400 January 10, pages Abstract: In this paper, we focus on the problem of a single contact with Coulomb friction, which we reduce to a root-finding problem on a degree 4 polynomial. This formulation give us the exact number of solutions, as well as their analytical form when they exist. Key-words: coulomb friction, mechanics, contact Centre de recherche INRIA Grenoble Rhône-Alpes 655, avenue de l Europe, Montbonnot Saint Ismier Téléphone : Télécopie

4 Formulation quartique du contact avec frottement de Coulomb tridimensionnel Résumé : Dans ce document, nous reformulons le problème unitaire1 contact frottant en la recherche de zéro d un polynôme du quatrième degré. Si elles existent, cette formulation donne la forme analytique des solutions. Mots-clés : frottement de coulomb, mécanique, contact

5 Quartic formulation of Coulomb 3D frictional contact 3 1 Introduction Numerical simulation of three dimensional frictionnal contact with impacts has been thoroughly studied in the last two decade[rad05],[bro00],[ab08],[cad09]. In this paper, we use the framework introduced by Moreau [Mor88] and we focus on the solution of the problem for a single contact, which we reduce to a root-finding problem on a degree 4 polynomial. The idea consists in doing an enumerative exploration of the Coulomb friction s cases. 1.1 The Coulomb friction model We first define the second order cone, K µ R 3, of parameter µ > 0 in the unitary direction e R 3 : K µ = {x R 3 : x x.e e µ x.e} 1 Where a.b is the usual dot product of two vectors. Coulomb s frictional law is a relation between the reaction force R R 3 and the relative velocity U R 3. In this case, e is a unitary normal to the surface at the contact point. The relation can be written as a disjonctive formulation: Take-off: R = 0 and U.e 0 Sticking: U = 0 and R intk µ Sliding: R K µ and U.e=0 and α > 0,R R.e e = αu We note Cµ,e the set of all U,R R 3 R 3 satisfying this law. 1.2 Discretised problem The discretization of the mechanical problem is deeply described in[mor88],[ab08]. In the case of a single contact, it consists in finding U R 3 and R R 3 subject to: U = MR+q, 3 U,R Cµ,e Where M R 3,3 a regular symetric positive matrix and q R 3. The problem is written in a orthonormal frame e,e t1,e t2. We distinguish between the tangential part and the normal part of R. The normal part is defined as R N := R.e, that is the first coordinate of R.The tangential part is defined as R T R 2, the coordinates of the vector R e.r in the frame e t1,e t Enumerative method for solving It consists in successively looking for a solution in each of the cases defined in Take-off case In this case, R equals to zero. The system 3 leads to U = q which is a solution if and only if q,0 Cµ,e. It consists in checking that e.q > 0.

6 Quartic formulation of Coulomb 3D frictional contact Sticking case Here, U must be equal to zero, and f M is invertible 3 leads to R = M 1 q which is a solution if and only if { R R 3 MR = q } intk µ. If M is invertible, this amounts to checking that M 1 q intk µ. 2.3 Sliding case When µ > 0, This is the only non-trivial case. The main contribution of this document is the reformulation of this problem as a quartic root-finding problem. In the two following sections, we derive formulations of such polynomials. 3 Quartic polynomial in tanθ 2 0 It consists in finding α > 0 and R K µ such that α RT That is : M R T is on a conic α α = MR + q. R+q = 0 4 The first line ofthe system 4 and the R K µ equation define the intersection between a plan and a cone in R 3 : That is: µr N = R T M 11 µ R T = q 1 M 12 R T1 M 13 R T2 5 µ 2 R 2 N = R2 T1 +R2 T1 M 2 11 µ 2 R 2 T1 +R2 T1 = q 1 M 12 R T1 M 13 R T2 2 6 This means that R T is contained into a conic, whose focus and directrice are: D : q 1 +M 12 R T1 +M 13 R T2 = 0 focus : O M 2 11 µ DistO,R 2 T 2 = DistD,R T 2 M12 2 +M13 2 DistO,R T DistD,R = µ M12 2 +M2 13 T M 11 = e 7 The parametric equation is: R T1 = rcosθ R T2 = rsinθ r = p 1+ecosθ φ 8 With p a simple expression of M 11,M 12,M 13, and φ a constant angle between D and O,R T1

7 Quartic formulation of Coulomb 3D frictional contact The last two lines of the system 4 R T α 0 M 1. + M + R µ 0 α T + q = 0 9 M issymetric,sothereexistsaunitarymatrixv suchthatv MV T d1 0 =. 0 d 2 One can get: Rename: R T V µ M 1. +V R T µ M + α 0 0 α M 1. + d1 +α 0 0 d 2 +α V T VR T +V q = 0 10 R T + q = 0 11 In the plan, V is either a rotation or a symmetry. So R T = VR T is a conic with the same focus and a rotated directrice, which means that there exists φ 1 such that : The equation 11 is : R T1 = rcosθ R T2 = rsinθ r = p 1+ecosθ φ 1 d 1 +α R T1 = q 1 +a 1 R T d 2 +α R T2 = q 2 +a 2 R T The case R T1 = 0 or R T2 = 0 has to be examined. We try to eliminate alpha: that leads to: d 1 RT1 RT2 +α R T1 RT2 = q 1 RT2 +a 1 RT2 R T d 2 RT1 RT2 +α R T1 RT2 = q 2 RT1 +a 2 RT1 R T 14 d 1 d 2 R T1 RT2 = q 1 RT2 + q 2 RT1 +a 1 RT2 a 2 RT1 R T 15 The parametric expression of R T leads to: d 1 d 2 r 2 cosθsinθ = q 1 rsinθ+ q 2 rcosθ+ra 1 rsinθ a 2 rcosθ ie: d 1 d 2 rcosθsinθ = q 1 sinθ+ q 2 cosθ+ra 1 sinθ a 2 cosθ 16 with the expression of r: p d 1 d 2 1+ecosθ φ cosθsinθ = 1 p q 1 sinθ+ q 2 cosθ+ 1+ecosθ φ a 1 1sinθ a 2 cosθ ie: d 1 d 2 pcosθsinθ = 1+ecosθ φ 1 q 1 sinθ+ q 2 cosθ+pa 1 sinθ a 2 cosθ ie: d 1 d 2 pcosθsinθ = pa 1 sinθ a 2 cosθ +1+ecosθcosφ 1 +sinθsinφ 1 q 1 sinθ+ q 2 cosθ ie: 0 = d 1 d 2 pcosθsinθ+p a 1 sinθ+a 2 cosθ +1+ecosθcosφ 1 +esinθsinφ 1 q 1 sinθ q 2 cosθ 17

8 Quartic formulation of Coulomb 3D frictional contact 6 rename: Acosθ 2 +Bsinθ 2 +Csinθcosθ+Dsinθ+Ecosθ = 0 18 with A = e q 2 cosφ 1 B = e q 1 sinφ 1 C = d 1 d 2 p+ecosφ 1 q 1 esinφ 1 q 2 D = q 1 pa 1 E = q 2 +pa 2 Performing the following change of variables: 19 leads to: A 1 t2 2 1+t +B 4t2 2 t = tanθ/2 sinθ = 2t 1+t 2 cosθ = 1 t2 1+t t +C 2t1 t2 2 1+t +D2t+E1 t 2 = 0 2 ie: A1 t Bt 2 +C2t1 t 2 +2Dt1+t 2 +E1 t 2 1+t 2 = 0 ie: P 4 = A E P 3 = 2C +2D P 2 = 4B 2A P 1 = 2C +2D P 0 = A+E 21 Finally, we get 4 possible values for R T, checking the sign of α and R N selects the solutions. 3.3 Case R T12 = 0 From 13, R T1 leads to: From 13, R T2 leads to: R T = R T2 = q1 a 1 R T = 0 ± q1 a 1 22 R T = R T1 = q2 a 2 ± q 2 23 R T = a 2 0 From R T, we have to check the coherence with the equation 12. If it is on the conic, we compute R, and the sign condition of the equation 4 must be checked. 4 Quartic polynomial in α Just like in previous formulation, we want to find α > 0 and R K µ such that 0 U N = 0 and α = MR+q. RT

9 Quartic formulation of Coulomb 3D frictional contact 7 That is : 0 = M α 0 R+q α R T = µr N Let s decompose M: M := m 0 m 01 m 02 m 01 m 02 If m 00 = 0, since M is positive-semidefinite, m 01 = m 02 = 0. Then : M T with if q N 0, there is no solution to the problem if q N = 0, we can chose an arbitrary α and take any solution of the linear system on R T then set R N = 1 µ R T. We suppose now that m 00 > 0. We can rewrite 24 as: 0 = [ m 00,m 01,m 02 R+q ] N α 0 0 = M T + R 0 α T + R T = µr N m01 m 02 R N +q T and then, substituting the first line into the second one : 0 = m 00,m 01,m 02 R+q N 0 = ΛαR T +w 25 R T = µr N Λα := λ1 +α λ 12 λ 12 λ 2 +α α 0 = M T + 0 α 1 m01 m m 00 m 01,m and To study Λα, we define: w := q T q N m01 m 00 m 02 L := m 00 Λ0 = m 00 M T m01 m 02 m 01,m 02 Since M is positive definite, we have i j m ij m ii m jj. That means that i = 0,1L ii = m 00 m i+1i+1 m 2 0i+1 0. We conclude that trl 0. Moreover, deriving the determinant of L, we remark that. detl = m 00 detm 0

10 Quartic formulation of Coulomb 3D frictional contact 8 L is therefore a 2 2 symmetric matrix with a positive trace and determinant, which means L is positive-semidefinite. So is Λ since m 00 > 0, and α > 0, Λα is positive-definite. We get 1 R T = det Λα λ2 +α λ 12 λ 12 λ 1 +α w 26 Now, let s return to equation 25 and combine its first line into the last one, then square the result: RT1 2 +R2 T2 = µ2 m 2 m 01 R T1 +m 02 R T2 +q N 2 00 Multiplying both sides by detλα 2 : 0 = detλαr T1 2 +detλαr T2 2 µ2 m 2 [m 01 detλαr T1 +m 02 detλαr T2 +detλαq N ] Now remember from 26 that detλαr Ti are linear functions in α, and detλα is a degree 2 polynomial in α. The expression in 27 is therefore a degree 4 polynomial a quartic in α, whose roots in R + are the solution of our frictionnal contact problem. 5 Numerical example We consider the following problem, which is derived from a??? system: M = e e and q = The formulation, using t = tanθ 2, described in the section 3, leads to the following polynomial: and µ = 0.6 Pt = t t t t The formulation, using α, described in 4, leads to the following polynomial: Pα = α α α α Both of thems yield the solution: R = However, we found that in this particular case we could reach the machine precision using the formulation based on t = tanθ 2 of the section 3, while the worse-conditioned polynomial of section 4 gave us an error of Precision measurements were done using the Alart-Curnier [AC91] function.

11 Quartic formulation of Coulomb 3D frictional contact 9 6 Conclusion We presented two distinct approaches for expressing the sliding case of Coulomb s frictional law as a degree 4 polynomial, from which we can deduce the analytic solutions. While in itself restricted to systems with a single contact, this method can be embedded as a local solver in a Gauss-Seidel like algorithm [JAJ98], allowing us to deal with real-world problems. These quartic formulations are implemented in the Siconos Platform [AP07], [AB08], and are used as well in the MECHE framework for simulating fibrous materials. References [AB08] V. Acary and B. Brogliato. Numerical Methods for Nonsmooth Dynamical Systems: Applications in Mechanics and Electronics, volume 35 of Lecture Notes in Applied and Computational Mechanics. Springer Verlag, [AC91] P. Alart and A. Curnier. A mixed formulation for frictional contact problems prone to Newton like solution methods. Comput. Methods Appl. Mech. Eng., 923: , [AP07] V. Acary and F. Pérignon. An introduction to Siconos. Technical Report TR-0340, INRIA, [Bro00] B. Brogliato, editor. Impact in Mechanical systems: Analysis and Modelling, volume 551 of Lecture Notes in Physics. Springer, [Cad09] F. Cadoux. Méthodes d optimisation pour la dynamique non-régulière. PhD thesis, Université Joseph Fourier, November [JAJ98] Franck Jourdan, Pierre Alart, and Michel Jean. A Gauss-Seidel like algorithm to solve frictional contact problems. Comput. Methods Appl. Mech. Eng., :31 47, [Mor88] J.-J. Moreau. Unilateral contact and dry friction in finite freedom dynamics. Nonsmooth mechanics and applications, CISM Courses Lect. 302, , [RAD05] M. Renouf, V. Acary, and G. Dumont. 3d frictional contact and impact multibody dynamics. a comparison of algorithms suitable for real-time applications. In ECCOMAS, 2005.

12 Centre de recherche INRIA Grenoble Rhône-Alpes 655, avenue de l Europe Montbonnot Saint-Ismier France Centre de recherche INRIA Bordeaux Sud Ouest : Domaine Universitaire - 351, cours de la Libération Talence Cedex Centre de recherche INRIA Lille Nord Europe : Parc Scientifique de la Haute Borne - 40, avenue Halley Villeneuve d Ascq Centre de recherche INRIA Nancy Grand Est : LORIA, Technopôle de Nancy-Brabois - Campus scientifique 615, rue du Jardin Botanique - BP Villers-lès-Nancy Cedex Centre de recherche INRIA Paris Rocquencourt : Domaine de Voluceau - Rocquencourt - BP Le Chesnay Cedex Centre de recherche INRIA Rennes Bretagne Atlantique : IRISA, Campus universitaire de Beaulieu Rennes Cedex Centre de recherche INRIA Saclay Île-de-France : Parc Orsay Université - ZAC des Vignes : 4, rue Jacques Monod Orsay Cedex Centre de recherche INRIA Sophia Antipolis Méditerranée : 2004, route des Lucioles - BP Sophia Antipolis Cedex Éditeur INRIA - Domaine de Voluceau - Rocquencourt, BP Le Chesnay Cedex France ISSN

Maximizing the Cohesion is NP-hard

Maximizing the Cohesion is NP-hard INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Maximizing the Cohesion is NP-hard arxiv:1109.1994v2 [cs.ni] 9 Oct 2011 Adrien Friggeri Eric Fleury N 774 version 2 initial version 8 September

More information

Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks

Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks Alonso Silva Patricio Reyes Mérouane Debbah N 6854 February 29 Thème

More information

On the behavior of upwind schemes in the low Mach number limit. IV : P0 Approximation on triangular and tetrahedral cells

On the behavior of upwind schemes in the low Mach number limit. IV : P0 Approximation on triangular and tetrahedral cells On the behavior of upwind schemes in the low Mach number limit. IV : P0 Approximation on triangular and tetrahedral cells Hervé Guillard To cite this version: Hervé Guillard. On the behavior of upwind

More information

Henry law and gas phase disappearance

Henry law and gas phase disappearance INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:0904.1195v1 [physics.chem-ph] 7 Apr 2009 Henry law and gas phase disappearance Jérôme Jaffré Amel Sboui apport de recherche N 6891

More information

A CMA-ES for Mixed-Integer Nonlinear Optimization

A CMA-ES for Mixed-Integer Nonlinear Optimization A CMA-ES for Mixed-Integer Nonlinear Optimization Nikolaus Hansen To cite this version: Nikolaus Hansen. A CMA-ES for Mixed-Integer Nonlinear Optimization. [Research Report] RR-, INRIA.. HAL Id: inria-

More information

A General Framework for Nonlinear Functional Regression with Reproducing Kernel Hilbert Spaces

A General Framework for Nonlinear Functional Regression with Reproducing Kernel Hilbert Spaces INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE A General Framework for Nonlinear Functional Regression with Reproducing Kernel Hilbert Spaces Hachem Kadri Emmanuel Duflos Manuel Davy

More information

A filtering method for the interval eigenvalue problem

A filtering method for the interval eigenvalue problem A filtering method for the interval eigenvalue problem Milan Hladik, David Daney, Elias P. Tsigaridas To cite this version: Milan Hladik, David Daney, Elias P. Tsigaridas. A filtering method for the interval

More information

Multiplication by an Integer Constant: Lower Bounds on the Code Length

Multiplication by an Integer Constant: Lower Bounds on the Code Length INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Multiplication by an Integer Constant: Lower Bounds on the Code Length Vincent Lefèvre N 4493 Juillet 2002 THÈME 2 ISSN 0249-6399 ISRN INRIA/RR--4493--FR+ENG

More information

Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions

Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions Nikolaus Hansen, Steffen Finck, Raymond Ros, Anne Auger To cite this version: Nikolaus Hansen, Steffen Finck, Raymond

More information

Rigid Transformation Estimation in Point Registration Procedures: Study of the Use of Mahalanobis Distances

Rigid Transformation Estimation in Point Registration Procedures: Study of the Use of Mahalanobis Distances Rigid Transformation Estimation in Point Registration Procedures: Study of the Use of Mahalanobis Distances Manuel Yguel To cite this version: Manuel Yguel. Rigid Transformation Estimation in Point Registration

More information

Bound on Run of Zeros and Ones for Images of Floating-Point Numbers by Algebraic Functions

Bound on Run of Zeros and Ones for Images of Floating-Point Numbers by Algebraic Functions Bound on Run of Zeros and Ones for Images of Floating-Point Numbers by Algebraic Functions Tomas Lang, Jean-Michel Muller To cite this version: Tomas Lang, Jean-Michel Muller Bound on Run of Zeros and

More information

Bounds on eigenvalues and singular values of interval matrices

Bounds on eigenvalues and singular values of interval matrices Bounds on eigenvalues and singular values of interval matrices Milan Hladik, David Daney, Elias P. Tsigaridas To cite this version: Milan Hladik, David Daney, Elias P. Tsigaridas. Bounds on eigenvalues

More information

Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire model

Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire model Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire model Jonathan Touboul To cite this version: Jonathan Touboul. Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire

More information

The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach

The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach Cyril Duron, Jean-Marie Proth To cite this version: Cyril Duron, Jean-Marie Proth. The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach.

More information

Bernstein s basis and real root isolation

Bernstein s basis and real root isolation INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Bernstein s basis and real root isolation Bernard Mourrain Fabrice Rouillier Marie-Françoise Roy N 5149 Mars 2004 THÈME 2 N 0249-6399 ISRN

More information

Anti-sparse coding for approximate nearest neighbor search

Anti-sparse coding for approximate nearest neighbor search INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:1110.3767v2 [cs.cv] 25 Oct 2011 Anti-sparse coding for approximate nearest neighbor search Hervé Jégou Teddy Furon Jean-Jacques Fuchs

More information

Euler scheme for SDEs with non-lipschitz diffusion coefficient: strong convergence

Euler scheme for SDEs with non-lipschitz diffusion coefficient: strong convergence Author manuscript, published in "SAIM: Probability and Statistics 12 (28) 15" INSTITUT NATIONAL D RCHRCH N INFORMATIQU T N AUTOMATIQU uler scheme for SDs with non-lipschitz diffusion coefficient: strong

More information

Optimal and asymptotically optimal CUSUM rules for change point detection in the Brownian Motion model with multiple alternatives

Optimal and asymptotically optimal CUSUM rules for change point detection in the Brownian Motion model with multiple alternatives INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Optimal and asymptotically optimal CUSUM rules for change point detection in the Brownian Motion model with multiple alternatives Olympia

More information

An algorithm for reporting maximal c-cliques

An algorithm for reporting maximal c-cliques An algorithm for reporting maximal c-cliques Frédéric Cazals, Chinmay Karande To cite this version: Frédéric Cazals, Chinmay Karande. An algorithm for reporting maximal c-cliques. [Research Report] RR-5642,

More information

Error Bounds on Complex Floating-Point Multiplication

Error Bounds on Complex Floating-Point Multiplication Error Bounds on Complex Floating-Point Multiplication Richard Brent, Colin Percival, Paul Zimmermann To cite this version: Richard Brent, Colin Percival, Paul Zimmermann. Error Bounds on Complex Floating-Point

More information

Bounded Normal Approximation in Highly Reliable Markovian Systems

Bounded Normal Approximation in Highly Reliable Markovian Systems Bounded Normal Approximation in Highly Reliable Markovian Systems Bruno Tuffin To cite this version: Bruno Tuffin. Bounded Normal Approximation in Highly Reliable Markovian Systems. [Research Report] RR-3020,

More information

A Note on Node Coloring in the SINR Model

A Note on Node Coloring in the SINR Model A Note on Node Coloring in the SINR Model Bilel Derbel, El-Ghazali Talbi To cite this version: Bilel Derbel, El-Ghazali Talbi. A Note on Node Coloring in the SINR Model. [Research Report] RR-7058, INRIA.

More information

Stability and regulation of nonsmooth dynamical systems

Stability and regulation of nonsmooth dynamical systems Stability and regulation of nonsmooth dynamical systems Sophie Chareyron, Pierre-Brice Wieber To cite this version: Sophie Chareyron, Pierre-Brice Wieber. Stability and regulation of nonsmooth dynamical

More information

Parallel bottleneck in the Quasineutrality solver embedded in GYSELA

Parallel bottleneck in the Quasineutrality solver embedded in GYSELA INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Parallel bottleneck in the Quasineutrality solver embedded in GYSELA G. Latu N. Crouseilles V. Grandgirard N 7595 Avril 2011 Domaine 1 apport

More information

A new flexible Checkpoint/Restart model

A new flexible Checkpoint/Restart model A new flexible Checkpoint/Restart model Mohamed Slim Bouguerra, Denis Trystram, Thierry Gautier, Jean-Marc Vincent To cite this version: Mohamed Slim Bouguerra, Denis Trystram, Thierry Gautier, Jean-Marc

More information

Numerical modification of atmospheric models to include the feedback of oceanic currents on air-sea fluxes in ocean-atmosphere coupled models

Numerical modification of atmospheric models to include the feedback of oceanic currents on air-sea fluxes in ocean-atmosphere coupled models Numerical modification of atmospheric models to include the feedback of oceanic currents on air-sea fluxes in ocean-atmosphere coupled models Florian Lemarié To cite this version: Florian Lemarié. Numerical

More information

Throughput optimization for micro-factories subject to failures

Throughput optimization for micro-factories subject to failures Throughput optimization for micro-factories subject to failures Anne Benoit, Alexandru Dobrila, Jean-Marc Nicod, Laurent Philippe To cite this version: Anne Benoit, Alexandru Dobrila, Jean-Marc Nicod,

More information

Iterative Methods for Model Reduction by Domain Decomposition

Iterative Methods for Model Reduction by Domain Decomposition INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:0712.0691v1 [physics.class-ph] 5 Dec 2007 Iterative Methods for Model Reduction by Domain Decomposition Marcelo Buffoni Haysam Telib

More information

On the Size of Some Trees Embedded in R d

On the Size of Some Trees Embedded in R d INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE On the Size of Some Trees Embee in R Pero Machao Manhães e Castro Olivier Devillers inria-448335, version - 8 Jan N 779 Janvier apport e

More information

Global Gene Regulation in Metabolic Networks

Global Gene Regulation in Metabolic Networks Global Gene Regulation in Metabolic Networks Diego Oyarzun, Madalena Chaves To cite this version: Diego Oyarzun, Madalena Chaves. Global Gene Regulation in Metabolic Networks. [Research Report] RR-7468,

More information

Generalized Optimization Framework for Graph-based Semi-supervised Learning

Generalized Optimization Framework for Graph-based Semi-supervised Learning INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Generalized Optimization Framework for Graph-based Semi-supervised Learning Konstantin Avrachenkov Paulo Gonçalves Alexey Mishenin Marina

More information

A hybridizable discontinuous Galerkin method for time-harmonic Maxwell s equations

A hybridizable discontinuous Galerkin method for time-harmonic Maxwell s equations A hybridizable discontinuous Galerkin method for time-harmonic Maxwell s equations Stéphane Lanteri, Liang Li, Ronan Perrussel To cite this version: Stéphane Lanteri, Liang Li, Ronan Perrussel. A hybridizable

More information

Closed-Form Solution to the Structure from Motion Problem by Fusing Visual and Inertial Sensing

Closed-Form Solution to the Structure from Motion Problem by Fusing Visual and Inertial Sensing INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Closed-Form Solution to the Structure from Motion Problem by Fusing Visual and Inertial Sensing Agostino Martinelli N???? Mai 2012 Thèmes

More information

Boundary Control Problems for Shape Memory Alloys under State Constraints

Boundary Control Problems for Shape Memory Alloys under State Constraints INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Boundary Control Problems for Shape Memory Alloys under State Constraints Nikolaus Bubner, Jan Sokołowski and Jürgen Sprekels N 2994 Octobre

More information

Counting eigenvalues in domains of the complex field

Counting eigenvalues in domains of the complex field Counting eigenvalues in domains of the complex field Emmanuel Kamgnia, Bernard Philippe To cite this version: Emmanuel Kamgnia, Bernard Philippe. Counting eigenvalues in domains of the complex field. INRIA.

More information

Optimal Routing Policy in Two Deterministic Queues

Optimal Routing Policy in Two Deterministic Queues INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Optimal Routing Policy in Two Deterministic Queues Bruno Gaujal Emmanuel Hyon N 3997 Septembre 2000 THÈME 1 ISSN 0249-6399 ISRN INRIA/RR--3997--FR+ENG

More information

Optimal Routing Policy in Two Deterministic Queues

Optimal Routing Policy in Two Deterministic Queues Optimal Routing Policy in Two Deterministic Queues Bruno Gaujal, Emmanuel Hyon To cite this version: Bruno Gaujal, Emmanuel Hyon. Optimal Routing Policy in Two Deterministic Queues. [Research Report] RR-37,

More information

Analysis of hybrid RD-Galerkin schemes for Navier-Stokes simulations

Analysis of hybrid RD-Galerkin schemes for Navier-Stokes simulations Analysis of hybrid RD-Galerkin schemes for Navier-Stokes simulations Jiří Dobeš, Mario Ricchiuto, Rémi Abgrall, Herman Deconinck To cite this version: Jiří Dobeš, Mario Ricchiuto, Rémi Abgrall, Herman

More information

On the Holonomy or Algebraicity of Generating Functions Counting Lattice Walks in the Quarter-Plane

On the Holonomy or Algebraicity of Generating Functions Counting Lattice Walks in the Quarter-Plane INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE On the Holonomy or Algebraicity of Generating Functions Counting Lattice Walks in the Quarter-Plane arxiv:1004.1733v1 [math.pr] 10 Apr 2010

More information

Nonsmooth Newton methods for frictional contact problems in flexible multi-body systems

Nonsmooth Newton methods for frictional contact problems in flexible multi-body systems 1/21 Nonsmooth Newton methods for frictional contact problems in flexible multi-body systems V. Acary, M. Brémond, F. Dubois INRIA Rhône Alpes, Grenoble. LMGC Montpellier 13 eme Colloque National en Calcul

More information

Combining Mixture Components for Clustering

Combining Mixture Components for Clustering INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Combining Mixture Components for Clustering Jean-Patrick Baudry Adrian E. Raftery Gilles Celeux enneth Lo Raphael Gottardo inria-319, version

More information

Efficient polynomial L -approximations

Efficient polynomial L -approximations INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Efficient polynomial L -approximations Nicolas Brisebarre Sylvain Chevillard N???? December 2006 Thème SYM apport de recherche ISSN 0249-6399

More information

Performance de Compound TCP en présence de pertes aléatoires

Performance de Compound TCP en présence de pertes aléatoires INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Performance de Compound TCP en présence de pertes aléatoires Alberto Blanc Konstantin Avrachenkov Denis Collange Giovanni Neglia N 6736

More information

Supervised Dictionary Learning

Supervised Dictionary Learning INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Supervised Dictionary Learning Julien Mairal Francis Bach Jean Ponce Guillermo Sapiro Andrew Zisserman N 6652 September 2008 Thème COG apport

More information

Improving Goldschmidt Division, Square Root and Square Root Reciprocal

Improving Goldschmidt Division, Square Root and Square Root Reciprocal INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Improving Goldschmidt Division, Square Root and Square Root Reciprocal Milos Ercegovac, Laurent Imbert, David Matula, Jean-Michel Muller,

More information

Geometry and Numerics of CMC Surfaces with Radial Metrics

Geometry and Numerics of CMC Surfaces with Radial Metrics INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Geometry and Numerics of CMC Surfaces with Radial Metrics Gabriel Dos Reis N 4763 Mars 2003 THÈME 2 ISSN 0249-6399 ISRN INRIA/RR--4763--FRENG

More information

Rare event simulation for a static distribution

Rare event simulation for a static distribution INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Rare event simulation for a static distribution F. Cérou P. Del Moral T. Furon A. Guyader N 6792 Janvier 2009 Thèmes COG et NUM apport de

More information

Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions

Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions Mohab Safey El Din, Lihong Zhi To cite this version: Mohab Safey El Din, Lihong Zhi. Computing Rational Points in

More information

Space Time relaying versus Information Causality

Space Time relaying versus Information Causality Space Time relaying versus Information Causality Philippe Jacquet To cite this version: Philippe Jacquet. Space Time relaying versus Information Causality. [Research Report] RR-648, INRIA. 008, pp.15.

More information

Numerical Accuracy Evaluation for Polynomial Computation

Numerical Accuracy Evaluation for Polynomial Computation Numerical Accuracy Evaluation for Polynomial Computation Jean-Charles Naud, Daniel Ménard RESEARCH REPORT N 7878 February 20 Project-Teams CAIRN ISSN 0249-6399 ISRN INRIA/RR--7878--FR+ENG Numerical Accuracy

More information

Two-scale analysis for very rough thin layers. An explicit characterization of the polarization tensor

Two-scale analysis for very rough thin layers. An explicit characterization of the polarization tensor wo-scale analysis for very rough thin layers. An explicit characterization of the polarization tensor Ionel Sorin Ciuperca, Ronan Perrussel, Clair Poignard o cite this version: Ionel Sorin Ciuperca, Ronan

More information

Realistic wireless network model with explicit capacity evaluation

Realistic wireless network model with explicit capacity evaluation Realistic wireless network model with explicit capacity evaluation Philippe Jacquet To cite this version: Philippe Jacquet. Realistic wireless network model with explicit capacity evaluation. [Research

More information

Triangles to Capture Social Cohesion

Triangles to Capture Social Cohesion Triangles to Capture Social Cohesion Adrien Friggeri, Guillaume Chelius, Eric Fleury To cite this version: Adrien Friggeri, Guillaume Chelius, Eric Fleury. Triangles to Capture Social Cohesion. [Research

More information

ISSN ISRN INRIA/RR FR+ENG. apport de recherche

ISSN ISRN INRIA/RR FR+ENG. apport de recherche INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE 3914 Analytic Combinatorics of Chord Diagrams Philippe Flajolet, Marc Noy N3914 March 2000 THEME 2 ISSN 0249-6399 ISRN INRIA/RR--3914--FR+ENG

More information

Online Distributed Traffic Grooming on Path Networks

Online Distributed Traffic Grooming on Path Networks INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Online Distributed Traffic Grooming on Path Networks Jean-Claude Bermond David Coudert Joseph Peters N 6833 February 2009 Thème COM apport

More information

A bundle-type algorithm for routing in telecommunication data networks

A bundle-type algorithm for routing in telecommunication data networks A bundle-type algorithm for routing in telecommunication data networks Claude Lemarechal, Adam Ouorou, Giorgios Petrou To cite this version: Claude Lemarechal, Adam Ouorou, Giorgios Petrou. A bundle-type

More information

Optimization of a photobioreactor biomass production using natural light

Optimization of a photobioreactor biomass production using natural light INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:1009.2137v1 [math.oc] 11 Sep 2010 Optimization of a photobioreactor biomass production using natural light F. Grognard A.R. Akhmetzhanov

More information

Optimal control of state constrained integral equations

Optimal control of state constrained integral equations INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Optimal control of state constrained integral equations J. Frédéric Bonnans Constanza de la Vega inria-473952, version 1-16 Apr 21 N 7257

More information

Random walks in the quarter-plane with zero drift: an explicit criterion for the finiteness of the associated group

Random walks in the quarter-plane with zero drift: an explicit criterion for the finiteness of the associated group INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Random walks in the quarter-plane with zero drift: an explicit criterion for the finiteness of the associated group arxiv:1103.0192v1 [math.pr]

More information

A Markov model of land use dynamics

A Markov model of land use dynamics INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:1107.0785v1 [math.pr] 5 Jul 2011 A Markov model of land use dynamics Fabien Campillo Dominique Hervé Angelo Raherinirina Rivo Rakotozafy

More information

Online data processing: comparison of Bayesian regularized particle filters

Online data processing: comparison of Bayesian regularized particle filters Online data processing: comparison of Bayesian regularized particle filters Roberto Casarin, Jean-Michel Marin To cite this version: Roberto Casarin, Jean-Michel Marin. Online data processing: comparison

More information

Hélène Barucq, Rabia Djellouli, Anne-Gaëlle Saint-Guirons. To cite this version: HAL Id: inria

Hélène Barucq, Rabia Djellouli, Anne-Gaëlle Saint-Guirons. To cite this version: HAL Id: inria Construction and performance analysis of local DtN absorbing boundary conditions for exterior Helmholtz problems. Part II : Prolate spheroid boundaries Hélène Barucq, Rabia Djellouli, Anne-Gaëlle Saint-Guirons

More information

Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices

Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices Fanny Dufossé, Bora Uçar To cite this version: Fanny Dufossé, Bora Uçar. Notes on Birkhoff-von Neumann decomposition of doubly

More information

Optimization of a photobioreactor biomass production using natural light

Optimization of a photobioreactor biomass production using natural light Optimization of a photobioreactor biomass production using natural light Frédéric Grognard, Andrei Akhmetzhanov, Masci Pierre, Olivier Bernard To cite this version: Frédéric Grognard, Andrei Akhmetzhanov,

More information

A distributed algorithm for computing and updating the process number of a forest

A distributed algorithm for computing and updating the process number of a forest INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE A distributed algorithm for computing and updating the process number of a forest David Coudert Florian Huc Dorian Mazauric N 6560 June

More information

A note on the complexity of univariate root isolation

A note on the complexity of univariate root isolation A note on the complexity of univariate root isolation Ioannis Emiris, Elias P. Tsigaridas To cite this version: Ioannis Emiris, Elias P. Tsigaridas. A note on the complexity of univariate root isolation.

More information

Analogy on Sequences : a Definition and an Algorithm

Analogy on Sequences : a Definition and an Algorithm INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Analogy on Sequences : a Definition and an Algorithm Laurent Miclet Arnaud Delhay N 4969 Octobre 2003 THÈME 3 apport de recherche ISSN 0249-6399

More information

Sign methods for counting and computing real roots of algebraic systems

Sign methods for counting and computing real roots of algebraic systems INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Sign methods for counting and computing real roots of algebraic systems Ioannis Z. Emiris & Bernard Mourrain & Mihail N. Vrahatis N 3669

More information

Delaunay triangulation of a random sample of a good sample has linear size

Delaunay triangulation of a random sample of a good sample has linear size Delaunay triangulation of a random sample of a good sample has linear size Olivier Devillers, Marc Glisse To cite this version: Olivier Devillers, Marc Glisse. Delaunay triangulation of a random sample

More information

Complex Square Root with Operand Prescaling

Complex Square Root with Operand Prescaling Complex Square Root with Operand Prescaling Milos Ercegovac, Jean-Michel Muller To cite this version: Milos Ercegovac, Jean-Michel Muller. Complex Square Root with Operand Prescaling. [Research Report]

More information

A new algorithm for finding minimum-weight words in a linear code: application to primitive narrow-sense BCH codes of length 511

A new algorithm for finding minimum-weight words in a linear code: application to primitive narrow-sense BCH codes of length 511 INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE A new algorithm for finding minimum-weight words in a linear code: application to primitive narrow-sense BCH codes of length 511 Anne Canteaut

More information

Analysis and Low-order Modeling of the Three-dimensional Flow Past a Confined Square Cylinder

Analysis and Low-order Modeling of the Three-dimensional Flow Past a Confined Square Cylinder INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Analysis and Low-order ing of the Three-dimensional Flow Past a Confined Square Cylinder inria-19345, version - 6 Oct 6 Marcelo Buffoni

More information

Robust model identification of actuated vortex wakes

Robust model identification of actuated vortex wakes Robust model identification of actuated vortex wakes Jessie Weller, Edoardo Lombardi, Angelo Iollo To cite this version: Jessie Weller, Edoardo Lombardi, Angelo Iollo. Robust model identification of actuated

More information

3D revolute joint with clearance in multibody systems

3D revolute joint with clearance in multibody systems 3D revolute joint with clearance in multibody systems Narendra Akhadkar 1, Vincent Acary 2, and Bernard Brogliato 2 1 Schneider Electric, 37 Quai Paul-Louis Merlin, 38000 Grenoble, France, e-mail: narendra.akhadkar@schneider-electric.com

More information

An implicit hybridized discontinuous Galerkin method for time-domain Maxwell s equations

An implicit hybridized discontinuous Galerkin method for time-domain Maxwell s equations An implicit hybridized discontinuous Galerkin method for time-domain Maxwell s equations Stephane Lanteri, Ronan Perrussel To cite this version: Stephane Lanteri, Ronan Perrussel. An implicit hybridized

More information

Packetization and Aggregate Scheduling

Packetization and Aggregate Scheduling Packetization and Aggregate Scheduling Anne Bouillard, Nadir Farhi, Bruno Gaujal To cite this version: Anne Bouillard, Nadir Farhi, Bruno Gaujal. Packetization and Aggregate Scheduling. [Research Report]

More information

Comparison of TCP Reno and TCP Vegas via Fluid Approximation

Comparison of TCP Reno and TCP Vegas via Fluid Approximation INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Comparison of TCP Reno and TCP Vegas via Fluid Approximation Thomas Bonald N 3563 Novembre 1998 THÈME 1 apport de recherche ISSN 0249-6399

More information

Bandit Algorithms for Tree Search

Bandit Algorithms for Tree Search Bandit Algorithms for Tree Search Pierre-Arnaud Coquelin, Rémi Munos To cite this version: Pierre-Arnaud Coquelin, Rémi Munos. Bandit Algorithms for Tree Search. [Research Report] RR- 6141, INRIA. 2007,

More information

New analysis of the asymptotic behavior of the Lempel-Ziv compression algorithm

New analysis of the asymptotic behavior of the Lempel-Ziv compression algorithm New analysis of the asymptotic behavior of the Lempel-Ziv compression algorithm Philippe Jacquet, Szpankowski Wojciech To cite this version: Philippe Jacquet, Szpankowski Wojciech. New analysis of the

More information

Initialization of Particle Filter and Posterior Cramér-Rao Bound for Bearings-Only Tracking in Modified Polar Coordinate System

Initialization of Particle Filter and Posterior Cramér-Rao Bound for Bearings-Only Tracking in Modified Polar Coordinate System Initialization of Particle Filter and Posterior Cramér-Rao Bound for Bearings-Only Tracking in Modified Polar Coordinate System Thomas Bréhard Jean-Pierre Le Cadre To cite this version: Thomas Bréhard

More information

On Semigroups of Matrices in the (max,+) Algebra

On Semigroups of Matrices in the (max,+) Algebra INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE On Semigroups of Matrices in the (max,) Algebra Stéphane GAUBERT N 2172 Janvier 1994 PROGRAMME 5 Traitement du signal, automatique et productique

More information

Incremental displacement-correction schemes for the explicit coupling of a thin structure with an incompressible fluid

Incremental displacement-correction schemes for the explicit coupling of a thin structure with an incompressible fluid Incremental displacement-correction scemes for te explicit coupling of a tin structure wit an incompressible fluid Miguel Angel Fernández To cite tis version: Miguel Angel Fernández. Incremental displacement-correction

More information

Online data processing: comparison of Bayesian regularized particle filters

Online data processing: comparison of Bayesian regularized particle filters Online data processing: comparison of Bayesian regularized particle filters Roberto Casarin, Jean-Michel Marin To cite this version: Roberto Casarin, Jean-Michel Marin. Online data processing: comparison

More information

Under-determined reverberant audio source separation using a full-rank spatial covariance model

Under-determined reverberant audio source separation using a full-rank spatial covariance model INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:0912.0171v2 [stat.ml] 14 Dec 2009 Under-determined reverberant audio source separation using a full-rank spatial covariance model

More information

Solution of contact problems with friction

Solution of contact problems with friction Solution of contact problems with friction Pierre Joli, Zhi-Qiang Feng, Nadjet Talbi To cite this version: Pierre Joli, Zhi-Qiang Feng, Nadjet Talbi. Solution of contact problems with friction: Pseudo-potential

More information

Singular arcs in the generalized Goddard s Problem

Singular arcs in the generalized Goddard s Problem INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:math/739v [math.oc] 3 Mar 27 Singular arcs in the generalized Goddard s Problem apport de recherche Frédéric Bonnans Pierre Martinon

More information

Zigzag Persistent Homology in Matrix Multiplication Time

Zigzag Persistent Homology in Matrix Multiplication Time INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Zigzag Persistent Homology in Matrix Multiplication Time Nikola Milosavljević Dmitriy Morozov N 7393 September 2010 Thème COM Primož Škraba

More information

Exact control of genetic networks in a qualitative framework: the bistable switch example

Exact control of genetic networks in a qualitative framework: the bistable switch example Exact control of genetic networks in a qualitative framework: the bistable switch example Madalena Chaves, Jean-Luc Gouzé To cite this version: Madalena Chaves, Jean-Luc Gouzé. Exact control of genetic

More information

Hélène Barucq, Rabia Djellouli, Anne-Gaëlle Saint-Guirons. To cite this version: HAL Id: inria

Hélène Barucq, Rabia Djellouli, Anne-Gaëlle Saint-Guirons. To cite this version: HAL Id: inria Construction and performance analysis of local DtN absorbing boundary conditions for exterior Helmholtz problems. Part I : Elliptical shaped boundaries Hélène Barucq, Rabia Djellouli, Anne-Gaëlle Saint-Guirons

More information

Adaptive Power Techniques for Blind Channel Estimation in CDMA Systems

Adaptive Power Techniques for Blind Channel Estimation in CDMA Systems Adaptive Power Techniques for Blind Channel Estimation in CDMA Systems Xenofon Doukopoulos, George Moustakides To cite this version: Xenofon Doukopoulos, George Moustakides. Adaptive Power Techniques for

More information

MGDA II: A direct method for calculating a descent direction common to several criteria

MGDA II: A direct method for calculating a descent direction common to several criteria MGDA II: A direct method for calculating a descent direction common to several criteria Jean-Antoine Désidéri To cite this version: Jean-Antoine Désidéri. MGDA II: A direct method for calculating a descent

More information

Time- and Space-Efficient Evaluation of Some Hypergeometric Constants

Time- and Space-Efficient Evaluation of Some Hypergeometric Constants INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Time- and Space-Efficient Evaluation of Some Hypergeometric Constants Howard Cheng Guillaume Hanrot Emmanuel Thomé Eugene Zima Paul Zimmermann

More information

Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP

Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP Oliver Schuetze, Carlos A. Coello Coello, Emilia Tantar, El-Ghazali Talbi To cite this version: Oliver Schuetze, Carlos

More information

The restricted isometry property meets nonlinear approximation with redundant frames

The restricted isometry property meets nonlinear approximation with redundant frames The restricted isometry property meets nonlinear approximation with redundant frames Rémi Gribonval, Morten Nielsen To cite this version: Rémi Gribonval, Morten Nielsen. The restricted isometry property

More information

Subdivision methods for solving polynomial equations

Subdivision methods for solving polynomial equations Subdivision methods for solving polynomial equations Bernard Mourrain, Jean-Pascal Pavone To cite this version: Bernard Mourrain, Jean-Pascal Pavone. Subdivision methods for solving polynomial equations.

More information

Residual for Component Specifications

Residual for Component Specifications INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Residual for Component Specifications Jean-Baptiste Raclet N 6196 Avril 2007 Thème COM apport de recherche ISSN 0249-6399 ISRN INRIA/RR--6196--FR+ENG

More information

Perturbed path following interior point algorithms 1. 8cmcsc8. RR n2745

Perturbed path following interior point algorithms 1. 8cmcsc8. RR n2745 Perturbed path following interior point algorithms 0 0 8cmcsc8 RR n2745 INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Perturbed path following interior point algorithms J. Frédéric Bonnans,

More information

Index routing for task allocation in Grids

Index routing for task allocation in Grids Index routing for task allocation in Grids Vandy Berten, Bruno Gaujal To cite this version: Vandy Berten, Bruno Gaujal. Index routing for task allocation in Grids. [Research Report] RR-5892, INRIA. 2006.

More information

Modular Grammars and Splitting of Catamorphisms

Modular Grammars and Splitting of Catamorphisms Modular Grammars and Splitting of Catamorphisms Eric Badouel, Rodrigue Djeumen To cite this version: Eric Badouel, Rodrigue Djeumen. Modular Grammars and Splitting of Catamorphisms. [Research Report] RR-6313,

More information

Blind Adaptive Channel Estimationin OFDM Systems

Blind Adaptive Channel Estimationin OFDM Systems Blind Adaptive Channel stimationin OFDM Systems Xenofon Doukopoulos, George Moustakides To cite this version: Xenofon Doukopoulos, George Moustakides Blind Adaptive Channel stimationin OFDM Systems [Research

More information