Results 1 to 10 of about 150,932 (264)
Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups [PDF]
The polar decomposition of \(A\) is \(A=UH\), where \(A\) has complex elements, \(U\) is unitary, \(H\) is Hermitian positive semi-definite. The authors identify a family of globally convergent rational iterations that preserve group structure. They show how the structure preservation leads to particularly convenient convergence tests in the case of ...
Nicholas Higham +2 more
exaly +3 more sources
Empirical Bayes Linked Matrix Decomposition. [PDF]
Data for several applications in diverse fields can be represented as multiple matrices that are linked across rows or columns. This is particularly common in molecular biomedical research, in which multiple molecular "omics" technologies may capture different feature sets (e.g., corresponding to rows in a matrix) and/or different sample populations ...
Lock EF.
europepmc +4 more sources
Fast Polar Decomposition of an Arbitrary Matrix [PDF]
The polar decomposition of an $m \times n$ matrix A of full rank, where $m \geqq n$, can be computed using a quadratically convergent algorithm of Higham [SIAM J. Sci. Statist. Comput., 7(1986), pp. 1160–1174]. The algorithm is based on a Newton iteration involving a matrix inverse.
Nicholas Higham
exaly +3 more sources
Singular Value Decomposition of Spatial Matrices
Singular value decomposition is a basic building block which is used in solution of many different problems. In cases when dimensionality of a problem exceeds two, a generalization of a singular value decomposition – tensor decompositions – are used ...
Pavel Iljin, Tatiana Samoilova
doaj +1 more source
Energy-Based Adaptive CUR Matrix Decomposition
CUR decompositions are interpretable data analysis tools that express a data matrix in terms of a small number of actual columns and/or actual rows of the data matrix.
Liwen Xu, Xuejiao Zhao, Yongxia Zhang
doaj +1 more source
Optimal CUR matrix decompositions [PDF]
The CUR decomposition of an $m \times n$ matrix $A$ finds an $m \times c$ matrix $C$ with a subset of $c < n$ columns of $A,$ together with an $r \times n$ matrix $R$ with a subset of $r < m$ rows of $A,$ as well as a $c \times r$ low-rank matrix $U$ such that the matrix $C U R$ approximates the matrix $A,$ that is, $ || A - CUR ||_F^2 \le (1+ε) |
Christos Boutsidis, David P. Woodruff
openaire +2 more sources
Multi-modal magnetic resonance imaging (MRI) is widely used for diagnosing brain disease in clinical practice. However, the high-dimensionality of MRI images is challenging when training a convolution neural network.
Liangliang Liu +5 more
doaj +1 more source
Incremental multi‐view correlated feature learning based on non‐negative matrix factorisation
In real‐world applications, large amounts of data from multiple sources come in the form of streams. This makes multi‐view feature learning cost much time when new instances rise incrementally.
Liang Zhao +3 more
doaj +1 more source
The approximating sequence Riccati equation method is an efficient approach for solving the nonlinear optimal control problems, but its neglect of nonlinear dynamics and necessary optimality condition makes the control law difficult to satisfy the ...
Jianfeng Sun, Xuesong Chen
doaj +1 more source
Improvement of CRF-Based Saliency Detection Algorithm Using Matrix Decomposition Based Features [PDF]
One of the most important processing steps in the human vision system is the detection of a scene saliency map. Since saliency map can be applied to algorithms such as segmentation, compression and image retrieval, Researchers have focused on providing ...
Mohammad Shouryabi +1 more
doaj +1 more source

