Skip to main content

RED TEMATICA DE ALGEBRA LINEAL, ANALISIS MATRICIAL Y APLICACIONES

RED2022-134176-T

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Redes Investigación /Redes Excelencia
Call year 2022
State Plan 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DE ZARAGOZA

Resultados relacionados

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

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

Characterizations of core-EP matrices with applications to singular equations

  • Kheirandish, Ehsan
  • Salemi, Abbas
  • Thome, Néstor|||0000-0001-5328-6637
[EN] A square complex matrix A is referred to as core-EP if A¿Ac = Ac A¿, where Ac denotes the core-part of A, and A¿ represents the Moore-Penrose inverse of A. In this paper, some equivalent conditions of core-EP matrices are investigated. Also, characterizations of DMPinverses, MPD-inverses, andCMP-inverses are given. Finally, applications in solving singular linear systems arising from a discretization of a PDE are studied., The authors would like to thank anonymous referees for the careful reading and helpful comments to improve this paper. The third author was partially supported by Universidad Nacional de Río Cuarto, Argentina (Grant Resol.: 449/2024), Universidad Nacional de La Pampa, Facultad de Ingeniería, Argentina (Grant Resol.: 172/2024), Ministerio de Ciencia e Innovación of Spain (Grant RED2022-134176-T), and Universidad Nacional del Sur, Argentina (Grant Resol.: PGI 24/ZL22).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Some results on core EP Drazin matrices and partial isometries

  • Aghamollaei, Gholamreza
  • Mortezaei, Mahdiyeh
  • Mosic, Dijana
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this paper, by using the core EP inverse and the Drazin inverse which are two well known generalized inverses, a new class of matrices entitled core EP Drazin matrices (shortly, matrices) is introduced. This class contains the set of all EP matrices and also the set of normal matrices. Some algebraic properties of these matrices are also investigated. Moreover, some results about the Drazin inverse and the core EP inverse of partial isometries are derived, and using them, some conditions for which partial isometries are CEPD, are obtained. To illustrate the main results, some numerical examples are given., The third author is supported by the Ministry of Education, Science and Technological Development, Republic of Serbia [grant number 451-03-65/2024-03/200124]. The fourth author was partially supported by Ministerio de Ciencia e Innovación of Spain [grant RED2022-134176-T], by Universidad Nacional de La Pampa, Facultad de Ingeniería, Argentina [grant number Resol. Nro. 172/2024], by Universidad Nacional de Río Cuarto, Argentina [grant number 449/2024] and also by Universidad Nacional del Sur, Argentina [grant number 24/ZL22].
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Lattice properties of the sharp partial order and other related partial orders for matrices

  • Cimadamore, Cecilia
  • Rueda, Laura Alicia
  • Verdecchia, Melina
  • Thome, Néstor|||0000-0001-5328-6637
[EN] The aim of this paper is to study lattice properties of the sharp partial order for complex matrices having index at most 1. We investigate the down-set of a fixed matrix B under this partial order via isomorphisms with two different partially ordered sets of projectors. These are the set of projectors that commute with a certain (nonsingular) block of a HartwigSpindelböck decomposition of B and the set of projectors that commute with the Jordan canonical form of that block. Using these isomorphisms, we study the lattice structure of the down-sets and we give properties of them. Necessary and sufficient conditions under which the down-set of B is a lattice were found, in which case we describe its elements completely. We also show that every down-set of B has a distinguished Boolean subalgebra and we give a description of its elements. We characterize the matrices that are above a given matrix in terms of its Jordan canonical form. Mitra (1987) showed that the set of all n × n complex matrices having index at most 1 when n ¿ 4 is not a lower semilattice. We extend this result to n = 3 and prove that it is a lower semilattice when n = 2. We also answer negatively a conjecture given by Mitra, Bhimasankaram and Malik (2010). As a last application, we characterize solutions of some matrix equations via the established isomorphisms., The authors were partially supported by projects PGI 24/L128 and PGI 24/ZL22, Departamento de Matemática, Universidad Nacional del Sur (UNS), Argentina. The third author was partially supported by Ministerio de Ciencia, Innovación y Universidades of Spain (Grant REDES DE INVESTIGACIÓN, MICINNRED2022-134176-T), by Universidad Nacional de Río Cuarto (Grant Resol. RR 449/2024) and Universidad Nacional de La Pampa (Grant Resol. 172/2024).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Additive properties and absorption laws for generalized inverses

  • Zhou, Yukun
  • Chen, Jianlong
  • Thome, Néstor|||0000-0001-5328-6637
[EN] Let a, f be elements in a ring with pseudo core inverses a^⊕D and f^⊕D, and let b = f − a. We prove that the absorption law a^⊕D(a+f)f^⊕D = a^⊕D + f^⊕D holds if and only if 1 + a^⊕D·b is invertible and the additive property f^⊕D = (1 + a^⊕D·b)^(−1)·a^⊕D is satisfied. We further characterize these properties and establish analogous results for other generalized inverses. Finally, we apply these results to the case of complex matrices., The first and second authors are supported by the National Natural Science Foundation of China (Grant No. 12171083). The third author has been partially supported by Universidad Nacional de La Pampa (Grant Resol. 172/2024), by Grant PGI 24/ZL22, Departamento de Matematica, Universidad Nacional del Sur (UNS), Argentina; by Ministerio de Ciencia, Innovacion y Universidades of Spain (Grant Redes de Investigacion, MICINN-RED2022-134176-T), and by Universidad Nacional de Rio Cuarto (Grant Resol. RR 449/2024).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Dual core-EP generalized inverse and a new decomposition

  • Sitha, Bibekananda
  • Sahoo, Jajati Keshari
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this work, we introduce a new type of generalized inverse called dual core-EP generalized inverse (in short, DCEPGI) for dual square matrices. We analyse the existence and uniqueness of the DCEPGI inverse and its compact formula using dual Drazin and dual MP inverse. Moreover, some characterizations using core-EP decomposition are obtained. We present a new dual matrix decomposition named the dual core-EP decomposition for square dual matrices. In addition, some relationships with other dual generalized inverses are established. As an application, solutions to system of linear dual equations are derived., The first author was supported by the Department of Atomic Energy (DAE) Plan Project RIN 4001 (NISER), India. The third author expresses his gratitude for the support received from the Universidad Nacional de La Pampa, Facultad de Ingenieria, Argentina (Grant Resol. Nro. 172/2024), Universidad Nacional del Sur, Argentina (Grant PGI 24/ZL22), Universidad Nacional del Rio Cuarto, Argentina (Grant Resol. RR 449/2024), and Ministerio de Ciencia e Innovacion, Spain (Grant Red de Excelencia RED2022-134176-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Simultaneous extension of generalized BT- inverses and core-EP inverses

  • Kara, Abdessalam
  • Djordjevic, Dragan S.
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this paper we introduce the generalized inverse of complex square matrix with respect to other matrix having same size. Some of its representations, properties and characterizations are obtained. Also some new representation matrices of W-weighted BT-inverse and W-weighted core-EP inverse are determined as well as characterizations of generalized inverses A (dagger O,) A (dagger O,W), A(& diam;), A(& diam;,W)., The second author has been partially supported by Universidad Nacional de La Pampa, Facultad de Ingenieria (Grant Resol. Nro. 135/19), Universidad Nacional del Sur, Argentina (Grant Resol. PGI 24/ZL22) and Ministerio de Economia, Industria y Competitividad (Spain) [Grant Red de Excelencia RED2022134176-T] and Universidad Nacional de Rio Cuarto, Argentina (Grant Resol. RR 449/2024).The third author is supported by the Ministry of Science, Technological Development and Innovation of the Republic of Serbia, grant no. 451-03-65/2024-03/200124, and the project Linear operators: invertibility, spectra and operator equations, no. O-30-22 under the Branch of SANU in Nis.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Bounds for the change of the Weyr characteristic of matrix pencils after 1-rank perturbations

  • Baragaña, Itziar
  • Roca Martinez, Alicia|||0000-0003-1926-1895
[EN] The characterization of the Kronecker structure of a matrix pencil perturbed by another pencil of rank one is known, and it is stated in terms of very involved conditions. This paper is devoted to, losing accuracy, better understand the meaning of those conditions. The Kronecker structure of a pencil is determined by the sequences of the column and row minimal indices and of the partial multiplicities of the eigenvalues. We introduce the Weyr characteristic of a pencil as the collection of the conjugate partitions of the previous sequences and provide bounds for the change of each one of the Weyr partitions after perturbation. The resulting bounds are expressed in terms of the corresponding component of the unperturbed pencil. To verify that the bounds are reachable, we characterize the Weyr characteristic of a pencil obtained from another one by removing or adding one row. The results hold for algebraically closed fields., This work was supported by the Agencia Estatal de Investigación of Spain MCIN/AEI/10.13039/50 1100011033/ and by ERDF A way of making Europe of the European Union under grants PID2021- 124827NB-I00 and RED2022-134176-T.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Row completion of polynomial and rational matrices

  • Amparan, Agurtzane
  • Baragaña, Itziar
  • Marcaida, Silvia
  • Roca Martinez, Alicia|||0000-0003-1926-1895
[EN] We characterize the existence of a polynomial (rational) matrix when its eigenstructure (complete structural data) and some of its rows are prescribed. For polynomial matrices, this problem was solved in [1] when the polynomial matrix has the same degree as the prescribed submatrix. In that paper, the following row completion problems were also solved arising when the eigenstructure was partially prescribed, keeping the restriction on the degree: the eigenstructure but the row (column) minimal indices, and the finite and/or infinite structures. Here we remove the restriction on the degree, allowing it to be greater than or equal to that of the submatrix. We also generalize the results to rational matrices. Obviously, the results obtained hold for the corresponding column completion problems., This work was supported by grants PID2021-124827NB-I00 and RED2022-134176-T funded by MCIN/AEI/10.13039/501100011033 and by ``ERDF A way of making Europe'' by the European Union. The first and third authors were also supported by grant GIU21/020 funded by UPV/EHU.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Applications of singular entropy to signals and singular smoothness to images

  • Romero Martínez, José Oscar|||0000-0003-4081-9005
  • Thome, Néstor|||0000-0001-5328-6637
[EN] This paper explores signal and image analysis by using the Singular Value Decomposition (SVD) and its extension, the Generalized Singular Value Decomposition (GSVD). A key strength of SVD lies in its ability to separate information into orthogonal subspaces. While SVD is a well-established tool in ECG analysis, particularly for source separation, this work proposes a refined method for selecting a threshold to distinguish between maternal and fetal components more effectively. In the first part of the paper, the focus is on medical signal analysis, where the concepts of Energy Gap Variation (EGV) and Singular Energy are introduced to isolate fetal and maternal ECG signals, improving the known ones. Furthermore, the approach is significantly enhanced by the application of GSVD, which provides additional discriminative power for more accurate signal separation. The second part introduces a novel technique called Singular Smoothness, developed for image analysis. This method incorporates Singular Entropy and the Frobenius norm to evaluate information density, and is applied to the detection of natural anomalies such as mountain fractures and burned forest regions. Numerical experiments are presented to demonstrate the effectiveness of the proposed approaches., Research supported by Universidad Nacional de La Pampa (Grant Resol. 172/2024); by Grant PGI 24/ZL22, Departamento de Matematica, Universidad Nacional del Sur (UNS), Argentina; and by Ministerio de Ciencia, Innovacion y Universidades of Spain ¿ (Grant Redes de Investigacion, MICINN-RED2022-134176-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Inverse problems of polynomial and rational matrices involving the eigenstructure and data of the column and row spaces

  • Baragaña, Itziar
  • Dopico, Froilán M.
  • Marcaida, Silvia
  • Roca Martinez, Alicia|||0000-0003-1926-1895
[EN] The eigenstructure of a rational matrix is comprised by its invariant rational functions, both finite and at infinity, and by the minimal indices of its left and right null spaces. These quantities arise in many applications and have been thoroughly studied in numerous references. There are two other fundamental subspaces of rational matrices that, in contrast, have receivedmuch less attention: the column and row spaces. They also have their associated minimal indices, which play a key role in the problem of factorizing polynomial matrices into low-degree factors. This work solves the problems of finding necessary and sufficient conditions for the existence of rational matrices in two scenarios: when the invariant rational functions and the minimal bases or minimal indices of the column and row spaces are prescribed, and when the eigenstructure together with the minimal indices of the column and row spaces are prescribed. The particular, but extremely important, cases of these problems for polynomialmatrices are solved first and are the main tool for solving the general problems. The results in this work complete and nontrivially extend the necessary and sufficient conditions recently obtained for the existence of polynomial and rational matrices when only the eigenstructure is prescribed., Agencia Estatal de Investigación of Spain MCIN/AEI/10.13039/501100011033/; European Regional Development Fund, Grant/Award Numbers: PID2021-124827NB-I00, PID2023-147366NB-I00, RED2022-134176-T; Eusko Jaurlaritza, Grant/Award Number: IT2072-26.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

The core-EP inverse: A numerical approach for its acute perturbation

  • Zhou, Mengmeng
  • Chen, Jianlong
  • Thome, Néstor|||0000-0001-5328-6637
[EN] This paper studies the concept of stable perturbation B E Cnxn for the core-EP inverse of a matrix A E Cnxn with index k. For a given stable perturbation B of A, explicit expressions of its core-EP inverse B and its projection at zero are presented. Then, the perturbation bounds of B-A/A and B-A are given provided that B is a stable perturbation of A. In addition, we investigate the concept of acute perturbation of A. We give a perturbation analysis with respect to core-EP inverses. We provide a condition under which the acute perturbation coincides with the stable perturbation for core-EP inverses., This research is supported by the National Natural Science Foundation of China (No. 12101315, 12101539, 12171083), the China Scholarship Council (File No. 201906090122), Natural Science Foundation of Jiangsu Higher Education Institutions of China (21KJB110004), the Qing Lan Project of Jiangsu Province. The third author is partially supported by Ministerio de Economia, Industria y Competitividad of Spain (Grant Red de Excelencia RED2022-134176-T), partially supported by Universidad de Buenos Aires, Argentina (EXP-UBA: 13.019/2017, 20020170100350BA), and partially supported by Universidad Nacional de La Pampa, Argentina, Facultad de Ingenieria (Resolucion delCD No 135/19); Universidad Nacional de Rio Cuarto[Grant PPI 18/C559]; Universidad Nacional del Sur[Grant PGI 24/L108].
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On diamond partial order, one-sided star partial orders, and 1MP-inverses

  • Hernández, M. V.
  • Lattanzi, M. B.
  • Thome, Néstor|||0000-0001-5328-6637
[EN] This paper provides some new characterizations of the diamond partial order for rectangular matrices by using properties of inner inverses, minus order, and SVD decompositions. In addition, the recently introduced 1MP generalized inverse and its dual are used to characterize the diamond partial order as a G-based one. Finally, the one-sided star partial order is investigated by using 1MP- and MP1-inverses., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Improving performance of contour integral-based nonlinear eigensolvers with infinite GMRES

  • Liu, Yuqi
  • Shao, Meiyue
  • Jose E. Roman|||0000-0003-1144-6772
[EN] In this work, the infinite GMRES algorithm, recently proposed by [Jarlebring and Correnty, SIAM J. Matrix Anal. Appl., 43 (2022), pp. 1382--1405] is employed in contour integralbased nonlinear eigensolvers, avoiding the computation of costly factorizations at each quadrature node to solve the linear systems efficiently. Several techniques are applied to make the infinite GMRES memory-friendly, computationally efficient, and numerically stable in practice. More specifically, we analyze the relationship between polynomial eigenvalue problems and their scaled linearizations, and provide a novel weighting strategy which can significantly accelerate the convergence of infinite GMRES in this particular context. We also adopt the technique of TOAR to infinite GMRES to reduce the memory footprint. Theoretical analysis and numerical experiments are provided to illustrate the efficiency of the proposed algorithm., Funding: The first and third authors were partly supported by the National Natural Science Foundation of China under grant 92370105. The second author was supported by grant PID2022139568NB-I00 funded by MCIN/AEI/10.13039/501100011033 and by ERDF/EU, and by grant RED2022-134176-T.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Extending EP matrices by means of recent generalized inverses

  • Ferreyra, D. E.
  • Levis, F. E.
  • Priori, A. N.
  • Thome, Néstor|||0000-0001-5328-6637
[EN] It is well known that a square complex matrix is called EP if it commutes with its Moore¿Penrose inverse. In this paper, new classes of matrices which extend this concept are characterized. For that, we consider commutative equalities given by matrices of arbitrary index and generalized inverses recently investigated in the literature. More specifically, these classes are characterized by expressions of type AmX = XAm, where X is an outer inverse of a given complex square matrix A and m is an arbitrary positive integer. The relationships between the different classes of matrices are also analyzed. Finally, a picture presents an overview of the overall studied classes., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work was supported by the Universidad Nacional de Rio Cuarto (UNRC) under Grant 18/C614-2; Universidad Nacional de La Pampa (UNLPam), Facultad de Ingenieria under Grant Resol. Nro. 135/19; Universidad Nacional de Rio Cuarto, Grant PPI 18/C634; Consejo Nacional de Investigaciones Cientificas y Tecnicas (CONICET) under Grant PIP PIBAA 28720210100658CO; and Ministerio de Ciencia, Innovacion y Universidades of Spain (MICINN) under Grant RED2022-134176-T.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Row or column completion of polynomial matrices of given degree II

  • Amparan, Agurtzane
  • Baragaña, Itziar
  • Marcaida, Silvia
  • Roca Martinez, Alicia|||0000-0003-1926-1895
[EN] The row (column) completion problem of polynomial matrices of given degree with prescribed eigenstructure has been studied in [1], where several results of prescription of some of the four types of invariants that form the eigenstructure have also been obtained. In this paper we conclude the study, solving the completion for the cases not covered there. More precisely, we solve the row completion problem of a polynomial matrix when we prescribe the infinite (finite) structure and column and/or row minimal indices, and finally the column and/or row minimal indices. The necessity of the characterizations obtained holds to be true over arbitrary fields in all cases, whilst to prove the sufficiency it is required, in some of the cases, to work over algebraically closed fields., This work was supported by grants PID2021-124827NB-I00 and RED2022-134176-T funded by MCIN/AEI/10.13039/501100011033 and by ``ERDF A way of making Europe'' by the European Union. The first and third authors were also supported by grant GIU21/020 funded by UPV/EHU.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

G-Drazin inverse combined with inner inverse

  • Maharana, G.
  • Sahoo, J. K.
  • Thome, Néstor|||0000-0001-5328-6637
[EN] This article introduces new classes of generalized inverses for square matrices named GD1, and the dual, called 1GD inverse. In addition, we discuss a few characterizations and representations of these inverses. The explicit expressions of these inverses have been established via core-nilpotent decomposition. Further, we introduce a binary relation for GD1 inverse and 1GD inverse, along with a few derived properties., The second author is partially supported by the Science & Engineering Research Board (SERB),Govt. of India [grant ID SUR/2022/004357]. The third author was partially supported by the Universidad Nacional de Rio Cuarto [grant PPI 18/C559], Universidad Nacional de La Pampa, Facultadde Ingenieria [grant resol. nro. 135/19], Universidad Nacional del Sur [grant PGI 24/L108], and Ministerio de Economia, Industria y Competitividad (Spain) [grant red de excelencia RED2022-134176-T].
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

PHIDE: A Parallel Hybrid Direct-Iterative Eigensolver for Hermitian Eigenvalue Problems

  • Li, Shengguo
  • Wu, Xinzhe
  • Yuan, Ziyang
  • Wang, Ruibo
  • Li, Tiejun
  • Xie, Yi
  • Yang, Bo
  • Chen, Xuguang
  • Jose E. Roman|||0000-0003-1144-6772
[EN] In this paper, we propose a Parallel Hybrid Direct-Iterative Eigensolver for Hermitian Eigenvalue Problems without tridiagonalization, denoted by PHIDE, which combines direct and iterative methods. PHIDE first reduces a Hermitian matrix to banded form, then applies a spectrum slicing algorithm to the banded matrix, and finally computes the eigenvectors of the original matrix via backtransformation. Compared with conventional direct eigensolvers, PHIDE avoids tridiagonalization, which involves many memory-bound operations. In PHIDE, the banded eigenvalue problem is solved using the contour integral method implemented in FEAST, which may yield slightly lower accuracy than tridiagonalization-based approaches. For sequences of correlated Hermitian eigenvalue problems arising in density functional theory (DFT), PHIDE achieves an average speedup of 1.22x over the state-of-the-art direct solver in ELPA when using 1024 processes. Numerical experiments are conducted on dense Hermitian matrices from real applications as well as large sparse matrices from the SuiteSparse and ELSES collections., This work was supported in part by National Key R&D Program of China under Grant 2023YFB3001700, in part by National NaturalScience Foundation of China under Grant U1611261, Grant 61872392, andGrant U1811461. The work of J. E. Roman was supported in part by MICIU/AEI/10.13039/501100011033 under Grant PID2022-139568NB-I00, andin part by ERDF/EU under Grant RED2022-134176-T.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Parametrizing W-weighted BT inverse to obtain the W-weighted q-BT inverse

  • Ferreyra, D. E.
  • Torigino, C.
  • Thome, Néstor|||0000-0001-5328-6637
[EN] The core-EP and BT inverses for rectangular matrices were studied recently in the literature. The main aim of this paper is to unify both concepts by means of a new kind of generalized inverse called W-weighted q-BT inverse. We analyze its existence and uniqueness by considering an adequate matrix system. Basic properties and some interesting characterizations are proved for this new weighted generalized inverse. Also, we give a canonical form of the W-weighted q-BT inverse by means of the weighted core-EP decomposition., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. The first and third author are partially supported by Universidad Nacional de Río Cuarto (Grant PPI 18/C559) and CONICET (Grant PIBAA 28720210100658CO). The second author was partially supported by Universidad Nacional de La Pampa, Facultad de Ingeniería (Grant Resol. Nro. 135/19) and Ministerio de Economía, Industria y Competitividad (Spain) [Grant Red de Excelencia RED2022-134176-T].
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Properties of core-EP matrices and binary relationships

  • Kheirandish, Ehsan
  • Salemi, Abbas
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this paper, various properties of core-EP matrices are investigated. We introduce the MPDMP matrix associated with A and by means of it, some properties and equivalent conditions of core-EP matrices can be obtained. Also, properties of MPD, DMP, and CMP inverses are studied and we prove that in the class of core-EP matrices, DMP, MPD, and Drazin inverses are the same. Moreover, DMP and MPD binary relation orders are introduced and the relationship between these orders and other binary relation orders are considered., The third author was partially supported by Universidad Nacional de La Pampa (Argentina) Facultad de Ingenieria [Grant Resol. Nro. 135/19] and Ministerio de Ciencia, Innovacion y Universidades (Spain) [Grant Redes de Investigacion, MICINN-RED2022-134176-T].
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Procrustes problem for the inverse eigenvalue problem of normal (skew) J-Hamiltonian matrices and normal J-symplectic matrices

  • Gigola, S.
  • Lebtahi, L.
  • Thome, Néstor|||0000-0001-5328-6637
[EN] A square complex matrix A is called (skew) J-Hamiltonian if AJ is (skew) Hermitian where J is a real normal matrix such that J2 = ¿I, where I is the identity matrix. In this paper, we solve the Procrustes problem tofind normal (skew)J-Hamiltonian solutionsfor the inverse eigenvalue problem. In addition, a similar problem is investigated for normal J-symplectic matrices., The first and third authors were partially supported by Universidad de Buenos Aires, Argentina (EXP-UBA: 13.019/2017, 20020170100350BA). The third author is partially supported by Ministeriode Ciencia e Innovacion of Spain (Grant Red de Excelencia RED2022-134176-T).
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accurate and fast computations with Green matrices

  • Delgado, Jorge
  • Peña, Guillermo
  • Peña, Juan Manuel
This paper provides a linear time complexity method to obtain the bidiagonal decomposition of Green matrices with high relative accuracy. In addition, when the Green matrix is nonsingular and totally positive, this bidiagonal decomposition can be used to compute the eigenvalues, the inverse and the solution of some linear system of equations with high relative accuracy. A numerical example illustrates the advantages of this method.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

A new class of trigonometric B-Spline Curves

  • Albrecht, Gudrun
  • Mainar, Esmeralda
  • Peña, Juan Manuel
  • Rubio, Beatriz
We construct one-frequency trigonometric spline curves with a de Boor-like algorithm for evaluation and analyze their shape-preserving properties. The convergence to quadratic B-spline curves is also analyzed. A fundamental tool is the concept of the normalized B-basis, which has optimal shape-preserving properties and good symmetric properties.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Green Matrices, Minors and Hadamard Products

  • Delgado, Jorge
  • Peña, Guillermo
  • Peña, Juan Manuel
Green matrices are interpreted as discrete version of Green functions and are used when working with inhomogeneous linear system of differential equations. This paper discusses accurate algebraic computations using a recent procedure to achieve an important factorization of these matrices with high relative accuracy and using alternative accurate methods. An algorithm to compute any minor of a Green matrix with high relative accuracy is also presented. The bidiagonal decomposition of the Hadamard product of Green matrices is obtained. Illustrative numerical examples are included.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Total positivity and accurate computations with Gram matrices of Said-Ball bases

  • Mainar, E.
  • Peña, J.M.
  • Rubio, B.
In this article, it is proved that Gram matrices of totally positive bases of the space of polynomials of a given degree on a compact interval are totally positive. Conditions to guarantee computations to high relative accuracy with those matrices are also obtained. Furthermore, a fast and accurate algorithm to compute the bidiagonal factorization of Gram matrices of the Said-Ball bases is obtained and used to compute to high relative accuracy their singular values and inverses, as well as the solution of some linear systems associated with these matrices. Numerical examples are included.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Polynomial Total Positivity and High Relative Accuracy Through Schur Polynomials

  • Díaz, P.
  • Mainar, E.
  • Rubio, B.
In this paper, Schur polynomials are used to provide a bidiagonal decomposition of polynomial collocation matrices. The symmetry of Schur polynomials is exploited to analyze the total positivity on some unbounded intervals of a relevant class of polynomial bases. The proposed factorization is used to achieve relative errors of the order of the unit round-off when solving algebraic problems involving the collocation matrix of relevant polynomial bases, such as the Hermite basis. The numerical experimentation illustrates the accurate results obtained when using the findings of the paper.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

On the stability of the representation of finite rank operators

  • Carnicer, J.M.
  • Mainar, E.
  • Peña, J.M.
The stability of the representation of finite rank operators in terms of a basis is analyzed. A conditioning is introduced as a measure of the stability properties. This conditioning improves some other conditionings because it is closer to the Lebesgue function. Improved bounds for the conditioning of the Fourier sums with respect to an orthogonal basis are obtained, in particular, for Legendre, Chebyshev, and disk polynomials. The Lagrange and Newton formulae for the interpolating polynomial are also considered.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

High relative accuracy through Newton bases

  • Mainar, E.
  • Peña, J.M.
  • Rubio, B.
Bidiagonal factorizations for the change of basis matrices between monomial and Newton polynomial bases are obtained. The total positivity of these matrices is characterized in terms of the sign of the nodes of the Newton bases. It is shown that computations to high relative accuracy for algebraic problems related to these matrices can be achieved whenever the nodes have the same sign. Stirling matrices can be considered particular cases of these matrices, and then computations to high relative accuracy for collocation and Wronskian matrices of Touchard polynomial bases can be obtained. The performed numerical experimentation confirms the accurate solutions obtained when solving algebraic problems using the proposed factorizations, for instance, for the calculation of their eigenvalues, singular values, and inverses, as well as the solution of some linear systems of equations associated with these matrices.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

A Shape Preserving Class of Two-Frequency Trigonometric B-Spline Curves

  • Albrecht, Gudrun
  • Mainar, Esmeralda
  • Peña, Juan Manuel
  • Rubio, Beatriz
This paper proposes a new approach to define two frequency trigonometric spline curves with interesting shape preserving properties. This construction requires the normalized B-basis of the space U4(Iα)=span{1,cost,sint,cos2t,sin2t} defined on compact intervals Iα=[0,α], where α is a global shape parameter. It will be shown that the normalized B-basis can be regarded as the equivalent in the trigonometric space U4(Iα) to the Bernstein polynomial basis and shares its well-known symmetry properties. In fact, the normalized B-basis functions converge to the Bernstein polynomials as α→0. As a consequence, the convergence of the obtained piecewise trigonometric curves to uniform quartic B-Spline curves will be also shown. The proposed trigonometric spline curves can be used for CAM design, trajectory-generation, data fitting on the sphere and even to define new algebraic-trigonometric Pythagorean-Hodograph curves and their piecewise counterparts allowing the resolution of C(3 Hermite interpolation problems.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Total positivity and high relative accuracy for several classes of Hankel matrices

  • Mainar, E.
  • Peña, J. M.
  • Rubio, B.
Gramian matrices with respect to inner products defined for Hilbert spaces supported on bounded and unbounded intervals are represented through a bidiagonal factorization. It is proved that the considered matrices are strictly totally positive Hankel matrices and their catalecticant determinants are also calculated. Using the proposed representation, the numerical resolution of linear algebra problems with these matrices can be achieved to high relative accuracy. Numerical experiments are provided, and they illustrate the excellent results obtained when applying the theoretical results.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

High relative accuracy for rational q-Bernstein–Vandermonde matrices

  • Delgado, Jorge
  • Orera, Héctor
  • Peña, J.M.
In this article, an accurate and efficient method to compute the eigenvalues, singular values and inverses of nonsingular totally positive rational q-Bernstein–Vandermonde matrices and the solution of some associated linear systems of equations is provided. The method is based on the representation of a totally positive matrix in terms of its bidiagonal decomposition and the use of a library of accurate functions designed for this class of matrices. © 2024 Informa UK Limited, trading as Taylor & Francis Group.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accurate computations with block checkerboard pattern matrices

  • Delgado, Jorge
  • Orera, Héctor
  • Peña, J. M.
In this work, block checkerboard sign pattern matrices are introduced and analyzed. They satisfy the generalized Perron–Frobenius theorem. We study the case related to total positive matrices in order to guarantee bidiagonal decompositions and some linear algebra computations with high relative accuracy. A result on intervals of checkerboard matrices is included. Some numerical examples illustrate the theoretical results.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Bidiagonal Factorizations of Filbert and Lilbert Matrices

  • Khiar, Yasmina
  • Mainar, Esmeralda
  • Peña, Juan Manuel
  • Royo-Amondarain, Eduardo
  • Rubio, Beatriz
Extensions of Filbert and Lilbert matrices are addressed in this work. They are reciprocal Hankel matrices based on Fibonacci and Lucas numbers, respectively, and both are related to Hilbert matrices. The Neville elimination is applied to provide explicit expressions for their bidiagonal factorization. As a byproduct, formulae for the determinants of these matrices are obtained. Finally, numerical experiments show that several algebraic problems involving these matrices can be solved with outstanding accuracy, in contrast with traditional approaches.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

An Optimal Property of B-Bases for the Modified Richardson Method

  • Peña, Juan Manuel
A space with a normalized totally positive basis has a unique normalized B-basis. In computer-aided geometric design, normalized B-bases present optimal shape-preserving properties. More optimal properties of normalized B-bases were proved previously. This paper provides a new optimal property concerning the modified Richardson iterative method when applied to collocation matrices of normalized B-bases. Moreover, a similar optimal property is proved for the tensor product of normalized B-bases.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Optimal properties related to Total Positivity and Wronskian matrices

  • Peña, J. M.
B-bases are totally positive bases satisfying several optimal properties. In this paper we prove a new optimal property of B-bases related to the conditioning of their Wronskian matrices.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

On the accurate computation of the Newton form of the Lagrange interpolant

  • Khiar, Y.
  • Mainar, E.
  • Royo-Amondarain, E.
  • Rubio, B.
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great precision, even for large ill-conditioned matrices. In this framework, the present work provides the factorization of the collocation matrices of Newton bases—of relevance when considering the Lagrange interpolation problem—together with an algorithm that allows to numerically compute it to high relative accuracy. This further allows to determine the coefficients of the interpolating polynomial and to compute the singular values and the inverse of the collocation matrix. Conditions that guarantee high relative accuracy for these methods and, in the former case, for the classical recursion formula of divided differences, are determined. Numerical errors due to imprecise computer arithmetic or perturbed input data in the computation of the factorization are analyzed. Finally, numerical experiments illustrate the accuracy and effectiveness of the proposed methods with several algebraic problems, in stark contrast with traditional approaches.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Gaussian Markov Random fields over graphs of paths and high relative accuracy

  • Baz, Juan
  • Alonso, Pedro
  • Peña, Juan Manuel
  • Pérez-Fernández, Raúl
The present paper presents some results that allow us to perform with High Relative Accuracy linear algebra operations with correlation and covariance matrices of Gaussian Markov Random Fields over graphs of paths. Some numerical experiments are carried out showing the computational benefits of this approach.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accurate bidiagonal decompositions of Cauchy–Vandermonde matrices of any rank

  • Delgado, Jorge
  • Koev, Plamen
  • Marco, Ana
  • Martínez, José-Javier
  • Peña, Juan Manuel
  • Persson, Per-Olof
  • Spasov, Steven
We present a new decomposition of a Cauchy–Vandermonde matrix as a product of bidiagonal matrices which, unlike its existing bidiagonal decompositions, is now valid for a matrix of any rank. The new decompositions are insusceptible to the phenomenon known as subtractive cancellation in floating point arithmetic and are thus computable to high relative accuracy. In turn, other accurate matrix computations are also possible with these matrices, such as eigenvalue computation amongst others.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accurate Computations with Generalized Green Matrices

  • Delgado, Jorge
  • Peña, Guillermo
  • Peña, Juan Manuel
We consider generalized Green matrices that, in contrast to Green matrices, are not necessarily symmetric. In spite of the loss of symmetry, we show that they can preserve some nice properties of Green matrices. In particular, they admit a bidiagonal decomposition. Moreover, for convenient parameters, the bidiagonal decomposition can be obtained efficiently and with high relative accuracy and it can also be used to compute all eigenvalues, all singular values, the inverse, and the solution of some linear system of equations with high relative accuracy. Numerical examples illustrate the high accuracy of the performed computations using the bidiagonal decompositions. Finally, nonsingular and totally positive generalized Green matrices are characterized.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Total Positivity and Accurate Computations Related to q-Abel Polynomials

  • Khiar, Y.
  • Mainar, E.
  • Royo-Amondarain, E.
  • Rubio, B.
The attainment of accurate numerical solutions of ill-conditioned linear algebraic problems involving totally positive matrices has been gathering considerable attention among researchers over the last years. In parallel, the interest of q-calculus has been steadily growing in the literature. In this work the q-analogue of the Abel polynomial basis is studied. The total positivity of the matrix of change of basis between monomial and q-Abel bases is characterized, providing its bidiagonal factorization. Moreover, well-known high relative accuracy results of Vandermonde matrices corresponding to increasing positive nodes are extended to the decreasing negative case. This further allows to solve with high relative accuracy several algebraic problems concerning collocation, Wronskian and Gramian matrices of q-Abel polynomials. Finally, a series of numerical tests support the presented theoretical results and illustrate the goodness of the method where standard approaches fail to deliver accurate solutions.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Totally positive Wronskian matrices and symmetric functions

  • Díaz, Pablo
  • Mainar, Esmeralda
  • Rubio, Beatriz
The elements of the bidiagonal decomposition (BD) of a totally positive (TP) collocation matrix can be expressed in terms of symmetric functions of the nodes. Making use of this result, and studying the relation between Wronskian and collocation matrices of a given TP basis of functions, we can express the entries of the BD of Wronskian matrices as the values of certain symmetric functions evaluated at a single node. Moreover, in the case of polynomial bases, we obtain compact formulae for the entries of the BD of their Wronskian matrices. Interesting examples illustrate the applications of the obtained formulae.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

The High Relative Accuracy of Computations with Laplacian Matrices

  • Orera, Héctor
  • Peña, Juan Manuel
This paper provides an efficient method to compute an LDU decomposition of the Laplacian matrix of a connected graph with high relative accuracy. Several applications of this method are presented. In particular, it can be applied to efficiently compute the eigenvalues of the mentioned Laplacian matrix. Moreover, the method can be extended to graphs with weighted edges.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

High Relative Accuracy With Collocation Matrices of q-Jacobi Polynomials

  • Delgado, Jorge
  • Orera, Héctor
  • Peña, Juan Manuel
Little ‐Jacobi polynomials belong to the field of quantum calculus. This article obtains the bidiagonal decomposition of the collocation matrices of these polynomials, showing that, in many cases, it can be constructed to high relative accuracy (HRA). Then, it can be used to compute with HRA the inverses, eigenvalues, and singular values of these matrices. Numerical experiments are provided and illustrate the excellent results obtained when applying the presented methods.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accurate Computations with Generalized Pascal k-Eliminated Functional Matrices

  • Delgado, Jorge
  • Orera, Héctor
  • Peña, Juan Manuel
This paper presents an accurate method to obtain the bidiagonal decomposition of some generalized Pascal matrices, including Pascal k-eliminated functional matrices and Pascal symmetric functional matrices. Sufficient conditions to assure that these matrices are either totally positive or inverse of totally positive matrices are provided. In these cases, the presented method can be used to compute their eigenvalues, singular values and inverses with high relative accuracy. Numerical examples illustrate the high accuracy of our approach.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Estimation of the covariance matrix of a Gaussian Markov Random Field under a total positivity constraint

  • Baz, Juan
  • Alonso, Pedro
  • Peña, Juan Manuel
  • Pérez-Fernández, Raúl
Gaussian Markov Random Fields are a popular statistical model that has been used successfully in many fields of application. Recent work has studied conditions under which the covariance matrix of a Gaussian Markov Random Field over a graph of paths is totally positive. In such case, many linear algebra operations concerning the covariance matrix can be performed with High Relative Accuracy (the relative error is of order of machine precision). Unfortunately, classical estimators of the covariance matrix do not necessarily yield a totally positive matrix, even when the population covariance matrix is totally positive. Essentially, this inconvenience prevents the available High Relative Accuracy methods to be used with real-life data. Here, we present a method for the estimation of the covariance matrix of a Gaussian Markov Random Field over a graph of paths assuring the estimated covariance matrix (or its inverse) is totally positive.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

High relative accuracy for a Newton form of bivariate interpolation problems

  • Khiar, Yasmina
  • Mainar, Esmeralda
  • Royo-Amondarain, Eduardo
  • Rubio, Beatriz
The problem of bivariate polynomial interpolation using Newton-type bases is examined, leading to the application of a generalized Kronecker matrix product. Algorithms for computing the coefficients of the interpolating polynomial are presented, along with conditions that ensure relative errors of the order of machine precision. A generalization of the classical recursion formula of divided differences in two dimensions is proposed for grids that generalize the standard rectangular layout. Numerical experiments demonstrate the high accuracy achieved by the proposed approach.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

High-relative-accuracy computations with Kac-Murdock-Szegö matrices and their generalizations

  • Delgado, Jorge
  • Peña, J. M.
A linear-time-complexity method to obtain the bidiagonal decomposition of a generalized Kac-Murdock-Szegö matrix is presented. For convenient values of the parameters, it can be obtained with high relative accuracy and it can be also used to compute all eigenvalues, all singular values, the inverse and the solution of some linear systems of equations with high relative accuracy.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Total positivity, Gramian matrices, and Schur polynomials

  • Díaz, Pablo
  • Mainar, Esmeralda
  • Rubio, Beatriz
This paper investigated the total positivity of Gramian matrices associated with general bases of functions. It demonstrated that the total positivity of collocation matrices for totally positive bases extends to their Gramian matrices. Additionally, a bidiagonal decomposition of these Gramian matrices, derived from integrals of symmetric functions, was presented. This decomposition enables the design of algorithms with high relative accuracy for solving linear algebra problems involving totally positive Gramian matrices. For polynomial bases, compact and explicit formulas for the bidiagonal decomposition were provided, involving integrals of Schur polynomials. These integrals, known as Selberg-like integrals, arise naturally in various contexts within Physics and Mathematics
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

High Relative Accuracy for Corner Cutting Algorithms

  • Ballarín, Jorge
  • Delgado, Jorge
  • Peña, Juan Manuel
Corner cutting algorithms are important in computer-aided geometric design and they are associated to stochastic non-singular totally positive matrices. Non-singular totally positive matrices admit a bidiagonal decomposition. For many important examples, this factorization can be obtained with high relative accuracy. From this factorization, a corner cutting algorithm can be obtained with high relative accuracy. Illustrative examples are included.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Eigenvalue Localization for Symmetric Positive Toeplitz Matrices

  • Peña, Juan M.
Given a real symmetric matrix, several inclusion and exclusion intervals containing its eigenvalues can be given. In this paper, for symmetric positive Toeplitz matrices, we provide an inclusion interval and, under an additional hypothesis, we also give two disjoint intervals contained in the previous one and containing all the eigenvalues. Examples are included, showing that these two intervals are necessary and that they can provide precise information on the localization of the eigenvalues. Sufficient conditions for positive definiteness are included. Necessary and sufficient conditions for the total positivity of symmetric positive Toeplitz matrices are presented. A characterization of symmetric totally positive circulant matrices is also obtained.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Factorizations and Accurate Computations with Min and Max Matrices

  • Khiar, Yasmina
  • Mainar, Esmeralda
  • Royo-Amondarain, Eduardo
Min and max matrices are structured matrices that appear in diverse mathematical and computational applications. Their inherent structures facilitate highly accurate numerical solutions to algebraic problems. In this research, the total positivity of generalized Min and Max matrices is characterized, and their bidiagonal factorizations are derived. It is also demonstrated that these decompositions can be computed with high relative accuracy (HRA), enabling the precise computations of eigenvalues and singular values and the solution of linear systems. Notably, the discussed approach achieves relative errors on the order of the unit roundoff, even for large and ill-conditioned matrices. To illustrate the exceptional accuracy of this method, numerical experiments on quantum extensions of Min and L-Hilbert matrices are presented, showcasing their superior precisions compared to those of standard computational techniques.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

On the accurate basis conversion of univariate polynomials

  • Khiar, Y.
  • Mainar, E.
  • Peña, J. M.
  • Royo-Amondarain, E.
  • Rubio, B.
This paper summarizes the bidiagonal factorizations of change of basis matrices between polynomial bases commonly used in interpolation and computer-aided geometric design. These factorizations enable the efficient and highly accurate resolution of linear algebra problems, offering significant advantages in terms of precision. The article also highlights a variety of applications, including the accurate computation of divided differences and the efficient solution of algebraic problems involving collocation matrices or Gram matrices, underscoring the practical relevance of these factorizations in mathematical and computational contexts.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Positive Hankel Matrices, Eigenvalues and Total Positivity

  • Peña, Juan Manuel
For positive Hankel matrices, an interval containing all eigenvalues is obtained. With a stronger condition, we also construct two sharper intervals for the eigenvalue localization. The total positivity of positive Hankel matrices is analyzed. The relationship between Hankel TP matrices and some Toeplitz SR matrices is analyzed.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accurate determinant computation of Cauchy-polynomial matrices

  • Khiar, Yasmina
  • Mainar, Esmeralda
  • Peña, Juan Manuel
  • Royo-Amondarain, Eduardo
This paper investigates the factorization of Cauchy-polynomial matrices, a structured class that generalizes Cauchy-Vandermonde matrices by incorporating polynomial bases different from the monomial basis. We analyze the impact of different polynomial bases, including q-Bernstein, h-Bernstein, and Said-Ball polynomials, on numerical accuracy. A key focus is the derivation of formulas for their determinants, satisfying the No Inaccurate Cancellation condition and ensuring high relative accuracy. The sensitivity of the algorithm under deviations of the input data is analyzed, and an upper running error bound is provided. Theoretical findings are supported by numerical experiments, demonstrating the superior accuracy of the proposed determinant formulas compared to standard computational methods, even when perturbations are considered.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Bidiagonal Decompositions and Accurate Computations for the Ballot Table and the Fibonacci Matrix

  • Ballarín, Jorge
  • Delgado, Jorge
  • Peña, J. M.
Riordan arrays include many important examples of matrices. Here we consider the ballot table and the Fibonacci matrix. For finite truncations of these Riordan arrays, we obtain bidiagonal decompositions. Using them, algorithms to solve key linear algebra problems for ballot tables and Fibonacci matrices with high relative accuracy are derived. We include numerical experiments showing the accuracy of our method.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accurate matrix conversion between Bernstein and ℎ-Bernstein bases

  • Khiar, Y.
  • Mainar, E.
  • Peña, J.M.
  • Royo-Amondarain, E.
This paper investigates the matrix conversion between the classical Bernstein basis and its oneparameter generalization, the ℎ-Bernstein basis. New ℎ-analogues of the binomial coefficients are introduced, providing explicit and compact expressions for the entries of the corresponding change-of-basis matrices. Structural properties such as symmetry and recurrence relations are derived, offering both theoretical insight and practical computational advantages. The proposed recurrence formulations enable the generation of the conversion matrices with high relative accuracy, avoiding subtractive cancellations and the numerical instabilities associated with direct collocation-based approaches. These results ensure reliable computations even for very large degrees and establish a foundation for the development of accurate and efficient algorithms in geometric modeling and related numerical applications involving ℎ-Bernstein polynomials. Numerical experiments confirm the theoretical findings and highlight the advantages of the proposed approach.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Perturbation theory and error analysis for the Cauchy formula

  • Díaz, Pablo
  • Khiar, Yasmina
  • Mainar, Esmeralda
  • Royo-Amondarain, Eduardo
In this work, we analyze the numerical behavior of the classical Cauchy identity & sum;(lambda )s(lambda)(a(1),... , a(n))s(lambda)(x(1), ... , x(m)) = & prod;(n)(j=1) & prod;(m)(i=1) 1/1-a(j)x(i), by developing perturbation and running error analyses. We show that relative perturbations in the nodes x(i) and coefficients a(j) only induce small relative changes in the output provided some relative gaps are sufficiently large. We also propose an algorithm computing a posteriori relative error bound with low computational overhead. Finally, we derive truncation error bounds for the Schur expansion of the formula. Numerical experiments confirm the sharpness of the theoretical results and illustrate the effectiveness of the proposed bounds in practice.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

High relative accuracy computations with covariance matrices of order statistics

  • Baz, Juan
  • Alonso, Pedro
  • Peña, Juan Manuel
  • Pérez-Fernández, Raúl
In many statistical applications, numerical computations with covariance matrices need to be performed. The error made when performing such numerical computations increases with the condition number of the covariance matrix, which is related to the number of variables and the strength of the correlation between the variables. In a recent work, a method for estimating the covariance matrix of a Gaussian Markov Random Field under a total positivity constraint was proposed. This estimation allows for performing many numerical computations with covariance matrices to high relative accuracy (the relative error is of the order of machine precision). However, the necessary conditions for this estimation method to produce a covariance matrix that is close to the population covariance matrix may be too demanding for real‐life data. In this paper, we study a particular setting related to order statistics in which these necessary conditions are inherently satisfied. In addition to the theoretical study, an extensive discussion concerning many potential applications is addressed, and a real‐life example of an application related to sports data is presented.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accurate computations with Riordan arrays associated with Schröder matrices

  • Ballarín, Jorge
  • Delgado, Jorge
  • Peña, Juan Manuel
Large and little Schröder matrices as well as with their inverses are triangular matrices arising in Combinatorics. Through their total positivity and bidiagonal decomposition it is shown that their singular values, inverses and some associated linear systems can be solved with high relative accuracy. Numerical experiments confirm the theoretical results.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Total positivity of analytic bases through symmetric functions

  • Díaz, P.
  • Mainar, E.
This paper studies the bidiagonal factorization of the collocation matrices of analytic bases using symmetric functions. Explicit formulas for their initial minors are derived in terms of Schur functions. The structure of these formulas permits establishing sufficient conditions for the total positivity of generic systems of analytic functions. In addition, they have been found to lead to generalizations of the Cauchy identity for certain families of functions.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accurate spectral computations and error analysis for r-geometric Min and Max matrices

  • Khiar, Y.
  • Mainar, E.
  • Royo-Amondarain, E.
In this work, we introduce a new two-parameter family of structured matrices, termed r-geometric Min and Max matrices, which generalize both the r-Min/r-Max and geometric Min/Max matrices. We derive explicit bidiagonal factorizations for these matrices using Neville elimination and establish necessary and sufficient conditions under which they are totally positive. Under these conditions, we develop algorithms capable of computing their eigenvalues and singular values to high relative accuracy, as well as closed-form expressions for their determinants. We also apply perturbation theory to analyze the sensitivity of these problems to input data, deriving structured condition numbers that quantify the impact of data perturbations. Numerical experiments confirm the theoretical results and demonstrate the reliability and efficiency of the proposed algorithms across both the general r-geometric case and key special instances.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Bidiagonal Decompositions and High‐Accuracy Computations for Newton Collocation Matrices

  • Mainar, E.
  • Marco, A.
  • Rubio, B.
  • Viaña, R.
We consider a class of collocation matrices associated with the Newton basis of the space of polynomials of degree at most , evaluated at a set of nodes. In the most general setting, we allow of these nodes to either coincide with or differ from those defining the Newton basis. We establish necessary and sufficient conditions for to be strictly totally positive (STP), based solely on an appropriate ordering of the nodes. We derive explicit formulas for the bidiagonal decomposition of and present an efficient algorithm for computing it to high relative accuracy (HRA). This factorization enables accurate and fast computation of solutions to linear systems with coefficient matrix , as well as the evaluation of its eigenvalues, singular values, and inverse, all to HRA. Furthermore, we apply our framework to the least squares approximation problem in the Newton basis. We show that the STP property of guarantees both uniqueness of the solution and, under mild conditions, its computation to an accuracy comparable to HRA. Extensive numerical experiments confirm the theoretical properties and demonstrate the superior accuracy and performance of the proposed algorithms when compared to standard numerical methods, especially in the presence of severe ill‐conditioning.