Symmetric Norm Inequalities And Positive Semi-Definite Block-Matrices

Size: px
Start display at page:

Download "Symmetric Norm Inequalities And Positive Semi-Definite Block-Matrices"

Transcription

1 Symmetric Norm Inequalities And Positive Semi-Definite lock-matrices Antoine Mhanna To cite this version: Antoine Mhanna Symmetric Norm Inequalities And Positive Semi-Definite lock-matrices 15 <hal-11844v5> HAL Id: hal Submitted on 14 Sep 15 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not The documents may come from teaching and research institutions in France or abroad, or from public or private research centers L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés

2 Symmetric Norm Inequalities And Positive Semi-Definite lock-matrices Antoine Mhanna 1 1 Dept of Mathematics, Lebanese University, Hadath, eirut, Lebanon tmhanat@yahoocom Abstract For positive semi-definite block-matrix M, we say that M is PSD and we write M = X M + n+m, with A M+ n, M + m The focus is on studying the consequences of a decomposition lemma due to C ourrin and the main result is extending the class of PSD matrices M written by blocks of same size that satisfies the inequality: M A+ for all symmetric norms Keywords : Matrix Analysis, Hermitian matrices, symmetric norms 1 Introduction Let A be an n n matrix and F an m m matrix, m > n written by blocks such that A is a diagonal block and all entries other than those of A are zeros, then the two matrices have the same singular values and for all unitarily invariant norms A = F = A, we say then that the symmetric norm on M m induces a symmetric norm on M n, so for square matrices we may assume that our norms are defined on all spaces M n, n 1 The spectral norm is denoted by s, the Frobenius norm by, and the Ky Fan k norms by k Let M + n denote the set of positive and semi-definite part of the space of n n complex matrices and M be any positive semi-definite block-matrices; that is, M = X M + n+m, with A M+ n, M+ m 1

3 Decomposition of block-matrices Lemma 1 For every matrix M in M + n+m written in blocks, we have the decomposition: A X A X = U U +V V for some unitaries U,V M n+m Proof Factorize the positive matrix as a square of positive matrices: A X C Y C Y X = Y D Y D we verify that the right hand side can be written as T T +S S so : C Y C Y C C Y Y Y D Y = D Y + D Y D }{{}}{{}}{{}}{{} T T S S Since TT = CC +YY = A, SS = Y Y +DD AA is unitarily congruent to A A for any square matrix A, the lemma follows = and Remark 1 As a consequence of this lemma we have: M A + for all symmetric norms Equations involving unitary matrices are called unitary orbits representations Recall that if A M n, RA = A+A and IA = A A i Corollary 1 For every matrix in M + n written in blocks of the same size, we have the decomposition: A X A+ X = U RX U +V A+ V +RX for some unitaries U,V M n Proof Let J = 1 I I where I is the identity of M I I n, J is a unitary matrix, and we have: A+ A A X J X J RX + X X = A X X A+ +RX }{{} N

4 Now we factorize N as a square of positive matrices: A X X = J L M L M M F M J F and let: A direct computation shows that: δψ = 1 L M δ = J M = L+M 1 M +F F M L F M L M ψ = M J = L+M M L 1 F F +M F M L+M L+M+M+FF+M L+M M L+M+FF M M LL+M+F MF+M M LM L+F MF M = Γ Γ+Φ Φ 1 where: Γ = 1 L+M M L, and Φ = 1 F +M F M to finish notice that for any square matrix A, A A is unitarily congruent to AA and, ΓΓ, ΦΦ have the required form The previous corollary implies that A+ RX and A+ RX Corollary For every matrix in M + n written in blocks of the same size, we have the decomposition: X = U A+ +IX U +V A+ V IX for some unitaries U,V M n+m A X A Proof The proof is similar to Corollary 1, we have: J 1 X J 1 = ix I where J 1 =, and ii K = JJ 1 X J 1J = A+ +IX A+ IX ix here * means an unspecified entry, the proof is similar to that in Corollary 1 but for reader s convenience we give the main headlines: first factorize K as a square of positive matrices; that is, M = X = J 1 J L JJ 1 next decompose L as in Lemma 1 to obtain M = J 1J T T +S SJJ 1 = J 1J T TJJ 1 +J 1J S SJJ 1 3

5 A+ where TT = +IX property completes the proof and SS = A+ finally the congruence IX The existence of unitaries U and V in the decomposition process need not to be unique as one can take the special case; that is, M any diagonal matrix with diagonal k k entries equals a nonnegative number k, explicitly M = ki = U I U +V I V for any U and V unitaries Remark Notice that from the Courant-Fischer theorem if A, M + n, then the eigenvalues of each matrix are the same as the singular values and A = A k k, for all k = 1,,n, also A < = A k < k, for all k = 1,,n Corollary 3 For every matrix in M + n written in blocks of the same size, we have: X 1 { U for some unitaries U,V M n+m A+ + X X } U +V V A+ + X X Proof This a consequence of the fact that IX IX 3 Symmetric Norms and Inequalities In [1] they found that if X is hermitian then M A+ for all symmetric norms It has been given counter-examples showing that this does not necessarily holds if X is a normal but not Hermitian matrix, the main idea of this section is to give examples and counter-examples in a general way and to extend the previous inequality to a larger class of PSD matrices written by blocks satisfying Theorem 31 If A and are positive definite matrices of same size Then X > A X 1 X 4

6 A X I X 1 A X Proof Write X = 1 X I I X 1 I the identity matrix, and that complete the proof since for any matrix A, where I is A X AX, X A Theorem 3 Let M = be any square matrix written by blocks of same size, C D if AC = CA then detm = detad C Proof Suppose first that A is invertible, let us write M as M = Z I E V I F 3 upon calculation we find that: Z = A, V = C, E = A 1, F = D CA 1 taking the determinant on each side of 3 we get: detm = detad CA 1 = detad C the result follows by a continuity argument since the Determinant function is a continuous function Given thematrix M = X amatrix inm + n written byblocks of samesize, we know that it M is not PSD, to see this notice that all the extracted principle submatrices of M are PSD if and only if X = and A is positive semi-definite Even if a proof of this exists and would take two lines, it is quite nice to see a different constructive proof, a direct consequence of Lemma 1 Theorem 33 Given X a matrix in M + n written in blocks of same size: 1 If X is positive semi-definite, IX > or IX <, then there exist a A Y matrix Y such that M = Y is positive semi-definite and: A Y Y > A 4 for all symmetric norms 5

7 X If X is positive semi-definite, IX > or IX < then there exist a Y matrix Y such that M = Y is positive semi-definite and: The same result holds if we replaced IX by RX because congruent to X Y Y > 5 A ix ix is unitarily Proof Without loss of generality we can consider IX > cause X and A X X are unitarily congruent, we will show the first statement as the second one has a similar proof, from Corollary we have: X U A U +U IX U +V A V A X A lx Since X is congruent to L = lx for any l C, L is PSD A is a fixed A matrix, we have U k U +V A V = β A k for some β 1 finally we set Y = lx where l R is large enough to have M k > A k, k thus M > A for all symmetric norms Notice that there exist a permutation matrix P such that P X P 1 = X andsinceix > ifandonlyifix X A <,thetwoassertions oftheorem33 are equivalent up to a permutation similarity Corollary 31 If M = X, A a positive semi-definite matrix, and we have one of the following conditions: 1 RX > RX < 3 IX > 4 IX < 6

8 Then M can t be positive semi-definite Proof y Remark 1 any positive semi-definite matrix M written in blocks must satisfy M A + for all symmetric norms which is not the case of the matrix M constructed in Theorem 33 Finally we get: Theorem 34 If X and =, A, the matrix M = positive semi-definite X cannot be Proof Suppose the converse, so M = X is positive semi-definite, without loss of generality the only case we need to discuss is when RX has positive and negative eigenvalues, by Corollary 1 we can write: M = U A RX U +V A +RX V for some unitaries U,V M n Now if RX has α the smallest negative eigenvalue RX+α+ǫI > consequently the matrix A H = U RX U +V A V 6 +α+ǫi +RX+α+ǫI A+α+ǫI X +α+ǫi = X +α+ǫi 7 is positive semi-definite with RY >, where Y = X +α+ǫi, by Corollary 31 this is a contradiction A natural question would be how many are the nontrivial PSDmatrices written by blocks? The following lemma will show us how to construct some of them Lemma 31 Let A and be any n n positive definite matrices, then there exist an ta X integer t 1 such that the matrix F t = X is positive definite t Proof Recall from Theorem 31 that F 1 is positive definite if and only if A > X 1 X, which is equivalent to x Ax > x X 1 X x for all x C n Set fx := x Ax and gx := x X 1 X x and let us suppose, to the contrary, that there exist a vector z such 7

9 that fz gz since fx and gx are homogeneous functions of degre d = over R if fx gx for all x such that x s = 1 then fx gx for any x C n So let us set K = max gx, and L = min fx since gx and fx are continuous functions x s =1 x s =1 and {x; x s = 1} is compact, there exist a vector w respectively v such that K = gw, respectively L = fv Now choose t 1 such that tfv > gw, to obtain t x tax v tav > w Xt 1 X w x Xt 1 X x for all x such that x s = 1, thus x tax > x Xt 1 X x for any x C n which completes the proof Theorem 35 Let A = diagλ 1,,λ n, = diagν 1,,ν n and M = X a given positive semi-definite matrix If X commute with A and X X equals a diagonal matrix, then M A+ for all symmetric norms The same inequality holds if X commute with and XX is diagonal Proof It suffices to prove the inequality for the Ky Fan k norms k = 1,,n, let P = In X A X wherei I n n istheidentity matrixofordern, since = P X A X P 1 and X have same singular values, we will discuss only the first case; that is, when X commute with Aand X X is diagonal, as the second case will follows Let D := X X = d 1 d d n that the eigenvalues of, as X commute with A, from Theorem 3 we conclude X are the roots of deta µi n µi n D = 8

10 Equivalently the eigenvalues are all the solutions of the n equations: 1 λ 1 µν 1 µ d 1 = λ µν µ d = 3 λ 3 µν 3 µ d 3 = i λ i µν i µ d i = n λ n µν n µ d n = Each equation is of nd degree, if we denote by a i and b i the two solutions of the i th equation we deduce that: a 1 +b 1 = λ 1 +ν 1 a +b = λ +ν a n +b n = λ n +ν n ut λ 1 +ν 1 λ +ν A+ = λ n +ν n and each diagonal entry of A+ is equal the sum of two nonegative eigenvalues of M, thus we have necessarily: M k A + k for all k = 1,,n which completes the proof Example 31 Let i x 99 i M x = 1 i 99 1 i 1 3 If 1 x 1, M x is positive definite and we have: for all symmetric norms, where A = M x A+ 8 x and = definite for x = 3 1 then M x is PD for all x > 3 The eigenvalues of M If M x is positive which are 9

11 the same as the singular values of M 3 are: 1 λ 1 = λ = 19 + λ 3 = 149 λ 4 = 19 And the 8 inequality follows from Theorem Let us study the commutation condition in Theorem 35 First notice that any square matrix X = x ij M n will commute with A = diaga 1,,a n if and only if : x 1,1 a 1 x 1, a x 1,n a n x 1,1 a 1 x 1, a 1 x 1,n a 1 Y x,1 a 1 x, a x,n a n = = x,1 a x, a x,n a = Y x n,1 a 1 x n, a x n,n a n x n,1 a n x n, a n x n,n a n An i,j entry of Y is equal to that of Y if and only if x i,j a j = x i,j a i, ie either a i = a j or x i,j = Corollary 3 Let A = diagλ 1,,λ n, = diagν 1,,ν n and M = X a given positive semi-definite matrix If X commute with A, or X commute with, then M A+ for all symmetric norms Proof As in Theorem 35, we will assume without loss of generality that X commute with A, as theother case is similar If X is diagonal the resultfollows from Theorem 35, suppose there is an off diagonal entry x i,j of X different from, from the commutation condition we have a i = a j and the same goes for all such entries, of course if AX = XA then PAXP 1 = PXAP 1 = PAP 1 PXP 1 = PXP 1 PAP 1 = PXAP 1 Take P to be the permutation matrix that will order the same diagonal entries of A in a one diagonal block and keeps the matrix the same, since M is Hermitian so is PMP 1 1

12 because we can consider the permutation matrix as a product of transposition matrices P 1,,P n wich are orthogonal; in other words PMP 1 = P 1 P P n MP T n PT PT 1 Consequently P T = P 1 for any permutation matrix and M = PMP T for all symmetric norms If H = PMP T, D := PX and X i is some i i extracted submatrix of X, we will have the block written matrix PAP T PX H = = X P T ai i O j O s O i bi j O s O i O j ri s X i O j O s O i X j O s O i O j X s X i O i O i O j X j O j O s O s X s ν 1 ν ν n where we denoted the diagonal matrix of order i whose diagonal entries are equal to a by ai i and the zero block of order i by O i Let us calculate the roots of the characteristic polynomial of H; that is, the roots of det a λi i O j O s O i b λi j O s O i O j r λi s ν 1 λ ν λ ν n λ D D = we translate this to a system of blocks, while each eigenvalue of H, which is the same as its singular value, will verify one of the following equations: 1 det a λi i ν 1 λ X i X i ν i λ det b λi j ν i+1 λ X j X j c det ν i+j λ r λi s ν n s λ ν n λ X sx s = = = where c is the number of diagonal blocks we have Let us have a closer look to any of the equations above, without loss of generality we will take the first one, the same will hold for the others, notice that all eigenvalues λ are nonnegative and we have ai i X i ν1 C1 X M 1 = X i = i Xi K 1 ν i 11 T

13 is positive semi-definite because it s eigenvalues are a subset of those of M The key idea is that for this matrix C 1 +K 1 = C 1 + K 1 for all symmetric norms where C 1 = ai i and K = ν1 ν i Now back to the system T we associate like we did to M 1 each equation whose number is i to a positive semi-definite matrix M i to obtain by Remark 1 M 1 k M k M c k ai i + bi j + ri s + = ai i k + k = bi j k + k ν1 ν i νi+1 ν i+j νn s = ri s k + k ν n ν1 ν i k νi+1 ν i+j νn s ν n k k for all k, but the order of the entries of are arbitrary chosen, thus from Theorem 35 M k A+ k for all k = 1,,n and that completes the proof Corollary 33 Let M = X be a positive semi-definite matrix written by blocks There exist a unitary V and a unitary U such that for all symmetric norms A X X UAU +VV := A + Proof Let U and V be two unitary matrix such that UAU = D o and VV = G o where D o and G o are two diagonal matrices having the same ordering o, of eigenvalues with respect to their indexes ie, if λ n λ 1 are the diagonal entries of D o, and ν n ν 1 are those of G o, then if λ i is in the j,j position then ν i will be also Consequently UAU +VV = D o +G o = D o + G o = A +, for all the Ky-Fan k norms and thus for all symmetric norms To complete the proof notice that U if T = UXV and Q is the unitary matrix, by Remark 1 V A X X = A X Q X Q = Do T T D G o + G o 13 o for all symmetric norms 1

14 Theorem 36 Let M = X, if X is normal, X commute with A and X commute with, then we have M A+ for all symmetric norms Proof We consider first that the normal matrix X has all of its eigenvalues distinct, by Theorem?? and the normality condition, there exist a unitary matrix U such that U AU and U X U are both diagonal A direct computation shows that: U U A X X U = U U AU U XU U X U U = G U Now U XU also commute with U U, since U XU is diagonal and all of its diagonal entries are distinct by Remark?? U U must be also diagonal, applying Theorem 35 to the matrix G yields to: A X X = G U AU +U U = A+, for all symmetric norms The inequality holds for any X normal by a continuity argument Lemma 3 Let N = a 1 a a n D D b 1 b b n where a 1,,a n respectively b 1,,b n are nonnegative respectively negative real numbers, A = a 1 a a n, = b 1 b b n and D is any diagonal matrix, then nor N neither N is positive semi-definite Set d 1,,d n as the diagonal entries of D D, if a i +b i and a i b i d i < for all i n, then N > A + for all symmetric norms Proof The diagonal of N has negative and positive numbers, thus nor N neither N is positive semi-definite, now any two diagonal matrices will commute, in particular D and A, by applying Theorem 3 we get that the eigenvalues of N are the roots of deta µi n µi n D D = 13

15 Equivalently the eigenvalues are all the solutions of the n equations: 1 a 1 µb 1 µ d 1 = a µb µ d = 3 a 3 µb 3 µ d 3 = i a i µb i µ d n = n a n µb n µ d n = S Let us denote by x i and y i the two solutions of the i th equation then: x 1 +y 1 = a 1 +b 1 x +y = a +b x n +y n = a n +b n x 1 y 1 = a 1 b 1 d 1 < x y = a b d < x n y n = a n b n d n < This implies that each equation of S has one negative and one positive solution, their sum is positive, thus the positive root is bigger or equal than the negative one Since A + = a1 +b 1 a n+b n, summing over indexes we see that N k > A + k for k = 1,,n which yields to N > A+ for all symmetric norms It seems easy to construct examples of non PSD matrices N written in blocks such that N s > A+ s, let us have a look of such inequality for PSD matrices Example 3 Let C = 5 A X 3 = 1 X where A = 3 3, = Since the eigenvalues of C are all positive with 1 λ 1 38, λ 17, λ 3 9, λ 4 89, C is positive definite and we verify that 38 C s > A+ s = 3 Example 33 Let N y = y A X 1 = X 14

16 where A = y and = 1 The eigenvalues of N y are the numbers: λ 1 = 4, λ = 1, λ 3 = y, λ 4 =, thus if y, N y is positive semi-definite and for all y such that y < 1 we have 1 4 = N y s > A+ s = 3 16+y +1 = N > A+ = 43+y+y +1 15

17 References [1] J C ourin, E Y Lee, and M Lin, On a decomposition lemma for positive semidefinite block-matrices, Linear Algebra and its Applications 437, pp , 1 [] J C ourin, F Hiai, Norm and anti-norm inequalities for positive semi-definite matrices, InternatJMath63, pp , 11 16

Norm Inequalities of Positive Semi-Definite Matrices

Norm Inequalities of Positive Semi-Definite Matrices Norm Inequalities of Positive Semi-Definite Matrices Antoine Mhanna To cite this version: Antoine Mhanna Norm Inequalities of Positive Semi-Definite Matrices 15 HAL Id: hal-11844 https://halinriafr/hal-11844v1

More information

On Symmetric Norm Inequalities And Hermitian Block-Matrices

On Symmetric Norm Inequalities And Hermitian Block-Matrices On Symmetric Norm Inequalities And Hermitian lock-matrices Antoine Mhanna To cite this version: Antoine Mhanna On Symmetric Norm Inequalities And Hermitian lock-matrices 015 HAL Id: hal-0131860

More information

On Symmetric Norm Inequalities And Hermitian Block-Matrices

On Symmetric Norm Inequalities And Hermitian Block-Matrices On Symmetric Norm Inequalities And Hermitian lock-matrices Antoine Mhanna To cite this version: Antoine Mhanna On Symmetric Norm Inequalities And Hermitian lock-matrices 016 HAL Id: hal-0131860

More information

A Context free language associated with interval maps

A Context free language associated with interval maps A Context free language associated with interval maps M Archana, V Kannan To cite this version: M Archana, V Kannan. A Context free language associated with interval maps. Discrete Mathematics and Theoretical

More information

Methylation-associated PHOX2B gene silencing is a rare event in human neuroblastoma.

Methylation-associated PHOX2B gene silencing is a rare event in human neuroblastoma. Methylation-associated PHOX2B gene silencing is a rare event in human neuroblastoma. Loïc De Pontual, Delphine Trochet, Franck Bourdeaut, Sophie Thomas, Heather Etchevers, Agnes Chompret, Véronique Minard,

More information

Full-order observers for linear systems with unknown inputs

Full-order observers for linear systems with unknown inputs Full-order observers for linear systems with unknown inputs Mohamed Darouach, Michel Zasadzinski, Shi Jie Xu To cite this version: Mohamed Darouach, Michel Zasadzinski, Shi Jie Xu. Full-order observers

More information

Linear Quadratic Zero-Sum Two-Person Differential Games

Linear Quadratic Zero-Sum Two-Person Differential Games Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard To cite this version: Pierre Bernhard. Linear Quadratic Zero-Sum Two-Person Differential Games. Encyclopaedia of Systems and Control,

More information

Dissipative Systems Analysis and Control, Theory and Applications: Addendum/Erratum

Dissipative Systems Analysis and Control, Theory and Applications: Addendum/Erratum Dissipative Systems Analysis and Control, Theory and Applications: Addendum/Erratum Bernard Brogliato To cite this version: Bernard Brogliato. Dissipative Systems Analysis and Control, Theory and Applications:

More information

Completeness of the Tree System for Propositional Classical Logic

Completeness of the Tree System for Propositional Classical Logic Completeness of the Tree System for Propositional Classical Logic Shahid Rahman To cite this version: Shahid Rahman. Completeness of the Tree System for Propositional Classical Logic. Licence. France.

More information

On size, radius and minimum degree

On size, radius and minimum degree On size, radius and minimum degree Simon Mukwembi To cite this version: Simon Mukwembi. On size, radius and minimum degree. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no.

More information

Easter bracelets for years

Easter bracelets for years Easter bracelets for 5700000 years Denis Roegel To cite this version: Denis Roegel. Easter bracelets for 5700000 years. [Research Report] 2014. HAL Id: hal-01009457 https://hal.inria.fr/hal-01009457

More information

Some tight polynomial-exponential lower bounds for an exponential function

Some tight polynomial-exponential lower bounds for an exponential function Some tight polynomial-exponential lower bounds for an exponential function Christophe Chesneau To cite this version: Christophe Chesneau. Some tight polynomial-exponential lower bounds for an exponential

More information

The Windy Postman Problem on Series-Parallel Graphs

The Windy Postman Problem on Series-Parallel Graphs The Windy Postman Problem on Series-Parallel Graphs Francisco Javier Zaragoza Martínez To cite this version: Francisco Javier Zaragoza Martínez. The Windy Postman Problem on Series-Parallel Graphs. Stefan

More information

New estimates for the div-curl-grad operators and elliptic problems with L1-data in the half-space

New estimates for the div-curl-grad operators and elliptic problems with L1-data in the half-space New estimates for the div-curl-grad operators and elliptic problems with L1-data in the half-space Chérif Amrouche, Huy Hoang Nguyen To cite this version: Chérif Amrouche, Huy Hoang Nguyen. New estimates

More information

Soundness of the System of Semantic Trees for Classical Logic based on Fitting and Smullyan

Soundness of the System of Semantic Trees for Classical Logic based on Fitting and Smullyan Soundness of the System of Semantic Trees for Classical Logic based on Fitting and Smullyan Shahid Rahman To cite this version: Shahid Rahman. Soundness of the System of Semantic Trees for Classical Logic

More information

Solution to Sylvester equation associated to linear descriptor systems

Solution to Sylvester equation associated to linear descriptor systems Solution to Sylvester equation associated to linear descriptor systems Mohamed Darouach To cite this version: Mohamed Darouach. Solution to Sylvester equation associated to linear descriptor systems. Systems

More information

Axiom of infinity and construction of N

Axiom of infinity and construction of N Axiom of infinity and construction of N F Portal To cite this version: F Portal. Axiom of infinity and construction of N. 2015. HAL Id: hal-01162075 https://hal.archives-ouvertes.fr/hal-01162075 Submitted

More information

Case report on the article Water nanoelectrolysis: A simple model, Journal of Applied Physics (2017) 122,

Case report on the article Water nanoelectrolysis: A simple model, Journal of Applied Physics (2017) 122, Case report on the article Water nanoelectrolysis: A simple model, Journal of Applied Physics (2017) 122, 244902 Juan Olives, Zoubida Hammadi, Roger Morin, Laurent Lapena To cite this version: Juan Olives,

More information

On the longest path in a recursively partitionable graph

On the longest path in a recursively partitionable graph On the longest path in a recursively partitionable graph Julien Bensmail To cite this version: Julien Bensmail. On the longest path in a recursively partitionable graph. 2012. HAL Id:

More information

On path partitions of the divisor graph

On path partitions of the divisor graph On path partitions of the divisor graph Paul Melotti, Eric Saias To cite this version: Paul Melotti, Eric Saias On path partitions of the divisor graph 018 HAL Id: hal-0184801 https://halarchives-ouvertesfr/hal-0184801

More information

Low frequency resolvent estimates for long range perturbations of the Euclidean Laplacian

Low frequency resolvent estimates for long range perturbations of the Euclidean Laplacian Low frequency resolvent estimates for long range perturbations of the Euclidean Laplacian Jean-Francois Bony, Dietrich Häfner To cite this version: Jean-Francois Bony, Dietrich Häfner. Low frequency resolvent

More information

Confluence Algebras and Acyclicity of the Koszul Complex

Confluence Algebras and Acyclicity of the Koszul Complex Confluence Algebras and Acyclicity of the Koszul Complex Cyrille Chenavier To cite this version: Cyrille Chenavier. Confluence Algebras and Acyclicity of the Koszul Complex. Algebras and Representation

More information

Smart Bolometer: Toward Monolithic Bolometer with Smart Functions

Smart Bolometer: Toward Monolithic Bolometer with Smart Functions Smart Bolometer: Toward Monolithic Bolometer with Smart Functions Matthieu Denoual, Gilles Allègre, Patrick Attia, Olivier De Sagazan To cite this version: Matthieu Denoual, Gilles Allègre, Patrick Attia,

More information

On infinite permutations

On infinite permutations On infinite permutations Dmitri G. Fon-Der-Flaass, Anna E. Frid To cite this version: Dmitri G. Fon-Der-Flaass, Anna E. Frid. On infinite permutations. Stefan Felsner. 2005 European Conference on Combinatorics,

More information

Passerelle entre les arts : la sculpture sonore

Passerelle entre les arts : la sculpture sonore Passerelle entre les arts : la sculpture sonore Anaïs Rolez To cite this version: Anaïs Rolez. Passerelle entre les arts : la sculpture sonore. Article destiné à l origine à la Revue de l Institut National

More information

A proximal approach to the inversion of ill-conditioned matrices

A proximal approach to the inversion of ill-conditioned matrices A proximal approach to the inversion of ill-conditioned matrices Pierre Maréchal, Aude Rondepierre To cite this version: Pierre Maréchal, Aude Rondepierre. A proximal approach to the inversion of ill-conditioned

More information

Symmetric Determinantal Representation of Polynomials

Symmetric Determinantal Representation of Polynomials Symmetric Determinantal Representation of Polynomials Ronan Quarez To cite this version: Ronan Quarez. Symmetric Determinantal Representation of Polynomials. Linear Algebra and its Applications, Elsevier,

More information

Evolution of the cooperation and consequences of a decrease in plant diversity on the root symbiont diversity

Evolution of the cooperation and consequences of a decrease in plant diversity on the root symbiont diversity Evolution of the cooperation and consequences of a decrease in plant diversity on the root symbiont diversity Marie Duhamel To cite this version: Marie Duhamel. Evolution of the cooperation and consequences

More information

Spectral inequalities and equalities involving products of matrices

Spectral inequalities and equalities involving products of matrices Spectral inequalities and equalities involving products of matrices Chi-Kwong Li 1 Department of Mathematics, College of William & Mary, Williamsburg, Virginia 23187 (ckli@math.wm.edu) Yiu-Tung Poon Department

More information

On a decomposition lemma for positive semi-definite block-matrices

On a decomposition lemma for positive semi-definite block-matrices On a decomposition lemma for positive semi-definite bloc-matrices arxiv:10.0473v1 [math.fa] Feb 01 Jean-Christophe ourin, Eun-Young Lee, Minghua Lin January, 01 Abstract This short note, in part of expository

More information

Hook lengths and shifted parts of partitions

Hook lengths and shifted parts of partitions Hook lengths and shifted parts of partitions Guo-Niu Han To cite this version: Guo-Niu Han Hook lengths and shifted parts of partitions The Ramanujan Journal, 009, 9 p HAL Id: hal-00395690

More information

A new simple recursive algorithm for finding prime numbers using Rosser s theorem

A new simple recursive algorithm for finding prime numbers using Rosser s theorem A new simple recursive algorithm for finding prime numbers using Rosser s theorem Rédoane Daoudi To cite this version: Rédoane Daoudi. A new simple recursive algorithm for finding prime numbers using Rosser

More information

Analysis of Boyer and Moore s MJRTY algorithm

Analysis of Boyer and Moore s MJRTY algorithm Analysis of Boyer and Moore s MJRTY algorithm Laurent Alonso, Edward M. Reingold To cite this version: Laurent Alonso, Edward M. Reingold. Analysis of Boyer and Moore s MJRTY algorithm. Information Processing

More information

Widely Linear Estimation with Complex Data

Widely Linear Estimation with Complex Data Widely Linear Estimation with Complex Data Bernard Picinbono, Pascal Chevalier To cite this version: Bernard Picinbono, Pascal Chevalier. Widely Linear Estimation with Complex Data. IEEE Transactions on

More information

Can we reduce health inequalities? An analysis of the English strategy ( )

Can we reduce health inequalities? An analysis of the English strategy ( ) Can we reduce health inequalities? An analysis of the English strategy (1997-2010) Johan P Mackenbach To cite this version: Johan P Mackenbach. Can we reduce health inequalities? An analysis of the English

More information

L institution sportive : rêve et illusion

L institution sportive : rêve et illusion L institution sportive : rêve et illusion Hafsi Bedhioufi, Sida Ayachi, Imen Ben Amar To cite this version: Hafsi Bedhioufi, Sida Ayachi, Imen Ben Amar. L institution sportive : rêve et illusion. Revue

More information

Question order experimental constraints on quantum-like models of judgement

Question order experimental constraints on quantum-like models of judgement Question order experimental constraints on quantum-like models of judgement Patrick Cassam-Chenaï To cite this version: Patrick Cassam-Chenaï. Question order experimental constraints on quantum-like models

More information

Thomas Lugand. To cite this version: HAL Id: tel

Thomas Lugand. To cite this version: HAL Id: tel Contribution à la Modélisation et à l Optimisation de la Machine Asynchrone Double Alimentation pour des Applications Hydrauliques de Pompage Turbinage Thomas Lugand To cite this version: Thomas Lugand.

More information

On Poincare-Wirtinger inequalities in spaces of functions of bounded variation

On Poincare-Wirtinger inequalities in spaces of functions of bounded variation On Poincare-Wirtinger inequalities in spaces of functions of bounded variation Maïtine Bergounioux To cite this version: Maïtine Bergounioux. On Poincare-Wirtinger inequalities in spaces of functions of

More information

Unbiased minimum variance estimation for systems with unknown exogenous inputs

Unbiased minimum variance estimation for systems with unknown exogenous inputs Unbiased minimum variance estimation for systems with unknown exogenous inputs Mohamed Darouach, Michel Zasadzinski To cite this version: Mohamed Darouach, Michel Zasadzinski. Unbiased minimum variance

More information

approximation results for the Traveling Salesman and related Problems

approximation results for the Traveling Salesman and related Problems approximation results for the Traveling Salesman and related Problems Jérôme Monnot To cite this version: Jérôme Monnot. approximation results for the Traveling Salesman and related Problems. Information

More information

On the Griesmer bound for nonlinear codes

On the Griesmer bound for nonlinear codes On the Griesmer bound for nonlinear codes Emanuele Bellini, Alessio Meneghetti To cite this version: Emanuele Bellini, Alessio Meneghetti. On the Griesmer bound for nonlinear codes. Pascale Charpin, Nicolas

More information

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation

More information

Chebyshev polynomials, quadratic surds and a variation of Pascal s triangle

Chebyshev polynomials, quadratic surds and a variation of Pascal s triangle Chebyshev polynomials, quadratic surds and a variation of Pascal s triangle Roland Bacher To cite this version: Roland Bacher. Chebyshev polynomials, quadratic surds and a variation of Pascal s triangle.

More information

Avalanche Polynomials of some Families of Graphs

Avalanche Polynomials of some Families of Graphs Avalanche Polynomials of some Families of Graphs Dominique Rossin, Arnaud Dartois, Robert Cori To cite this version: Dominique Rossin, Arnaud Dartois, Robert Cori. Avalanche Polynomials of some Families

More information

Dispersion relation results for VCS at JLab

Dispersion relation results for VCS at JLab Dispersion relation results for VCS at JLab G. Laveissiere To cite this version: G. Laveissiere. Dispersion relation results for VCS at JLab. Compton Scattering from Low to High Momentum Transfer, Mar

More information

Tropical Graph Signal Processing

Tropical Graph Signal Processing Tropical Graph Signal Processing Vincent Gripon To cite this version: Vincent Gripon. Tropical Graph Signal Processing. 2017. HAL Id: hal-01527695 https://hal.archives-ouvertes.fr/hal-01527695v2

More information

Lower bound of the covering radius of binary irreducible Goppa codes

Lower bound of the covering radius of binary irreducible Goppa codes Lower bound of the covering radius of binary irreducible Goppa codes Sergey Bezzateev, Natalia Shekhunova To cite this version: Sergey Bezzateev, Natalia Shekhunova. Lower bound of the covering radius

More information

A note on the computation of the fraction of smallest denominator in between two irreducible fractions

A note on the computation of the fraction of smallest denominator in between two irreducible fractions A note on the computation of the fraction of smallest denominator in between two irreducible fractions Isabelle Sivignon To cite this version: Isabelle Sivignon. A note on the computation of the fraction

More information

Nel s category theory based differential and integral Calculus, or Did Newton know category theory?

Nel s category theory based differential and integral Calculus, or Did Newton know category theory? Nel s category theory based differential and integral Calculus, or Did Newton know category theory? Elemer Elad Rosinger To cite this version: Elemer Elad Rosinger. Nel s category theory based differential

More information

A note on the acyclic 3-choosability of some planar graphs

A note on the acyclic 3-choosability of some planar graphs A note on the acyclic 3-choosability of some planar graphs Hervé Hocquard, Mickael Montassier, André Raspaud To cite this version: Hervé Hocquard, Mickael Montassier, André Raspaud. A note on the acyclic

More information

A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications

A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications Alexandre Sedoglavic To cite this version: Alexandre Sedoglavic. A non-commutative algorithm for multiplying (7 7) matrices

More information

FORMAL TREATMENT OF RADIATION FIELD FLUCTUATIONS IN VACUUM

FORMAL TREATMENT OF RADIATION FIELD FLUCTUATIONS IN VACUUM FORMAL TREATMENT OF RADIATION FIELD FLUCTUATIONS IN VACUUM Frederic Schuller, Renaud Savalle, Michael Neumann-Spallart To cite this version: Frederic Schuller, Renaud Savalle, Michael Neumann-Spallart.

More information

A Slice Based 3-D Schur-Cohn Stability Criterion

A Slice Based 3-D Schur-Cohn Stability Criterion A Slice Based 3-D Schur-Cohn Stability Criterion Ioana Serban, Mohamed Najim To cite this version: Ioana Serban, Mohamed Najim. A Slice Based 3-D Schur-Cohn Stability Criterion. ICASSP 007, Apr 007, Honolulu,

More information

Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based On Block Recombination

Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based On Block Recombination Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based On Block Recombination Murat Cenk, Anwar Hasan, Christophe Negre To cite this version: Murat Cenk, Anwar Hasan, Christophe Negre.

More information

A new approach of the concept of prime number

A new approach of the concept of prime number A new approach of the concept of prime number Jamel Ghannouchi To cite this version: Jamel Ghannouchi. A new approach of the concept of prime number. 4 pages. 24. HAL Id: hal-3943 https://hal.archives-ouvertes.fr/hal-3943

More information

On one class of permutation polynomials over finite fields of characteristic two *

On one class of permutation polynomials over finite fields of characteristic two * On one class of permutation polynomials over finite fields of characteristic two * Leonid Bassalygo, Victor A. Zinoviev To cite this version: Leonid Bassalygo, Victor A. Zinoviev. On one class of permutation

More information

From Unstructured 3D Point Clouds to Structured Knowledge - A Semantics Approach

From Unstructured 3D Point Clouds to Structured Knowledge - A Semantics Approach From Unstructured 3D Point Clouds to Structured Knowledge - A Semantics Approach Christophe Cruz, Helmi Ben Hmida, Frank Boochs, Christophe Nicolle To cite this version: Christophe Cruz, Helmi Ben Hmida,

More information

Solving a quartic equation and certain equations with degree n

Solving a quartic equation and certain equations with degree n Solving a quartic equation and certain equations with degree n Abdeljalil Saghe To cite this version: Abdeljalil Saghe. Solving a quartic equation and certain equations with degree n. EUROPEAN JOURNAL

More information

Math 408 Advanced Linear Algebra

Math 408 Advanced Linear Algebra Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x

More information

Fast Computation of Moore-Penrose Inverse Matrices

Fast Computation of Moore-Penrose Inverse Matrices Fast Computation of Moore-Penrose Inverse Matrices Pierre Courrieu To cite this version: Pierre Courrieu. Fast Computation of Moore-Penrose Inverse Matrices. Neural Information Processing - Letters and

More information

STATISTICAL ENERGY ANALYSIS: CORRELATION BETWEEN DIFFUSE FIELD AND ENERGY EQUIPARTITION

STATISTICAL ENERGY ANALYSIS: CORRELATION BETWEEN DIFFUSE FIELD AND ENERGY EQUIPARTITION STATISTICAL ENERGY ANALYSIS: CORRELATION BETWEEN DIFFUSE FIELD AND ENERGY EQUIPARTITION Thibault Lafont, Alain Le Bot, Nicolas Totaro To cite this version: Thibault Lafont, Alain Le Bot, Nicolas Totaro.

More information

About partial probabilistic information

About partial probabilistic information About partial probabilistic information Alain Chateauneuf, Caroline Ventura To cite this version: Alain Chateauneuf, Caroline Ventura. About partial probabilistic information. Documents de travail du Centre

More information

Some diophantine problems concerning equal sums of integers and their cubes

Some diophantine problems concerning equal sums of integers and their cubes Some diophantine problems concerning equal sums of integers and their cubes Ajai Choudhry To cite this version: Ajai Choudhry. Some diophantine problems concerning equal sums of integers and their cubes.

More information

The Accelerated Euclidean Algorithm

The Accelerated Euclidean Algorithm The Accelerated Euclidean Algorithm Sidi Mohamed Sedjelmaci To cite this version: Sidi Mohamed Sedjelmaci The Accelerated Euclidean Algorithm Laureano Gonzales-Vega and Thomas Recio Eds 2004, University

More information

A remark on a theorem of A. E. Ingham.

A remark on a theorem of A. E. Ingham. A remark on a theorem of A. E. Ingham. K G Bhat, K Ramachandra To cite this version: K G Bhat, K Ramachandra. A remark on a theorem of A. E. Ingham.. Hardy-Ramanujan Journal, Hardy-Ramanujan Society, 2006,

More information

DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS

DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS Issam Naghmouchi To cite this version: Issam Naghmouchi. DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS. 2010. HAL Id: hal-00593321 https://hal.archives-ouvertes.fr/hal-00593321v2

More information

A simple kinetic equation of swarm formation: blow up and global existence

A simple kinetic equation of swarm formation: blow up and global existence A simple kinetic equation of swarm formation: blow up and global existence Miroslaw Lachowicz, Henryk Leszczyński, Martin Parisot To cite this version: Miroslaw Lachowicz, Henryk Leszczyński, Martin Parisot.

More information

b-chromatic number of cacti

b-chromatic number of cacti b-chromatic number of cacti Victor Campos, Claudia Linhares Sales, Frédéric Maffray, Ana Silva To cite this version: Victor Campos, Claudia Linhares Sales, Frédéric Maffray, Ana Silva. b-chromatic number

More information

Vibro-acoustic simulation of a car window

Vibro-acoustic simulation of a car window Vibro-acoustic simulation of a car window Christophe Barras To cite this version: Christophe Barras. Vibro-acoustic simulation of a car window. Société Française d Acoustique. Acoustics 12, Apr 12, Nantes,

More information

Comments on the method of harmonic balance

Comments on the method of harmonic balance Comments on the method of harmonic balance Ronald Mickens To cite this version: Ronald Mickens. Comments on the method of harmonic balance. Journal of Sound and Vibration, Elsevier, 1984, 94 (3), pp.456-460.

More information

Understanding SVM (and associated kernel machines) through the development of a Matlab toolbox

Understanding SVM (and associated kernel machines) through the development of a Matlab toolbox Understanding SVM (and associated kernel machines) through the development of a Matlab toolbox Stephane Canu To cite this version: Stephane Canu. Understanding SVM (and associated kernel machines) through

More information

Self-dual skew codes and factorization of skew polynomials

Self-dual skew codes and factorization of skew polynomials Self-dual skew codes and factorization of skew polynomials Delphine Boucher, Félix Ulmer To cite this version: Delphine Boucher, Félix Ulmer. Self-dual skew codes and factorization of skew polynomials.

More information

On sl3 KZ equations and W3 null-vector equations

On sl3 KZ equations and W3 null-vector equations On sl3 KZ equations and W3 null-vector equations Sylvain Ribault To cite this version: Sylvain Ribault. On sl3 KZ equations and W3 null-vector equations. Conformal Field Theory, Integrable Models, and

More information

Analysis in weighted spaces : preliminary version

Analysis in weighted spaces : preliminary version Analysis in weighted spaces : preliminary version Frank Pacard To cite this version: Frank Pacard. Analysis in weighted spaces : preliminary version. 3rd cycle. Téhéran (Iran, 2006, pp.75.

More information

Exact Comparison of Quadratic Irrationals

Exact Comparison of Quadratic Irrationals Exact Comparison of Quadratic Irrationals Phuc Ngo To cite this version: Phuc Ngo. Exact Comparison of Quadratic Irrationals. [Research Report] LIGM. 20. HAL Id: hal-0069762 https://hal.archives-ouvertes.fr/hal-0069762

More information

Matrix Inequalities by Means of Block Matrices 1

Matrix Inequalities by Means of Block Matrices 1 Mathematical Inequalities & Applications, Vol. 4, No. 4, 200, pp. 48-490. Matrix Inequalities by Means of Block Matrices Fuzhen Zhang 2 Department of Math, Science and Technology Nova Southeastern University,

More information

Econ Slides from Lecture 7

Econ Slides from Lecture 7 Econ 205 Sobel Econ 205 - Slides from Lecture 7 Joel Sobel August 31, 2010 Linear Algebra: Main Theory A linear combination of a collection of vectors {x 1,..., x k } is a vector of the form k λ ix i for

More information

Finite geometries and diffractive orbits in isospectral billiards

Finite geometries and diffractive orbits in isospectral billiards Finite geometries and diffractive orbits in isospectral billiards Olivier Giraud To cite this version: Olivier Giraud. Finite geometries and diffractive orbits in isospectral billiards. Journal of Physics

More information

BERGE VAISMAN AND NASH EQUILIBRIA: TRANSFORMATION OF GAMES

BERGE VAISMAN AND NASH EQUILIBRIA: TRANSFORMATION OF GAMES BERGE VAISMAN AND NASH EQUILIBRIA: TRANSFORMATION OF GAMES Antonin Pottier, Rabia Nessah To cite this version: Antonin Pottier, Rabia Nessah. BERGE VAISMAN AND NASH EQUILIBRIA: TRANS- FORMATION OF GAMES.

More information

All Associated Stirling Numbers are Arithmetical Triangles

All Associated Stirling Numbers are Arithmetical Triangles All Associated Stirling Numbers are Arithmetical Triangles Khaled Ben Letaïef To cite this version: Khaled Ben Letaïef. All Associated Stirling Numbers are Arithmetical Triangles. 2017.

More information

A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications

A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications Alexandre Sedoglavic To cite this version: Alexandre Sedoglavic. A non-commutative algorithm for multiplying (7 7) matrices

More information

RENORMALISATION ON THE PENROSE LATTICE

RENORMALISATION ON THE PENROSE LATTICE RENORMALISATION ON THE PENROSE LATTICE C. Godreche, Henri Orland To cite this version: C. Godreche, Henri Orland. RENORMALISATION ON THE PENROSE LATTICE. Journal de Physique Colloques, 1986, 47 (C3), pp.c3-197-c3-203.

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

Towards an active anechoic room

Towards an active anechoic room Towards an active anechoic room Dominique Habault, Philippe Herzog, Emmanuel Friot, Cédric Pinhède To cite this version: Dominique Habault, Philippe Herzog, Emmanuel Friot, Cédric Pinhède. Towards an active

More information

ON THE UNIQUENESS IN THE 3D NAVIER-STOKES EQUATIONS

ON THE UNIQUENESS IN THE 3D NAVIER-STOKES EQUATIONS ON THE UNIQUENESS IN THE 3D NAVIER-STOKES EQUATIONS Abdelhafid Younsi To cite this version: Abdelhafid Younsi. ON THE UNIQUENESS IN THE 3D NAVIER-STOKES EQUATIONS. 4 pages. 212. HAL Id:

More information

A first step towards the skew duadic codes

A first step towards the skew duadic codes A first step towards the skew duadic codes Delphine Boucher To cite this version: Delphine Boucher. A first step towards the skew duadic codes. 2017. HAL Id: hal-01560025 https://hal.archives-ouvertes.fr/hal-01560025v2

More information

Stickelberger s congruences for absolute norms of relative discriminants

Stickelberger s congruences for absolute norms of relative discriminants Stickelberger s congruences for absolute norms of relative discriminants Georges Gras To cite this version: Georges Gras. Stickelberger s congruences for absolute norms of relative discriminants. Journal

More information

Multiple sensor fault detection in heat exchanger system

Multiple sensor fault detection in heat exchanger system Multiple sensor fault detection in heat exchanger system Abdel Aïtouche, Didier Maquin, Frédéric Busson To cite this version: Abdel Aïtouche, Didier Maquin, Frédéric Busson. Multiple sensor fault detection

More information

Throughout these notes we assume V, W are finite dimensional inner product spaces over C.

Throughout these notes we assume V, W are finite dimensional inner product spaces over C. Math 342 - Linear Algebra II Notes Throughout these notes we assume V, W are finite dimensional inner product spaces over C 1 Upper Triangular Representation Proposition: Let T L(V ) There exists an orthonormal

More information

Finite volume method for nonlinear transmission problems

Finite volume method for nonlinear transmission problems Finite volume method for nonlinear transmission problems Franck Boyer, Florence Hubert To cite this version: Franck Boyer, Florence Hubert. Finite volume method for nonlinear transmission problems. Proceedings

More information

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2 EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko

More information

The sound power output of a monopole source in a cylindrical pipe containing area discontinuities

The sound power output of a monopole source in a cylindrical pipe containing area discontinuities The sound power output of a monopole source in a cylindrical pipe containing area discontinuities Wenbo Duan, Ray Kirby To cite this version: Wenbo Duan, Ray Kirby. The sound power output of a monopole

More information

Impulse response measurement of ultrasonic transducers

Impulse response measurement of ultrasonic transducers Impulse response measurement of ultrasonic transducers F. Kadlec To cite this version: F. Kadlec. Impulse response measurement of ultrasonic transducers. Journal de Physique IV Colloque, 1994, 04 (C5),

More information

Cutwidth and degeneracy of graphs

Cutwidth and degeneracy of graphs Cutwidth and degeneracy of graphs Benoit Kloeckner To cite this version: Benoit Kloeckner. Cutwidth and degeneracy of graphs. IF_PREPUB. 2009. HAL Id: hal-00408210 https://hal.archives-ouvertes.fr/hal-00408210v1

More information

Sparse multivariate factorization by mean of a few bivariate factorizations

Sparse multivariate factorization by mean of a few bivariate factorizations Sparse multivariate factorization by mean of a few bivariate factorizations Bernard Parisse To cite this version: Bernard Parisse. Sparse multivariate factorization by mean of a few bivariate factorizations.

More information

A new multidimensional Schur-Cohn type stability criterion

A new multidimensional Schur-Cohn type stability criterion A new multidimensional Schur-Cohn type stability criterion Ioana Serban, Mohamed Najim To cite this version: Ioana Serban, Mohamed Najim. A new multidimensional Schur-Cohn type stability criterion. American

More information

On Newton-Raphson iteration for multiplicative inverses modulo prime powers

On Newton-Raphson iteration for multiplicative inverses modulo prime powers On Newton-Raphson iteration for multiplicative inverses modulo prime powers Jean-Guillaume Dumas To cite this version: Jean-Guillaume Dumas. On Newton-Raphson iteration for multiplicative inverses modulo

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

Reduced Models (and control) of in-situ decontamination of large water resources

Reduced Models (and control) of in-situ decontamination of large water resources Reduced Models (and control) of in-situ decontamination of large water resources Antoine Rousseau, Alain Rapaport To cite this version: Antoine Rousseau, Alain Rapaport. Reduced Models (and control) of

More information