On a general class of matrix nearness problems (Q1176190): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: G. Alistair Watson / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: G. Philip. A. Thijsse / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smallest Perturbation of a Submatrix which Lowers the Rank and Constrained Total Least Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of the Effects of Irregular Terrain on Radio Wave Propagation Based on a Three-Dimensional Parabolic Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and efficient computation of the structured singular value / rank
 
Normal rank
Property / cites work
 
Property / cites work: m-form numerical range and the computation of the structured singular value / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Eckart-Young-Mirsky matrix approximation theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Total Least Squares Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Total Approximation Problem in Separable Norms, and an Algorithm for the Total $l_1 $ Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of algorithms for total approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smallest Perturbation of a Submatrix that Lowers the Rank of the Matrix / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01888159 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069820114 / rank
 
Normal rank

Latest revision as of 10:40, 30 July 2024

scientific article
Language Label Description Also known as
English
On a general class of matrix nearness problems
scientific article

    Statements

    On a general class of matrix nearness problems (English)
    0 references
    25 June 1992
    0 references
    The following problem is considered: Given a rectangular matrix A, determine a matrix \(\Delta\) of minimal norm and prescribed sparsity such that \(\text{rank}(A+\Delta)<\text{rank } A\). Describing the sparsity pattern by means of a generalized block decomposition into zero and possibly nonzero blocks one considers norms which are of the form \(\|\Delta\|=(f(\nu))^{1/\alpha}\), where \(f\) is a monotone gauge function and \(\nu=(\nu_ i)\) denotes the nonnegative vector whose components are the norms of the individual nonzero blocks in \(\Delta\). The norm for each block may be different, but is assumed to be separable (i.e., \(\nu_ i=\| uv^ T\|_{(i)}=\| u\|_{A_ i}\| v^ T\|^*_{B_ i}\), \(\|\cdot\|_{A_ i}\) a vector norm, \(\| \cdot\|^*_{B_ i}\) a dual vector norm for each rank one block \(uv^ T\)). It is shown that, provided the problem is solvable (i.e., the set of all \(\Delta\) such that \(\text{rank}(A+\Delta)<\text{rank }A\) is nonempty), it can be solved by considering a related (reduced) problem, involving less variables and only the vector norms \(\|\cdot\|_{A_ i}\) and \(\|\cdot\|_{B_ i}\). The description is then spezialized to matrix norms which separate into vector-\(\ell_ 2\)-norms, such as the spectral- (i.e. the \(\ell_ 2\)-operator) or the Frobenius norm. In that case it is possible to formulate stationary point conditions for the reduced problem. The procedure is illustrated by some numerical examples. The paper closes with a short section on the problem of finding a \(\Delta\) of minimal norm such that \(\text{rank}(A+\Delta)=\text{rank }A-d\), where \(d>0\) is prescribed.
    0 references
    matrix nearness problems
    0 references
    nearest rank-deficient matrix
    0 references
    rectangular matrix
    0 references
    prescribed sparsity
    0 references
    monotone gauge function
    0 references
    numerical examples
    0 references
    matrix norm
    0 references
    structured perturbation
    0 references
    0 references

    Identifiers