Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
Identifiers
Permanent link (URI): http://hdl.handle.net/10017/60638DOI: 10.1016/j.cam.2018.10.009
ISSN: 0377-0427
Date
2019-04-01Funders
Ministerio de Economía y Competitividad
Bibliographic citation
Journal of Computational and Applied Mathematics, 2019, v. 350, n. , p. 299-308
Keywords
Moore Penrose inverse
Inverse
Totally positive matrix
Neville elimination
Bidiagonal decomposition
High relative accuracy
Project
info:eu-repo/grantAgreement/MIMECO//MTM2015-65433-P/ES/Métodos Numéricos en la representación de curvas y superficies, matrices positivas y aplicaciones
Document type
info:eu-repo/semantics/article
Version
info:eu-repo/semantics/publishedVersion
Rights
© 2018 Elsevier
Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
Access rights
info:eu-repo/semantics/openAccess
Abstract
The computation of the Moore-Penrose inverse of structured strictly totally positive matrices is addressed. Since these matrices are usually very ill-conditioned, standard algorithms fail to provide accurate results. An algorithm based on the factorization and which takes advantage of the special structure and the totally positive character of these matrices is presented. The first stage of the algorithm consists of the accurate computation of the bidiagonal decomposition of the matrix. Numerical experiments illustrating the good behavior of our approach are included.Numerical experiments illustrating the good behavior of our approach are included.
Files in this item
Files | Size | Format |
|
---|---|---|---|
accurate_marco_j_comput_appl_m ... | 329.2Kb |
|
Files | Size | Format |
|
---|---|---|---|
accurate_marco_j_comput_appl_m ... | 329.2Kb |
|
Collections
- FISICA - Artículos [76]