Results 21 to 30 of about 1,095,836 (281)
On Inverse Nodal Problem and Multiplicities of Eigenvalues of a Vectorial Sturm-Liouville Problem
An m-dimensional vectorial inverse nodal Sturm-Liouville problem with eigenparameter-dependent boundary conditions is studied. We show that if there exists an infinite sequence ynj,rx,λnj,r2j=1∞ of eigenfunctions which are all vectorial functions of type
Xiaoyun Liu
doaj +1 more source
The symmetric inverse M-matrix completion problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Johnson, Charles R., Smith, Ronald L.
openaire +1 more source
Inverse M-matrix inequalities and generalized ultrametric matrices
The authors introduce a class of matrices called generalized ultrametric matrices. That class is defined in terms of triangles in the weighted graph of the matrix, and it contains the ultrametric matrices as well as some unsymmetric matrices. The authors show that a generalized ultrametric matrix is the inverse of a row diagonally dominant \(M\)-matrix
McDonald, J.J. +3 more
openaire +1 more source
Inverse M-matrix completion problem with zeros in the inverse completion
A partially specified matrix \(A\) is said to be combinatorially symmetric if \(a_{ij}\) is specified if and only if \(a_{ji}\) is specified. The completion problem considered is to find the unspecified elements such that its completion is the inverse of an \(M\)-matrix. In the combinatorially symmetric case, this was solved by \textit{C. R.
Jordán, C. +2 more
openaire +1 more source
Nonnegative alternating circulants leading to M-matrix group inverses
Let \(\mathcal C\) denote the set of all irreducible nonnegative alternating circulant matrices, i.e. all matrices \(A= \sum^{n- 1}_{i= 0} \alpha_i P^i\), when \(P\) is an \(n\)th order cyclic permutation matrix, where \(\alpha_i> 0\) and \(\alpha_i= \alpha_j\) for \(i= j\pmod 2\).
Chen, Yonghong +2 more
openaire +2 more sources
An inequality for the hadamard product of an M-matrix and an inverse M-matrix
Let A and B be M-matrices and let \(A\circ B=[a_{ik}b_{ik}]\) be their Hadamard product. The authors obtain the following estimates from below for the smallest eigenvalue \(q(A\circ B^{-1}):\) \[ (a)\quad q(A\circ B^{-1})\geq (q(A)/q(B))(\min_ iu_ iv_ i/\sum_{i}u_ iv_ i), \] where u and v are the left and the right Perron eigenvectors of B ...
Fiedler, M., Markham, Thomas L.
openaire +2 more sources
The existing inverse-free incremental learning algorithm for the regularized extreme learning machine (ELM) was based on an inverse-free algorithm to update the regularized pseudo-inverse, which was deduced from an inverse-free recursive algorithm to ...
Hufei Zhu, Yanpeng Wu
doaj +1 more source
Identities and exponential bounds for transfer matrices [PDF]
This paper is about analytic properties of single transfer matrices originating from general block-tridiagonal or banded matrices. Such matrices occur in various applications in physics and numerical analysis.
Molinari, Luca G
core +2 more sources
Arikan's exciting discovery of polar codes has provided an altogether new way to efficiently achieve Shannon capacity. Given a (constant-sized) invertible matrix $M$, a family of polar codes can be associated with this matrix and its ability to approach ...
Błasiok, Jarosław +4 more
core +1 more source
A note on computing the generalized inverse A T,S (2) of a matrix A
The generalized inverse A T,S (2) of a matrix A is a {2}-inverse of A with the prescribed range T and null space S. A representation for the generalized inverse A T,S (2) has been recently developed with the condition σ (GA| T)⊂(0,∞), where G is a matrix
Xiezhang Li, Yimin Wei
doaj +1 more source

