On Approximation Problems With Zero-Trace Matrices

  title={On Approximation Problems With Zero-Trace Matrices},
  author={Krystyna Zietak},
  journal={Linear Algebra and its Applications},
  • K. Zietak
  • Published 1 November 1996
  • Mathematics
  • Linear Algebra and its Applications
Abstract We consider some approximation problems in the linear space of complex matrices with respect to unitarily invariant norms. We deal with special cases of approximation of a matrix by zero-trace matrices. Moreover, some characterizations of zero-trace matrices are given by means of matrix approximation problems. 
On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm
We show that certain matrix approximation problems in the matrix 2-norm have uniquely defined solutions, despite the lack of strict convexity of the matrix 2-norm. The problems we consider areExpand
Orthogonality to matrix subspaces, and a distance formula
Abstract We obtain a necessary and sufficient condition for a matrix A to be Birkhoff–James orthogonal to any subspace W of M n ( C ) . Using this we obtain an expression for the distance of A fromExpand
A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
The results show that the proposed semismooth Newton-CG based dual PPA for solving the matrix norm approximation problems substantially outperforms the pure ADMM, especially for the constrained cases and it is able to solve the problems robustly and efficiently to a relatively high accuracy. Expand
A Semismooth Newton-CG Dual Proximal Point Algorithm for Matrix Spectral Norm Approximation Problems
We consider a class of matrix spectral norm approximation problems for finding an affine combination of given matrices having the minimal spectral norm subject to some prescribed linear equality andExpand
From the strict Chebyshev approximant of a vector to the strict spectral approximant of a matrix
The main aim of this review paper is approximation of a complex rectangular matrix, with respect to the unitarily invariant norms, by matrices from a linear subspace or from a convex closed subset ofExpand
On the volume-preserving procrustes problem
This paper is intended to study the volume-preserving procrustes problem arising from practical areas. The corresponding solution should satisfy a matrix equation which is solved by the singularExpand
Developing the CGLS algorithm for the least squares solutions of the general coupled matrix equations
In the present paper, we consider the minimum norm solutions of the general least squares problem By developing the conjugate gradient least square (CGLS) method, we construct anExpand
On the extremal structure of least upper bound norms and their dual
Abstract Given finite dimensional real or complex Banach spaces, E and F, with norms ν : E → R and μ : F → R , we denote by N μ ν the least upper bound norm induced on L ( E , F ) . Some results areExpand
On Chebyshev Polynomials of Matrices
General properties of Chebyshev polynomials of matrices are studied, which in some cases turn out to be generalizations of well-known properties of Chemicals of compact sets in the complex plane. Expand
On the generalized reflexive and anti-reflexive solutions to a system of matrix equations
Let P and Q be two generalized reflection matrices, i.e, P=PH, P2=I and Q=QH, Q2=I. An n×n matrix A is said to be generalized reflexive (generalized anti-reflexive) with respect to the matrix pairExpand


Properties of linear approximations of matrices in the spectral norm
Abstract The properties of linear approximations of a matrix are presented with respect to the spectrum norm. We describe the connection between all spectral approximations of a given matrix, and weExpand
On zero-trace matrices
Let A be an n × n complex matrix, and let 1 ⩽ p < ∞. It is shown that tr A = 0 if and only if ‖I + zA‖p ⩾ nsol1p for all zϵC. Some related characterizations are also given.
Characterizations of the trace
Abstract The paper contains a number of equivalent conditions which characterize the trace among the linear functionals on the matrix algebra. Some of these results are extended to more generalExpand
Subdifferentials, faces, and dual matrices
Abstract A characterization of the dual matrices for the unitarily invariant norms is given. Moreover, the connection between the dual matrices, the subdifferentials of matrix norms, and the faces ofExpand
On the characterization of the extremal points of the unit sphere of matrices
Abstract We give a characterization of the extremal points of the unit sphere of matrices for the unitarily invariant norms. We also investigate the properties of the dual matrices. Moreover, we showExpand
Characterization of the subdifferential of some matrix norms
Abstract A characterization is given of the subdifferential of matrix norms from two classes, orthogonally invariant norms and operator (or subordinate) norms. Specific results are derived for someExpand
Topics in Matrix Analysis
1. The field of values 2. Stable matrices and inertia 3. Singular value inequalities 4. Matrix equations and Kronecker products 5. Hadamard products 6. Matrices and functions.
A Continuous Selection of the Metric Projection in Matrix Spaces
We denote by C m×n the vector space of complex m×n matrices over C, m, n∈N, with elements A, B,.... For A ∈ C m×l and B ∈ C l×n, l, m, n∈N, AB denotes the matrix product of A and B in C m×n, A* theExpand
Matrix Perturbation Theory
$$X = {X_0} + \varepsilon {X_1} + {\varepsilon ^2}{X_2} + \cdots $$ (1.1.1) which acts in the n-dimensional (complex) vector space R.
Exposed faces and duality for symmetric and unitarily invariant norms
Abstract Let ψ be a unitarily invariant norm on the space of (real or complex) n×m matrices, and g the associated symmetric gauge function: thus ψ(A)g(s(A)), where s(A) is the decreasing sequence ofExpand