Rank revealing \(LU\) factorizations
type: Item
instance of: scholarly article
title: Rank revealing \(LU\) factorizations
zbMATH Open document ID: 0763.65013
DOI: 10.1016/0024-3795(92)90305-T
author: Tsung-Min Hwang
author: Wen-Wei Lin
author: Eugene K. Yang
published in: Linear Algebra and its Applications
publication date: 1993-01-16T00:00:00Z
review text: The paper deals with the \(LU\) factorization of square matrices. This problem is treated from the point of view of a generalization when permutations of the matrices are considered. The goal is to reveal the rank deficiency by the factorization. A two-pass rank revealing algorithm is developed. The approach is applied to a constraint optimization problem.
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 95479
zbMATH Keywords: matrix permutation
zbMATH Keywords: \(LU\) factorization
zbMATH Keywords: rank deficiency
zbMATH Keywords: rank revealing algorithm
zbMATH Keywords: constraint optimization
reviewed by: Marián Vajteršic
MaRDI profile type: Publication
cites work: Q3126806
cites work: A direct method for the solution of sparse linear least squares problems
cites work: Rang revealing QR factorizations
cites work: On the Existence and Computation of LU-Factorizations with Small Pivots
cites work: Generalized Deflated Block-Elimination
cites work: The evaluation of eigenvalues and eigenvectors of real symmetric matrices by simultaneous iteration
cites work: Q3928936
cites work: The Probability of Large Diagonal Elements in the $QR$ Factorization
full work available at URL: 0024-3795(92)90305-t
OpenAlex ID: W2080329506
Wikidata QID: Q114215293
description: scientific article; zbMATH DE number 95479