Results 31 to 40 of about 115,750 (273)
Abstract and Applied Analysis, 2014 Circulant matrices may play a crucial role in solving various differential equations. In this paper, the techniques used herein are based on the inverse factorization of polynomial.
Tingting Xu, Zhaolin Jiang, Ziwu Jiang
doaj +1 more source
Novel Algorithms Based on Majorization Minimization for Nonnegative Matrix Factorization
IEEE Access, 2019 Matrix decomposition is ubiquitous and has applications in various fields like speech processing, data mining and image processing to name a few. Under matrix decomposition, nonnegative matrix factorization is used to decompose a nonnegative matrix into ...
R. Jyothi, Prabhu Babu, Rajendar Bahl
doaj +1 more source
Factorization of generalized γ-generating matrices [PDF]
Journal of Mathematical Sciences, 2018 The class of \(\gamma\)-generating matrices and its subclasses of regular and singular \(\gamma\)-generating matrices were introduced in [\textit{D. Z. Arov}, J. Sov. Math. 52, No. 6, 3487--3491 (1990; Zbl 0718.41004); translation from Teor. Funkts., Funkts. Anal. Prilozh.
openaire +3 more sources
Using Dynamic Multi-Task Non-Negative Matrix Factorization to Detect the Evolution of User Preferences in Collaborative Filtering. [PDF]
PLoS ONE, 2015 Predicting what items will be selected by a target user in the future is an important function for recommendation systems. Matrix factorization techniques have been shown to achieve good performance on temporal rating-type data, but little is known about
Bin Ju +4 more
doaj +1 more source
On factorized Lax pairs for classical many-body integrable systems
, 2019 In this paper we study factorization formulae for the Lax matrices of the classical Ruijsenaars-Schneider and Calogero-Moser models. We review the already known results and discuss their possible origins.
Vasilyev, M., Zotov, A.
core +1 more source
Pentadiagonal Companion Matrices
Special Matrices, 2016 The class of sparse companion matrices was recently characterized in terms of unit Hessenberg matrices. We determine which sparse companion matrices have the lowest bandwidth, that is, we characterize which sparse companion matrices are permutationally ...
Eastman Brydon, Vander Meulen Kevin N.
doaj +1 more source
Arf numerical semigroups with high multiplicity via Gröbner basis
Applied Mathematics in Science and Engineering, 2023 In this paper, Arf numerical semigroups with high multiplicity are given. RF (Row Factorization)-matrices, Gröbner basis are presented by writing the ideals of numerical semigroup with RF-matrices.
Belgin Özer
doaj +1 more source
Elementary Darboux transformations and factorization
, 2005 A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones.
A. B. Shabat +8 more
core +1 more source
Factorizations of Matrices over Projective-free Rings [PDF]
Algebra Colloquium, 2016 An element of a ring R is called strongly J#-clean provided that it can be written as the sum of an idempotent and an element in J#(R) that commute. In this paper, we characterize the strong J#-cleanness of matrices over projective-free rings. This extends many known results on strongly clean matrices over commutative local rings.
Chen H., Kose H., Kurtulmaz, Y.
openaire +7 more sources
The Incremental Multiresolution Matrix Factorization Algorithm
, 2017 Multiresolution analysis and matrix factorization are foundational tools in computer vision. In this work, we study the interface between these two distinct topics and obtain techniques to uncover hierarchical block structure in symmetric matrices -- an ...
Ithapu, Vamsi K. +3 more
core +1 more source