Susana Arela-Pérez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Susana Arela-Pérez has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Hubert Pickmann-Soto
Departamento de Matemática, Universidad de Tarapacá, Arica 1000000, Chile
9 shared publications - Hans Nina
Departamento de Matemáticas, Facultad de Ciencias Básicas, Universidad de Antofagasta, Antofagasta 1240000, Chile
6 shared publications - Juan Carlos Egaña Arancibia
Departamento de Matemáticas, Universidad Católica del Norte, Antofagasta, Chile
3 shared publications - Charlie Lozano
Carrera de Matemática, Facultad de Ciencias Puras y Naturales, Universidad Mayor de San Andrés, La Paz 0201, Bolivia
2 shared publications - Dante Carrasco-Olivera
Universidad del Bio-Bio
2 shared publications - Cristina Manzaneda
Departamento de Matemáticas, Facultad de Ciencias, Universidad Católica del Norte, Antofagasta, Chile
1 shared publication
Latest Publications
- Open Access
- 13 October 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (20) , 3717
On a Special Inverse Singular Value Problem for Certain Classes of Hessenberg Matrices
This paper addresses an inverse singular value problem for three classes of upper Hessenberg matrices: Leslie-type, companion, and circular bidiagonal matrices. The problem is to construct such matrices from the prescribed extremal singular values of certain submatrices. A connection with known results on inverse extremal eigenvalue problems for bordered diagonal and periodic Jacobi matrices is established. For all matrices, conditions for the existence and uniqueness of solutions are provided, except for the signs of their entries. In the case of Leslie-type and companion matrices, these conditions are necessary and sufficient. For circular bidiagonal matrices, these conditions are only sufficient, and two admissible auxiliary parameters are required. Furthermore, numerical examples illustrate the proposed constructions.
- 13 October 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (20) , 3717
Open AccessOn a Special Inverse Singular Value Problem for Certain Classes of Hessenberg Matrices
This paper addresses an inverse singular value problem for three classes of upper Hessenberg matrices: Leslie-type, companion, and circular bidiagonal matrices. The problem is to construct such matrices from the prescribed extremal singular values of certain submatrices. A connection with known results on inverse extremal eigenvalue problems for bordered diagonal and periodic Jacobi matrices is established. For all matrices, conditions for the existence and uniqueness of solutions are provided, except for the signs of their entries. In the case of Leslie-type and companion matrices, these conditions are necessary and sufficient. For circular bidiagonal matrices, these conditions are only sufficient, and two admissible auxiliary parameters are required. Furthermore, numerical examples illustrate the proposed constructions.
- Open Access
- 23 February 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (4) , 743
Inverse Extremal Eigenvalue Problems for Multi-Arrowhead Pentadiagonal Matrices
We address the inverse extremal eigenvalue problem (IEEP) for multi-arrowhead pentadiagonal matrices, a structured class that combines pentadiagonal bandwidth with an alternating arrowhead structure. We identify four distinct structural classes based on the orientation and configuration of arrowhead blocks. For symmetric matrices, we establish sufficient conditions for reconstruction from extremal (smallest, largest, or both) eigenvalues of leading principal submatrices. For certain classes, we prove these conditions are also necessary, providing a complete characterization. Nonsymmetric matrices require one additional prescribed eigenvector. Our results are constructive and yield algorithmic procedures. Numerical examples illustrate our theoretical findings. This work generalizes inverse extremal eigenvalue theory for arrowhead matrices to these pentadiagonal structures.
- 23 February 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (4) , 743
Open AccessInverse Extremal Eigenvalue Problems for Multi-Arrowhead Pentadiagonal Matrices
We address the inverse extremal eigenvalue problem (IEEP) for multi-arrowhead pentadiagonal matrices, a structured class that combines pentadiagonal bandwidth with an alternating arrowhead structure. We identify four distinct structural classes based on the orientation and configuration of arrowhead blocks. For symmetric matrices, we establish sufficient conditions for reconstruction from extremal (smallest, largest, or both) eigenvalues of leading principal submatrices. For certain classes, we prove these conditions are also necessary, providing a complete characterization. Nonsymmetric matrices require one additional prescribed eigenvector. Our results are constructive and yield algorithmic procedures. Numerical examples illustrate our theoretical findings. This work generalizes inverse extremal eigenvalue theory for arrowhead matrices to these pentadiagonal structures.
- Open Access
- 22 October 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (21) , 3369
An Inverse Extremal Eigenproblem for Bordered Tridiagonal Matrices Applied to an Inverse Singular Value Problem for Lefkovitch-Type Matrices
This paper focuses on the inverse extremal eigenvalue problem (IEEP) and a special inverse singular value problem (ISVP). First, a bordered tridiagonal matrix is constructed from the extremal eigenvalues of its leading principal submatrices and an eigenvector. Then, based on the previous construction, a Lefkovitch-type matrix is constructed from a particular set of singular values and a singular vector. Sufficient conditions are established for the existence of a symmetric bordered tridiagonal matrix, while the nonsymmetric case is also addressed. Finally, numerical examples illustrating these constructions derived from the main results are presented.
- 22 October 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (21) , 3369
Open AccessAn Inverse Extremal Eigenproblem for Bordered Tridiagonal Matrices Applied to an Inverse Singular Value Problem for Lefkovitch-Type Matrices
This paper focuses on the inverse extremal eigenvalue problem (IEEP) and a special inverse singular value problem (ISVP). First, a bordered tridiagonal matrix is constructed from the extremal eigenvalues of its leading principal submatrices and an eigenvector. Then, based on the previous construction, a Lefkovitch-type matrix is constructed from a particular set of singular values and a singular vector. Sufficient conditions are established for the existence of a symmetric bordered tridiagonal matrix, while the nonsymmetric case is also addressed. Finally, numerical examples illustrating these constructions derived from the main results are presented.
- Open Access
- 12 July 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (14) , 2198
Realization of Extremal Spectral Data by Pentadiagonal Matrices
In this paper, we address the extremal inverse eigenvalue problem for pentadiagonal matrices. We provide sufficient conditions for their existence and realizability through new constructions that consider spectral data of its leading principal submatrices. Finally, we present some examples generated from the algorithmic procedures derived from our results.
- 12 July 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (14) , 2198
Open AccessRealization of Extremal Spectral Data by Pentadiagonal Matrices
In this paper, we address the extremal inverse eigenvalue problem for pentadiagonal matrices. We provide sufficient conditions for their existence and realizability through new constructions that consider spectral data of its leading principal submatrices. Finally, we present some examples generated from the algorithmic procedures derived from our results.
- Open Access
- 24 August 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (17) , 3054
Two Inverse Eigenproblems for Certain Symmetric and Nonsymmetric Pentadiagonal Matrices
In this paper, we give sufficient conditions for the construction of certain symmetric and nonsymmetric pentadiagonal matrices from particular spectral information. The construction of the symmetric pentadiagonal matrix considers the extreme eigenvalues of its leading principal submatrices and a prescribed entry, and the construction of the nonsymmetric pentadiagonal matrix also considers an eigenvector and two prescribed entries.
- 24 August 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (17) , 3054
Open AccessTwo Inverse Eigenproblems for Certain Symmetric and Nonsymmetric Pentadiagonal Matrices
In this paper, we give sufficient conditions for the construction of certain symmetric and nonsymmetric pentadiagonal matrices from particular spectral information. The construction of the symmetric pentadiagonal matrix considers the extreme eigenvalues of its leading principal submatrices and a prescribed entry, and the construction of the nonsymmetric pentadiagonal matrix also considers an eigenvector and two prescribed entries.
- 2 May 2022
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 71 (10) , 1657-1680
Extremal realization spectra by two acyclic matrices whose graphs are caterpillars
This paper studies two inverse eigenvalue problems for two kinds of acyclic matrices whose graphs are caterpillars. The spectral data of the first problem considers the minimal and maximal eigenvalues of all leading principal submatrices of the matrix. The second consists of an extremal eigenvalue of each leading principal submatrix and one eigenpair of the matrix. In the main results, we give sufficient conditions for the existence of such matrices, and their proofs provide algorithmic procedures for their construction. Finally, we present some numerical examples that illustrate the applicability of the solutions obtained.
- 2 May 2022
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 71 (10) , 1657-1680
Extremal realization spectra by two acyclic matrices whose graphs are caterpillars
This paper studies two inverse eigenvalue problems for two kinds of acyclic matrices whose graphs are caterpillars. The spectral data of the first problem considers the minimal and maximal eigenvalues of all leading principal submatrices of the matrix. The second consists of an extremal eigenvalue of each leading principal submatrix and one eigenpair of the matrix. In the main results, we give sufficient conditions for the existence of such matrices, and their proofs provide algorithmic procedures for their construction. Finally, we present some numerical examples that illustrate the applicability of the solutions obtained.
- 1 October 2021
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 626, 152-170
Construction of Lefkovitch and doubly Lefkovitch matrices with maximal eigenvalues and some diagonal elements prescribed
- 1 October 2021
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 626, 152-170
Construction of Lefkovitch and doubly Lefkovitch matrices with maximal eigenvalues and some diagonal elements prescribed
- Open Access
- 1 October 2020
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 39 (5) , 1315-1331
Inverse eigenproblems for real symmetric doubly arrowhead matrices
We consider two inverse eigenproblems for a real symmetric doubly arrowhead matrix An(q) , which consist of constructing An(q) from two special kinds of spectra information. These problems were introduced in [11], where the principal results are sufficient conditions for both problems to have a real solution. In this paper, we improve such conditions, in the sense that one of the given conditions implies the rest. The results are constructive and generate one numerical procedure to construct the solution matrix An(q).
- 1 October 2020
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 39 (5) , 1315-1331
Open AccessInverse eigenproblems for real symmetric doubly arrowhead matrices
We consider two inverse eigenproblems for a real symmetric doubly arrowhead matrix An(q) , which consist of constructing An(q) from two special kinds of spectra information. These problems were introduced in [11], where the principal results are sufficient conditions for both problems to have a real solution. In this paper, we improve such conditions, in the sense that one of the given conditions implies the rest. The results are constructive and generate one numerical procedure to construct the solution matrix An(q).
- Open Access
- 22 October 2019
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 38 (4) , 811-828
On the inverse eigenproblem for symmetric and nonsymmetric arrowhead matrices
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.
- 22 October 2019
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 38 (4) , 811-828
Open AccessOn the inverse eigenproblem for symmetric and nonsymmetric arrowhead matrices
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.