Results 31 to 40 of about 3,534,092 (344)

Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization [PDF]

open access: yesIEEE Transactions on Signal Processing, 2015
Given a symmetric nonnegative matrix A, symmetric nonnegative matrix factorization (symNMF) is the problem of finding a nonnegative matrix H, usually with much fewer columns than A, such that A ≈ HHT.
A. Vandaele   +4 more
semanticscholar   +1 more source

A New Symmetric Rank One Algorithm for Unconstrained Optimization [PDF]

open access: yesAl-Rafidain Journal of Computer Sciences and Mathematics, 2011
In this paper, a new symmetric rank one for unconstrained optimization problems is presented. This new algorithm is used to solve symmetric and positive definite matrix.
Abbas Al-Bayati, Salah Shareef
doaj   +1 more source

Decompositions of ideals of minors meeting a submatrix [PDF]

open access: yes, 2015
We compute the primary decomposition of certain ideals generated by subsets of minors in a generic matrix or in a generic symmetric matrix, or subsets of Pfaffians in a generic skew-symmetric matrix.
Neuerburg, Kent M., Teitler, Zach
core   +3 more sources

Symmetric functions and the Vandermonde matrix

open access: yesJournal of Computational and Applied Mathematics, 2004
AbstractThis work deduces the lower and the upper triangular factors of the inverse of the Vandermonde matrix using symmetric functions and combinatorial identities. The L and U matrices are in turn factored as bidiagonal matrices. The elements of the upper triangular matrices in both the Vandermonde matrix and its inverse are obtained recursively. The
Oruc, HALİL, Akmaz, HK
openaire   +3 more sources

Symmetric multisplitting of a symmetric positive definite matrix

open access: yesLinear Algebra and its Applications, 1998
AbstractA parallel symmetric multisplitting method for solving a symmetric positive system Ax = b is presented. Here the s.p.d. (symmetric positive definite) matrix A need not be assumed in a special form (e.g. the dissection form (R.E. White, SIAM J. Matrix Anal. Appl. 11 (1990) 69–82).
Zhi-Hao Cao, Zhong-Yun Liu
openaire   +2 more sources

Orbit Closure Hierarchies of Skew-symmetric Matrix Pencils

open access: yesSIAM Journal on Matrix Analysis and Applications, 2014
We study how small perturbations of a skew-symmetric matrix pencil may change its canonical form under congruence. This problem is also known as the stratification problem of skew-symmetric matrix pencil orbits and bundles. In other words, we investigate
Andrii Dmytryshyn, B. Kågström
semanticscholar   +1 more source

Generalized matrix functions, determinant and permanent

open access: yesپژوهش‌های ریاضی, 2022
Introduction Since linear and multilinear algebra has many applications in different branches of sciences, the attention of many mathematicians has been attracted to it in recent decades. The determinant and the permanent are the most important functions
Mohammad Hossein Jafari, Ali Reza Madadi
doaj  

A Non-Iterative Method for the Difference of Means on the Lie Group of Symmetric Positive-Definite Matrices

open access: yesMathematics, 2022
A non-iterative method for the difference of means is presented to calculate the log-Euclidean distance between a symmetric positive-definite matrix and the mean matrix on the Lie group of symmetric positive-definite matrices.
Xiaomin Duan   +3 more
doaj   +1 more source

Symmetrical parametrizations of the lepton mixing matrix [PDF]

open access: yesPhysical Review D, 2011
Advantages of the original symmetrical form of the parametrization of the lepton mixing matrix are discussed. It provides a conceptually more transparent description of neutrino oscillations and lepton number violating processes like neutrinoless double beta decay, clarifying the significance of Dirac and Majorana phases.
Rodejohann, Werner   +1 more
openaire   +5 more sources

An iterative solution method for linear systems of which the coefficient matrix is a symmetric -matrix

open access: yes, 1977
A particular class of regular splittings of not necessarily symmetric M-matrices is proposed. If the matrix is symmetric, this splitting is combined with the conjugate-gradient method to provide a fast iterative solution algorithm.
J. Meijerink, H. A. Vorst
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy