Given a square matrix A, a Brauer's theorem [Brauer A., Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices, Duke Math. J., 1952, 19(1), 75-91] shows how to modify one single eigenvalue ...
Cantó Colomina, Rafael; Moll López, Santiago Emmanuel; Ricarte Benedito, Beatriz; Urbano Salvador, Ana María(Springer-Verlag, 2020-02-13)
[EN] In this paper we present a Silverman-Ho algorithm-based method to obtain a realization of a polynomial matrix. This method provides the final formulation of a minimal realization directly from a full rank factorization ...
Cantó Colomina, Begoña; Cantó Colomina, Rafael; Urbano Salvador, Ana María(Servicio de Publicaciones de la Universidad de Oviedo, 2021-06-18)
[EN] Let A¿Rn×n be an irreducible totally nonnegative matrix (ITN), that is, A is irreducible with all its minors nonnegative. A triple (n,r,p) is called realizable if there exists an ITN matrix A¿Rn×n with rank(A)=r and ...
[EN] Let be an irreducible totally non-negative matrix with rank r and principal rank p, that is, every minor of A is non-negative and p is the size of the largest invertible principal submatrix of A. Using Number Theory, ...
Bru, Rafael; Mas Marí, José; Urbano Salvador, Ana María(Society for Industrial and Applied Mathematics, 1994)
[EN] B. N. Datta and K. Datta have proposed an efficient parallel algorithm for the single-input pole
assignment problem when the spectrum set to be assigned is pairwise distinct and disjoint from the spectrum
of the ...
[ES] Se dice que una matriz es totalmente positiva (se denota por TP) si el determinante de cada una de sus submatrices cuadradas es mayor o igual que cero, y es estrictamente totalmente positiva (denotada por STP) si todos ...
La finalidad de esta comunicación es presentar nuestro trabajo a la comunidad universitaria. Nuestra línea de investigación general se basa en estudiar la teoría matemática de los sistemas de control, concretamente en ...
[EN] The relationship among eigenvalues of a given square matrix A and the rank one updated matrix A+vkq⁎, where vk is an eigenvector of A associated with the eigenvalue λk and q is an arbitrary vector, was described ...
Cantó Colomina, Rafael; Peláez, María J.; Urbano Salvador, Ana María(Elsevier, 2015-02)
[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 ...
Let A = (a(ij)) is an element of R-nxm be a totally nonpositive matrix with rank(A) = r <= min{n, m} and a(11) = 0. In this paper we obtain a characterization in terms of the full rank factorization in quasi-LDU form, that ...
In this work a technique to improve the condition number si of a simple eigenvalue lambda(i) of a matrix A is an element of C-nxn is given. This technique obtains a rank one updated matrix that is similar to A with the ...
[EN] Let A be an irreducible totally nonnegative matrix with rank r and principal rank p, that is, all minors of A are nonnegative, r is the size of the largest invertible square submatrix of A and p is the size of its ...
[EN] Let A be an nxn irreducible totally nonnegative matrix with rank r and principal rank p, that is, A is irreducible with all minors nonnegative, r is the size of the largest invertible square submatrix of A and p is ...
The main objective of this work is to model the dynamics of cynegetic populations by means of a linear control system. We want to estimate the annual corrective measures, which may be improvements or hunting, that must be ...
Cantó Colomina, Rafael; Pelaez, María J.; Urbano Salvador, Ana María(Springer, 2016-12)
[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 ...
Cantó Colomina, Rafael; Urbano Salvador, Ana María(Elsevier, 2018-08-15)
[EN] Let A is an element of R-nxn be a totally nonnegative matrix with principal rank p, that is, every minor of A is nonnegative and p is the size of the largest invertible principal submatrix of A. We introduce the ...
[EN] Let A is an element of R-nxn be a totally nonpositive matrix (t.n.p.) with rank r and principal rank p, that is, every minor of A is nonpositive and p is the size of the largest invertible principal submatrix of A. ...
Let A = (a(ij)) is an element of R-nxn be a nonsingular totally nonpositive matrix. In this paper we describe some properties of these matrices when a(11) = 0 and obtain a characterization in terms of the quasi-LDU ...
Cantó Colomina, Begoña; Cantó Colomina, Rafael; Urbano Salvador, Ana María(Universitat Politècnica de València, 2019-06-19)
[ES] En este trabajo presentamos las competencias matemáticas reflejadas en el
Programa Internacional de Evaluación de Estudiantes (PISA) de la Organización para la Cooperación y Desarrollo Económico (OCDE). El objetivo ...
[ES] En este trabajo presentamos un procedimiento para construir un tipo de matrices
llamadas totalmente no positivas, estudiar sus propiedades y obtener las relaciones que
tienen con otra clase de matrices llamadas ...