Pages that link to "Item:Q1764965"
From MaRDI portal
The following pages link to Computing Moore-Penrose inverses of Toeplitz matrices by Newton's iteration (Q1764965):
Displaying 15 items.
- The stability of formulae of the Gohberg-Semencul-Trench type for Moore-Penrose and group inverses of Toeplitz matrices (Q269264) (← links)
- Modified SMS method for computing outer inverses of Toeplitz matrices (Q426313) (← links)
- Zhang neural network solving for time-varying full-rank matrix Moore-Penrose inverse (Q644898) (← links)
- Explicit group inverse of an innovative patterned matrix (Q668819) (← links)
- A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix (Q846447) (← links)
- Interval iterative methods for computing Moore-Penrose inverse (Q864808) (← links)
- Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\) (Q1724477) (← links)
- Newton-like iteration based on a cubic polynomial for structured matrices (Q1768394) (← links)
- Computing the pseudoinverse of specific Toeplitz matrices using rank-one updates (Q1793737) (← links)
- A family of iterative methods for computing Moore-Penrose inverse of a matrix (Q1932581) (← links)
- Discrete-time noise-tolerant Zhang neural network for dynamic matrix pseudoinversion (Q2001149) (← links)
- Scalar correction method for finding least-squares solutions on Hilbert spaces and its applications (Q2016276) (← links)
- An improved Newton iteration for the weighted Moore-Penrose inverse (Q2489382) (← links)
- Displacement structure of the core inverse (Q5070348) (← links)
- Representations of the Moore–Penrose inverse for a class of 2-by-2 block operator valued partial matrices (Q5190335) (← links)
