Results 31 to 40 of about 9,160 (266)
Green Matrices, Minors and Hadamard Products
Axioms, 2023 Green matrices are interpreted as discrete version of Green functions and are used when working with inhomogeneous linear system of differential equations.
Jorge Delgado +2 more
doaj +1 more source
On Factorizations of Upper Triangular Nonnegative Matrices of Order Three
Discrete Dynamics in Nature and Society, 2015 Let T3(N0) denote the semigroup of 3×3 upper triangular matrices with nonnegative integral-valued entries. In this paper, we investigate factorizations of upper triangular nonnegative matrices of order three.
Yi-Zhi Chen
doaj +1 more source
Factorization of nonnegative matrices—II
Linear Algebra and its Applications, 1978 AbstractSuppose A is an n×n nonnegative matrix. Necessary and sufficient conditions are given for A to be factored as LU, where L is a lower triangular nonnegative matrix, and U is an upper triangular nonnegative matrix with uii = 1.
Lau, Cony M., Markham, Thomas L.
openaire +2 more sources
On the Total Positivity and Accurate Computations of r-Bell Polynomial Bases
Axioms, 2023 A new class of matrices defined in terms of r-Stirling numbers is introduced. These r-Stirling matrices are totally positive and determine the linear transformation between monomial and r-Bell polynomial bases.
Esmeralda Mainar +2 more
doaj +1 more source
BMC Bioinformatics, 2023 Background Identifying drug–target interactions (DTIs) plays a key role in drug development. Traditional wet experiments to identify DTIs are costly and time consuming. Effective computational methods to predict DTIs are useful to speed up the process of
Junjun Zhang, Minzhu Xie
doaj +1 more source
Factorizations of matrices over semirings
Linear Algebra and its Applications, 2003 A semiring \(R\) with identity satisfies all ring axioms but one: an additive inverse of an element in \(R\) is not required. All matrices below have entries in \(R\). The semiring rank of a matrix \(A\) is the smallest \(r\) such that \(A=BC\), where \(B\) is an \(n\times r\) matrix and \(C\) is an \(r\times n\) matrix.
Hyuk Cho, Han, Kim, Suh-Ryung
openaire +1 more source
On the Efficient Reconstruction of Displacements in FETI Methods for Contact Problems
Advances in Electrical and Electronic Engineering, 2017 The final step in the solution of contact problems of elasticity by FETI-based domain decomposition methods is the reconstruction of displacements corresponding to the Lagrange multipliers for ''gluing'' of subdomains and non-penetration conditions.
David Horak, Zdenek Dostal, Radim Sojka
doaj +1 more source
Inherited LU-factorizations of matrices
Linear Algebra and its Applications, 2007 Assume that \(A\) is an \(n\times n\) matrix with entries in a ring \(\mathcal{R}\) and that \(a_{11}, a_{22},\dots,a_{nn}\) are invertible elements in \(\mathcal{R}\). Write \(A=B+D+C\) where \(B\) is strictly lower triangular, \(C\) is strictly upper triangular, and \(D\) is diagonal. The authors consider various factorizations containing \(B\), \(D\)
Arav, Marina +2 more
openaire +2 more sources
Exact Determinants of Some Special Circulant Matrices Involving Four Kinds of Famous Numbers
Abstract and Applied Analysis, 2014 Circulant matrix family is used for modeling many problems arising in solving various differential equations. The RSFPLR circulant matrices and RSLPFL circulant matrices are two special circulant matrices.
Xiaoyu Jiang, Kicheon Hong
doaj +1 more source
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