AbstractLet X be a matrix of full column rank, and let D be a diagonal matrix with positive diagonal elements. The weighted pseudoinverse defined by X†D= (XTDX)−1XTD and the associated oblique projection PD=XX†D arise in many applications. In this paper, we show that the norms of both matrices are bounded by numbers that are independent of D
AbstractWe start by proving a lower bound for the lp operator norm of a submatrix with sufficiently ...
AbstractThis paper is concerned with the problem of diagonally scaling a given nonnegative matrix a ...
We present a novel representation of rank constraints for non-square real matrices. We establish rel...
AbstractLet X be a matrix of full column rank, and let D be a positive definite diagonal matrix. In ...
AbstractLet X be a matrix of full column rank, and let D be a diagonal matrix with positive diagonal...
AbstractLet an m × n matrix A be approximated by a rank-r matrix with an accuracy ε. We prove that i...
AbstractThe paper analyzes and compares two direct algorithms for rank-deficient pseudoinverses that...
AbstractThe condition numbers described by Stewart, Todd, and others for a matrix A are given by the...
Abstract. The celebrated Kreiss matrix theorem is one of several results relating the norms of the p...
Least squares solution to linear system and computation of pseudoinverse by matrix of unknown ran
AbstractLet M denote the set of all complex n×n matrices whose columns span certain given linear sub...
AbstractWe prove weighted norm inequalities for pseudodifferential operators with amplitudes which a...
AbstractIn this note, we bound the inverse of nonsingular diagonal dominant matrices under the infin...
In combinatorial optimization, many problems can be modeled by optimizing a linear functional over ...
AbstractA matrix or a linear operator A is said to possess an UV-displacement structure if rank(AU −...
AbstractWe start by proving a lower bound for the lp operator norm of a submatrix with sufficiently ...
AbstractThis paper is concerned with the problem of diagonally scaling a given nonnegative matrix a ...
We present a novel representation of rank constraints for non-square real matrices. We establish rel...
AbstractLet X be a matrix of full column rank, and let D be a positive definite diagonal matrix. In ...
AbstractLet X be a matrix of full column rank, and let D be a diagonal matrix with positive diagonal...
AbstractLet an m × n matrix A be approximated by a rank-r matrix with an accuracy ε. We prove that i...
AbstractThe paper analyzes and compares two direct algorithms for rank-deficient pseudoinverses that...
AbstractThe condition numbers described by Stewart, Todd, and others for a matrix A are given by the...
Abstract. The celebrated Kreiss matrix theorem is one of several results relating the norms of the p...
Least squares solution to linear system and computation of pseudoinverse by matrix of unknown ran
AbstractLet M denote the set of all complex n×n matrices whose columns span certain given linear sub...
AbstractWe prove weighted norm inequalities for pseudodifferential operators with amplitudes which a...
AbstractIn this note, we bound the inverse of nonsingular diagonal dominant matrices under the infin...
In combinatorial optimization, many problems can be modeled by optimizing a linear functional over ...
AbstractA matrix or a linear operator A is said to possess an UV-displacement structure if rank(AU −...
AbstractWe start by proving a lower bound for the lp operator norm of a submatrix with sufficiently ...
AbstractThis paper is concerned with the problem of diagonally scaling a given nonnegative matrix a ...
We present a novel representation of rank constraints for non-square real matrices. We establish rel...
DOI
Add to ORKG