Improved bound for rank revealing LU factorizations

DOI10.1016/S0024-3795(96)00397-7zbMATH Open0883.65020WikidataQ114122553 ScholiaQ114122553MaRDI QIDQ1362659FDOQ1362659

Authors: Tsung-Min Hwang, Wen-Wei Lin, Daniel J. Pierce 

Publication date: 29 March 1998

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Recommendations

• Rank revealing \(LU\) factorizations
• On the existence and computation of rank-revealing LU factorizations
• Strong rank revealing LU factorizations
• On Rank-Revealing Factorisations
• Improved bounds for the implicit factorization problem
• A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
• New lower bounds for the rank of matrix multiplication
• Bounds for elements of LU factorizations of sparse matrices and their application to incomplete factorization methods
• Improved rigorous perturbation bounds for the LU and QR factorizations.
• Towards optimal bounds for implicit factorization problem

zbMATH Keywords

sparse matricesrank of a matrixrank deficient linear systems of equationsrank revealing LU factorizationrank revealing QR factorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Cites Work

• Rang revealing QR factorizations
• Title not available (Why is that?)
• Numerical methods for solving linear least squares problems
• Error Analysis of Direct Methods of Matrix Inversion
• Structure-Preserving and Rank-Revealing QR-Factorizations
• Some Applications of the Rank Revealing QR Factorization
• On Rank-Revealing Factorisations
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Rank-Revealing QR Factorizations and the Singular Value Decomposition
• On the Existence and Computation of LU-Factorizations with Small Pivots
• Rank revealing \(LU\) factorizations
• Sparse Multifrontal Rank Revealing QR Factorization
• The Bordering Algorithm and Path Following Near Singular Points of Higher Nullity
• The Probability of Large Diagonal Elements in the $QR$ Factorization
• Rank Detection Methods for Sparse Matrices

Cited In (6)

• Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
• Strong rank revealing LU factorizations
• Optimal CUR matrix decompositions
• Title not available (Why is that?)
• On the existence and computation of rank-revealing LU factorizations
• Rank revealing \(LU\) factorizations

This page was built for publication: Improved bound for rank revealing LU factorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362659)