The article presents the general notions and algorithm about the Gauss-Jordan method. An eloquent example is given and the Turbo C program illustrated this method. We conclude that we can obtain by this method the determinant, by simple calculations and reducing the rounding errors Cuvinte cheie: metoda Gauss-Jordan, matricea inversă, limbaj de programare Turbo C, pivot. 1. Noţiuni generale Met...

Résumé : Nous étudions dans cet article des algorithmes de calcul de la réduction de Hermite d'une matrice a coefficients polynomiaux, qui évitent l'explosion de la taille des objets intermédiaires et ont une bonne complexité séquentielle. Le deuxième et le troisième algorithmes généralisent la méthode des sous-résultants pour le calcul du pgcd de deux polynomes. Le dernier de ces algorithmes s...

We investigate the Zariski closure of the projective equivalence class of a matrix. New results are presented regarding the matrices in this variety and their matroids, and we give equations for the variety. We also discuss the K-polynomial of the closure of a projective equivalence class, and two other geometric invariants that can be obtained from this. Résumé. Nous enquêtons sur l’adhérence ...

Many problems in the theory of sparse approximation require bounds on operator norms of a random submatrix drawn from a fixed matrix. The purpose of this note is to collect estimates for several different norms that are most important in the analysis of `1 minimization algorithms. Several of these bounds have not appeared in detail. Résumé Sur la norme de sous-matrice tirée aléatoirement. Beauc...

Let A be a matrix whose columns X1, . . . , XN are independent random vectors in R. Assume that p-th moments of 〈Xi, a〉, a ∈ Sn−1, i ≤ N , are uniformly bounded. For p > 4 we prove that with high probability A has the Restricted Isometry Property (RIP) provided that Euclidean norms |Xi| are concentrated around √ n and that the covariance matrix is well approximated by the empirical covariance m...

Les propos au sujet de l’œuvre gravé Nathalie Grall soulignent son pouvoir onirique, poétique, ses qualités scripturales. Ici sera pointée la place toute centrale matrice, dans le concret l’expérience l’atelier, sensible aux signes peints comme incisions qu’ils préfigurent. Aussi, l’aval gravure, celle-ci conçue, il arrive régulièrement, depuis début des années 2000, que les possibilités plaque...

It is shown that a nondegenerate square real matrix M is a P-matrix if and only if, whatever is the real vector q, the Newton-min algorithm does not cycle between two points when it is used to solve the linear complementarity problem 0 6 x ⊥ (Mx+ q) > 0. Key-words: Linear complementarity problem, semismooth Newton method, Newton-min algorithm, NM-matrix, P-matricity characterization, P-matrix. ...