Vicente Hernandez | Universidad Veracruzana (original) (raw)

Papers by Vicente Hernandez

Linear Algebra and Its Applications, 1989

We study reachability and controllability properties for discrete-time positive periodic systems.... more We study reachability and controllability properties for discrete-time positive periodic systems. The equivalence between N-periodic systems, with n states and m inputs, and invariant systems, with n states and Nm inputs, preserves the positivity of such systems, and in addition, closely relates their reachability cones. This equivalence permits us to show that the complete contrallability (reachability) of a positive N-periodic system is equivalent to the complete contrallability (reachability) of N associated positive invariant systems.

Linear Algebra and Its Applications, 1989

The unique solution of the matrix equation AXB − CXD = E is obtained in explicit form by means of... more The unique solution of the matrix equation AXB − CXD = E is obtained in explicit form by means of the inversion of an n X n or m X m matrix from the coefficients of the Laurent expansions of (λC − A)−1 and (λB − D)−1 and the relative characteristic polynomial of λC − A or λB − D respectively. The case of singular pencils is reduced to the regular one.

System Structure and Control 1992, 1992

Linear Algebra and Its Applications, 2001

In this paper, a method to compute the solution of a system of linear equations by means of Nevil... more In this paper, a method to compute the solution of a system of linear equations by means of Neville elimination is described using two kinds of partitioning techniques: Block and Block-striped. This type of approach is especially suited to the case of totally positive linear systems, which is present in different fields of application. Although Neville elimination carried out more floating point operations than Gaussian elimination in some cases, in this study we confirm that these advantages disappear when we use multiprocessor systems. On the other hand, the overall parallel run time of Neville elimination is better than Gauss time as Neville elimination uses a lower cost communication model.

Linear Algebra and its Applications, 1989

The unique solution of the matrix equation AXB − CXD = E is obtained in explicit form by means of... more The unique solution of the matrix equation AXB − CXD = E is obtained in explicit form by means of the inversion of an n X n or m X m matrix from the coefficients of the Laurent expansions of (λC − A)−1 and (λB − D)−1 and the relative characteristic polynomial of λC − A or λB − D respectively. The case of singular pencils is reduced to the regular one.

Linear Algebra and its Applications, 1989

Linear Algebra and Its Applications, 1989

We study reachability and controllability properties for discrete-time positive periodic systems.... more We study reachability and controllability properties for discrete-time positive periodic systems. The equivalence between N-periodic systems, with n states and m inputs, and invariant systems, with n states and Nm inputs, preserves the positivity of such systems, and in addition, closely relates their reachability cones. This equivalence permits us to show that the complete contrallability (reachability) of a positive N-periodic system is equivalent to the complete contrallability (reachability) of N associated positive invariant systems.

Linear Algebra and Its Applications, 1989

The unique solution of the matrix equation AXB − CXD = E is obtained in explicit form by means of... more The unique solution of the matrix equation AXB − CXD = E is obtained in explicit form by means of the inversion of an n X n or m X m matrix from the coefficients of the Laurent expansions of (λC − A)−1 and (λB − D)−1 and the relative characteristic polynomial of λC − A or λB − D respectively. The case of singular pencils is reduced to the regular one.

System Structure and Control 1992, 1992

Linear Algebra and Its Applications, 2001

In this paper, a method to compute the solution of a system of linear equations by means of Nevil... more In this paper, a method to compute the solution of a system of linear equations by means of Neville elimination is described using two kinds of partitioning techniques: Block and Block-striped. This type of approach is especially suited to the case of totally positive linear systems, which is present in different fields of application. Although Neville elimination carried out more floating point operations than Gaussian elimination in some cases, in this study we confirm that these advantages disappear when we use multiprocessor systems. On the other hand, the overall parallel run time of Neville elimination is better than Gauss time as Neville elimination uses a lower cost communication model.

Linear Algebra and its Applications, 1989

The unique solution of the matrix equation AXB − CXD = E is obtained in explicit form by means of... more The unique solution of the matrix equation AXB − CXD = E is obtained in explicit form by means of the inversion of an n X n or m X m matrix from the coefficients of the Laurent expansions of (λC − A)−1 and (λB − D)−1 and the relative characteristic polynomial of λC − A or λB − D respectively. The case of singular pencils is reduced to the regular one.

Linear Algebra and its Applications, 1989