نتایج جستجو برای: matrix norm

تعداد نتایج: 402509  

Journal: :bulletin of the iranian mathematical society 2015
m. mohseni moghadam a. rivaz a. tajaddini f. saberi movahed

in this paper‎, ‎we study convergence behavior of the global fom (gl-fom) and global gmres (gl-gmres) methods for solving the matrix equation $axb=c$ where $a$ and $b$ are symmetric positive definite (spd)‎. ‎we present some new theoretical results of these methods such as computable exact expressions and upper bounds for the norm of the error and residual‎. ‎in particular‎, ‎the obtained upper...

2010
Kateřina Hlaváčková-Schindler

A new lower bound on minimal singular values of real matrices based on Frobenius norm and determinant is presented. We show that under certain assumptions on matrix A is this estimate sharper than a recent bound from Hong and Pan based on a matrix norm and determinant.

2007
E. Gökçen Alptekin Toufik Mansour Naim Tuglu

In this paper, we obtain the spectral norm and eigenvalues of circulant matrices with Horadam’s numbers. Furthermore, we define the semicirculant matrix with these numbers and give the Euclidean norm of this matrix. 2000 Mathematics Subject Classification: 11B39; 15A36; 15A60; 15A18.

2009
Kateřina Hlaváčková-Schindler

We present a new lower bound on minimal singular values of real matrices base on Frobenius norm and determinant. We show, that under certain assumptions on matrix A is our estimate sharper than two recent ones based on a matrix norm and determinant.

Journal: :CoRR 2017
Xiaohuan Wu Wei-Ping Zhu Jun Yan

The low-rank matrix reconstruction (LRMR) approach is widely used in direction-of-arrival (DOA) estimation. As the rank norm penalty in an LRMR is NP-hard to compute, the nuclear norm (or the trace norm for a positive semidefinite (PSD) matrix) has been often employed as a convex relaxation of the rank norm. However, solving a nuclear norm convex problem may lead to a suboptimal solution of the...

Let complex matrices $A$ and $B$ have the same sizes. Using the singular value decomposition, we characterize the $g$-inverse $B^{(1)}$ of $B$ such that the distance between a given $g$-inverse of $A$ and the set of all $g$-inverses of the matrix $B$ reaches minimum under the unitarily invariant norm. With this result, we derive additive and multiplicative perturbation bounds of the nearest per...

2017
Chen Xu Zhouchen Lin Hongbin Zha

The Schatten-p norm (0 < p < 1) has been widely used to replace the nuclear norm for better approximating the rank function. However, existing methods are either 1) not scalable for large scale problems due to relying on singular value decomposition (SVD) in every iteration, or 2) specific to some p values, e.g., 1/2, and 2/3. In this paper, we show that for any p, p1, and p2 > 0 satisfying 1/p...

Journal: :CoRR 2016
Ulrich Michel Martin Kliesch Richard Kueng David Gross

The diamond norm plays an important role in quantum information and operator theory. Recently, it has also been proposed as a reguralizer for low-rank matrix recovery. The norm constants that bound the diamond norm in terms of the nuclear norm (also known as trace norm) are explicitly known. This note provides a simple characterization of all operators saturating the upper and the lower bound.

This paper is pertained with the problem of admissibility analysis of uncertain discrete-time nonlinear singular systems by adopting the state-space Takagi-Sugeno fuzzy model with time-delays and norm-bounded parameter uncertainties. Lyapunov Krasovskii functionals are constructed to obtain delay-dependent stability condition in terms of linear matrix inequalities, which is dependent on the low...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید