Stability of Methods for Matrix Inversion
From MaRDI portal
Recommendations
Cited in
(22)- Stability of triangularization of polynomial matrices
- Optimal Design of Experiments for Implicit Models
- An integer approximation method for discrete sinusoidal transforms
- Factorizations of hyperpower family of iterative methods via least squares approach
- Fast inversion of Vandermonde-like matrices involving orthogonal polynomials
- A practical method for matrix inversion
- Exploiting higher computational efficiency index for computing outer generalized inverses
- Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\)
- Randomized quasi-Newton updates are linearly convergent matrix inversion algorithms
- Towards an efficient tile matrix inversion of symmetric positive definite matrices on multicore architectures
- Linear algebra software for large-scale accelerated multicore computing
- The fast generalized Parker-Traub algorithm for inversion of Vandermonde and related matrices
- scientific article; zbMATH DE number 4200106 (Why is no real title available?)
- Computer-Aided Verification for Iterative Matrix Inversion Problems in Systems and Control
- scientific article; zbMATH DE number 4100488 (Why is no real title available?)
- Numerical instability of calculating inverse of spatial covariance matrices
- Inverse matrix representation with one triangular array
- Perturbation theory and backward error for AX - XB = C
- On the stability of a method for generalized matrix inversion with respect to the round-off error
- Optimal exact designs of experiments via mixed integer nonlinear programming
- An efficient computation of generalized inverse of a matrix
- On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
This page was built for publication: Stability of Methods for Matrix Inversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989253)
