Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On the characterization of totally nonpositive matrices

  • Cantó Colomina, Rafael|||0000-0002-1341-2800
  • Urbano Salvador, Ana María|||0000-0001-8590-1243
  • Pelaez, María J.
[EN] A nonpositive real matrix $A= (a_{ij})_{1 \leq i, j \leq n}$ is said to be totally nonpositive (negative) if all its minors are nonpositive (negative) and it is abbreviated as t.n.p. (t.n.). In this work a bidiagonal factorization of a nonsingular t.n.p. matrix $A$ is computed and it is stored in an matrix represented by $\mathcal{BD}_{(t.n.p.)}(A)$ when $a_{11}< 0$ (or $\mathcal{BD}_{(zero)}(A)$ when $a_{11}= 0$). As a converse result, an efficient algorithm to know if an matrix $\mathcal{BD}_{(t.n.p.)}(A)$ ($\mathcal{BD}_{(zero)}(A)$) is the bidiagonal factorization of a t.n.p. matrix with $a_{11}<0$ ($a_{11}= 0$) is given. Similar results are obtained for t.n. matrices using the matrix $\mathcal{BD}_{(t.n.)}(A)$, and these characterizations are extended to rectangular t.n.p. (t.n.) matrices. Finally, the bidiagonal factorization of the inverse of a nonsingular t.n.p. (t.n.) matrix $A$ is directly obtained from $\mathcal{BD}_{(t.n.p.)}(A)$ ($\mathcal{BD}_{(t.n.)}(A)$)., This research was supported by the Spanish DGI grant MTM2013-43678-P and by the Chilean program FONDECYT 1100029
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Full rank Cholesky factorization for rank deficient matrices

  • Cantó Colomina, Rafael|||0000-0002-1341-2800
  • Urbano Salvador, Ana María|||0000-0001-8590-1243
  • Peláez, María J.
[EN] Let A be a rank deficient square matrix. We characterize the unique full rank Cholesky factorization LL^T of A where the factor L is a lower echelon matrix with positive leading entries. We compute an extended decomposition for the normal matrix B^TB where B is a rectangular rank deficient matrix. This decomposition is obtained without interchange of rows and without computing all entries of the normal matrix. Algorithms to compute both factorizations are given., This research was supported by the Spanish DGI grant MTM2010-18228 and by the Chilean program FONDECYT 1100029.