Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices

DOI10.1016/j.cam.2018.10.009zbMath1405.65055OpenAlexW2899195779WikidataQ129021754 ScholiaQ129021754MaRDI QIDQ1713175

Ana Marco, José-Javier Martıńez

Publication date: 24 January 2019

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2018.10.009

zbMATH Keywords

inverseMoore-Penrose inverseNeville eliminationtotally positive matrixbidiagonal decompositionhigh relative accuracy

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Positive matrices and their generalizations; cones of matrices (15B48) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05) Toeplitz, Cauchy, and related matrices (15B05)

Related Items (14)

Accurate computations with Wronskian matrices of Bessel and Laguerre polynomials ⋮ Accurate computations with Gram and Wronskian matrices of geometric and Poisson bases ⋮ Accurate computations with matrices related to bases \(\{t^ie^{\lambda t}\}\) ⋮ Accurate computations with collocation matrices of the Lupaş-type \((p,q)\)-analogue of the Bernstein basis ⋮ Accurate bidiagonal decomposition and computations with generalized Pascal matrices ⋮ Total positivity and accurate computations with Gram matrices of Bernstein bases ⋮ Polynomial total positivity and high relative accuracy through Schur polynomials ⋮ On the accuracy of de Casteljau-type algorithms and Bernstein representations ⋮ High relative accuracy through Newton bases ⋮ Accurate and fast computations with Green matrices ⋮ Accurate bidiagonal factorization of quantum Hilbert matrices ⋮ Accurate bidiagonal decomposition of totally positive h-Bernstein-Vandermonde matrices and applications ⋮ Accurate computations with collocation and Wronskian matrices of Jacobi polynomials ⋮ Accurate computations with Wronskian matrices

Uses Software

• mctoolbox
• TNTool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplicative perturbation theory of the Moore-Penrose inverse and the least squares problem
• Two improvements of the iterative method for computing Moore-Penrose inverse based on Penrose equations
• Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
• Full-rank representations of outer inverses based on the QR decomposition
• Hyper-power methods for the computation of outer inverses
• Accurate bidiagonal decomposition of totally positive Cauchy-Vandermonde matrices and applications
• An improved method for the computation of the Moore-Penrose inverse matrix
• Iterative method for computing the Moore-Penrose inverse based on Penrose equations
• A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
• Applications of the Moore-Penrose inverse in digital image restoration
• Total positivity and Neville elimination
• A matricial description of Neville elimination with applications to total positivity
• Accurate computations with Lupaş matrices
• A class of numerical algorithms for computing outer inverses
• Accurate computations with collocation matrices of rational bases
• Componentwise backward error analysis of Neville elimination
• On a partial order defined by the weighted Moore-Penrose inverse
• Accurate SVDs of polynomial Vandermonde matrices involving orthonormal polynomials
• Fast computing of the Moore-Penrose inverse matrix
• Accurate Computations with Totally Nonnegative Matrices
• Accurate and efficient expression evaluation and linear algebra
• Bidiagonal Factorizations of Totally Nonnegative Matrices
• The Moore of the Moore-Penrose inverse
• Accuracy and Stability of Numerical Algorithms
• The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
• Numerical Methods in Matrix Computations
• Some Applications of the Pseudoinverse of a Matrix
• Accurate computations with totally positive Bernstein-Vandermonde matrices
• Bidiagonal decomposition of rectangular totally positive Said-Ball-Vandermonde matrices: error analysis, perturbation theory and applications

This page was built for publication: Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices