نتایج جستجو برای: matrix norm
تعداد نتایج: 402509 فیلتر نتایج به سال:
An algorithm for matrix approximation, when only some of its entries are taken into consideration, is described. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank approximations, this type of algorithms appears recently in the literature under different names, where it usually uses the Expectation-Maximization algorithm that maximizes...
In this paper the gradient based iterative algorithm is presented to solve the linear matrix equation AXB +CXD = E, where X is unknown matrix, A,B,C,D,E are the given constant matrices. It is proved that if the equation has a solution, then the unique minimum norm solution can be obtained by choosing a special kind of initial matrices. Two numerical examples show that the introduced iterative a...
During state perception of a power system, fragments harmonic data are inevitably lost owing to the loss synchronization signals, transmission delays, instrument failures, or other factors. A recovery method is proposed based on multivariate norm matrix in this paper. The involves dynamic time warping for correlation analysis data, normalized cuts clustering power-quality monitoring devices, an...
This note demonstrates that it is possible to bound the expectation of an arbitrary norm of a random matrix drawn from the Stiefel manifold in terms of the expected norm of a standard Gaussian matrix with the same dimensions. A related comparison holds for any convex function of a random matrix drawn from the Stiefel manifold. For certain norms, a reversed inequality is also valid. Mathematics ...
Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publications. In this lecture we describe applications of low rank approximation in optimization. Firstly, let us give a short overview of the last lecture. We defined the operator norm of a matrix ‖.‖2 and the Frobenius norm ‖.‖F and we showed that the best rank k approximation of a given matrix M is the ...
In this paper the gradient based iterative algorithm is presented to solve the linear matrix equation AXB +CXD = E, where X is unknown matrix, A,B,C,D,E are the given constant matrices. It is proved that if the equation has a solution, then the unique minimum norm solution can be obtained by choosing a special kind of initial matrices. Two numerical examples show that the introduced iterative a...
We study the problem of matrix estimation and matrix completion under a general framework. This framework includes several important models as special cases such as the gaussian mixture model, mixed membership model, bi-clustering model and dictionary learning. We consider the optimal convergence rates in a minimax sense for estimation of the signal matrix under the Frobenius norm and under the...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید