Results 11 to 20 of about 150,142 (264)

Optimal CUR matrix decompositions [PDF]

open access: yesProceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014
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

Matrix Decomposition and Applications

open access: yesCoRR, 2022
In 1954, Alston S. Householder published Principles of Numerical Analysis, one of the first modern treatments on matrix decomposition that favored a (block) LU decomposition-the factorization of a matrix into the product of lower and upper triangular matrices.
openaire   +2 more sources

Jordan Matrix Decomposition [PDF]

open access: yesFormalized Mathematics, 2008
We follow the rules: i, j, m, n, k denote natural numbers, K denotes a field, and a, λ denote elements of K. Let us consider K, λ, n. The Jordan block of λ and n yields a matrix over K and is defined by the conditions (Def. 1). (Def. 1)(i) len (the Jordan block of λ and n) = n, (ii) width (the Jordan block of λ and n) = n, and (iii) for all i, j such ...
openaire   +1 more source

Randomized Rank-Revealing QLP for Low-Rank Matrix Decomposition

open access: yesIEEE Access, 2023
The pivoted QLP decomposition is computed through two consecutive pivoted QR decompositions. It is an approximation to the computationally prohibitive singular value decomposition (SVD). This work is concerned with a partial QLP decomposition of matrices
Maboud F. Kaloorazi   +4 more
doaj   +1 more source

Eigenvalue decomposition of a symmetric matrix over the symmetrized max-plus algebra

open access: yesDesimal, 2021
This paper discusses topics in the symmetrized max-plus algebra. In this study, it will be shown the existence of eigenvalue decomposition of a symmetric matrix over symmetrized max-plus algebra. Eigenvalue decomposition is shown by using a function that
Suroto Suroto
doaj   +1 more source

Blind Source Separation Method for Frequency-Hopping Signal in Synchronous Networking Under Underdetermined Condition [PDF]

open access: yesJisuanji gongcheng, 2020
To implement blind source separation of frequency-hopping signals in synchronous networking under underdetermined conditions,this paper proposes a frequency-hopping signal separation method based on the parallel factor analysis model and subspace ...
WANG Shaobo, GUO Ying, SUI Ping, LI Hongguang, YANG Xin
doaj   +1 more source

Double-Matrix Decomposition Image Steganography Scheme Based on Wavelet Transform with Multi-Region Coverage

open access: yesEntropy, 2022
On the basis of ensuring the quality and concealment of steganographic images, this paper proposes a double-matrix decomposition image steganography scheme with multi-region coverage, to solve the problem of poor extraction ability of steganographic ...
Ping Pan   +3 more
doaj   +1 more source

A variant of the reciprocal super Catalan matrix

open access: yesSpecial Matrices, 2015
Recently Prodinger [8] considered the reciprocal super Catalan matrix and gave explicit formulæ for its LU-decomposition, the LU-decomposition of its inverse, and obtained some related matrices. For all results, q-analogues were also presented.
Kılıç Emrah   +2 more
doaj   +1 more source

Singular value representation of the coherence Poincaré sphere

open access: yesJournal of the European Optical Society-Rapid Publications, 2022
The so-called coherence Poincaré sphere was recently introduced for geometrical visualization of the state of two-point spatial coherence of a random electromagnetic beam. The formalism and its interpretation strongly utilized a specific decomposition of
Laatikainen Jyrki   +3 more
doaj   +1 more source

Multi‐view registration based on weighted LRS matrix decomposition of motions

open access: yesIET Computer Vision, 2019
Recently, the low‐rank and sparse (LRS) matrix decomposition has been introduced as an effective mean to solve the multi‐view registration. It views each available relative motion as a block element to reconstruct one sparse matrix, which then is used to
Congcong Jin   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy