Hubert Pickmann

Dr. Hubert Pickmann

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2007 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
HPHubert Pickmann
Hubert Pickmann
JEJuan Egaña
Juan Egaña
RSRicardo L. Soto
Ricardo L. Soto

1 September 2007 in Computers & Mathematics with Applications
Verified
Journal Article
Closed access
HPHubert Pickmann
Hubert Pickmann
RSRicardo L. Soto
Ricardo L. Soto
JEJ. Egaña
J. Egaña
MSMario Salas
Mario Salas

1 May 2020 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
HPHubert Pickmann
Hubert Pickmann
SAS. Arela-Pérez
S. Arela-Pérez
HNHans Nina
Hans Nina
EVElvis Valero
Elvis Valero

1 January 2019 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
HPHubert Pickmann
Hubert Pickmann
SAS Arela-Pérez
S Arela-Pérez
JEJuan Egaña
Juan Egaña
RSRicardo Soto
Ricardo Soto
We consider the following inverse extreme eigenvalue problem: given the real numbers and the real vector x(n) = (x1, x2, …, xn), to construct a nonsymmetric tridiagonal matrix and a nonsymmetric arrow matrix such that are the minimal and the maximal eigenvalues of each one of their leading principal submatrices, and is an eigenpair of the matrix. We give sufficient conditions for the existence of such matrices. Moreover our results generate an algorithmic procedure to compute a unique solution matrix.

22 October 2019 in Proyecciones (Antofagasta)
Verified
Journal Article
Open access
HPHubert Pickmann
Hubert Pickmann
SASusana Arela-Pérez
Susana Arela-Pérez
JAJuan Carlos Egaña Arancibia
Juan Carlos Egaña Arancibia
DODante Carrasco Olivera
Dante Carrasco Olivera
We present a new construction of a symmetric arrow matrix from a particular spectral information: let λ(n) 1 be the minimal eigenvalue of the matrix and λj (j) , j = 1, 2, . . . , n the maximal eigenvalues of all leading principal submatrices of the matrix. We use such a procedure to construct a nonsymmetric arrow matrix from the same spectral information plus to an eigenvector x(n) = (x1, x2, . . . , xn), so that (x(n), λn (n)) is an eigenpair of the matrix. Moreover, our results generate an algorithmic procedure to compute a solution matrix.

1 October 2021 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
SASusana Arela-Pérez
Susana Arela-Pérez
HNHans Nina
Hans Nina
JPJésica Pantáz
Jésica Pantáz
HPHubert Pickmann
Hubert Pickmann
EKElvis Ronald Valero Kari
Elvis Ronald Valero Kari