Iterative methods to compute weighted normal pseudosolutions with positive definite weights
type: Item
instance of: scholarly article
title: Iterative methods to compute weighted normal pseudosolutions with positive definite weights
zbMATH Open document ID: 0922.65027
DOI: 10.1007/BF02742074
author: E. F. Galba
published in: Cybernetics and Systems Analysis
publication date: 1999-05-05T00:00:00Z
review text: Two iterative methods to compute the weighted normal pseudosolution for a linear system with an arbitrary rectangular real matrix are constructed and proved that the convergence is linear. The first process requires finding the maximum and minimum nonzero eigenvalue of a symmetrizable positive semidefinite matrix. The second process requires inverting a symmetrizable positive matrix.
Mathematics Subject Classification ID: 65F20
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 1262998
zbMATH Keywords: pseudosolution
zbMATH Keywords: least squares solution
zbMATH Keywords: pseudoinverse matrix
zbMATH Keywords: iterative methods
zbMATH Keywords: convergence
zbMATH Keywords: weighted normal pseudosolution
reviewed by: Horst Hollatz
MaRDI profile type: Publication
cites work: A new type of approximation leading to reduction of dimensionality in control processes
cites work: Eigenvectors ofH-Selfadjoint Matrices
cites work: Q3033898
cites work: A Note on the Oblique Matrix Pseudoinverse
cites work: Q5849795
cites work: A weighted pseudoinverse for complex matrices
cites work: Q3968015
cites work: A weighted pseudoinverse, generalized singular values, and constrained least squares problems
cites work: Some Modified Matrix Eigenvalue Problems
cites work: Quadratically constrained least squares and quadratic problems
description: scientific article; zbMATH DE number 1262998