Results 11 to 20 of about 156 (30)

A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem

open access: yesEURO Journal on Computational Optimization, 2019
The plain Newton-min algorithm for solving the linear complementarity problem (LCP) “0⩽x⊥(Mx+q)⩾0” can be viewed as an instance of the plain semismooth Newton method on the equational version “min(x,Mx+q)=0” of the problem.
Jean-Pierre Dussault   +2 more
doaj   +1 more source

Generalized modularity matrices [PDF]

open access: yes, 2015
Various modularity matrices appeared in the recent literature on network analysis and algebraic graph theory. Their purpose is to allow writing as quadratic forms certain combinatorial functions appearing in the framework of graph clustering problems. In
D. Fasino   +12 more
core   +5 more sources

A note on completing quasi-distance and distance matrices

open access: yesSpecial Matrices, 2019
We give a necessary and sufficient condition for the existence of a quasi-distance matrix where some positive off-diagonal entries have been prescribed. Moreover, we give an algorithm for obtaining such a matrix.
Zhang Yulin   +2 more
doaj   +1 more source

Harmonic reconstruction systems [PDF]

open access: yes, 2013
This paper considers group reconstruction systems (GRS’s), for finite dimensional real or complex Hilbert spaces H, that are associated with unitary representations of finite abelian groups.
Morillas, Patricia Mariela
core   +4 more sources

Characterizations of Mersenne and 2-rooted primes [PDF]

open access: yes, 2015
We give several characterizations of Mersenne primes (Theorem 1.1) and of primes for which 2 is a primitive root (Theorem 1.2). These characterizations involve group algebras, circulant matrices, binomial coefficients, and bipartite graphs.Comment: 19 ...
Chebolu, Sunil K.   +2 more
core   +1 more source

On certain multivariate Vandermonde determinants whose variables separate

open access: yes, 2014
We prove that for almost square tensor product grids and certain sets of bivariate polynomials the Vandermonde determinant can be factored into a product of univariate Vandermonde determinants. This result generalizes the conjecture [Lemma 1, L.
De Marchi, Stefano, Usevich, Konstantin
core   +1 more source

Explicit inverse of a tridiagonal (p,r)-Toeplitz matrix [PDF]

open access: yes, 2018
We have named tridiagonal (p,r)–Toeplitz matrix to those tridiagonal matrices in which each diagonal is a quasi–periodic sequence, d(p+j)=rd(j), so with period p¿N but multiplied by a real number r. We present here the necessary and sufficient conditions
Encinas Bachiller, Andrés Marcos   +1 more
core   +2 more sources

Global product structure for a space of special matrices

open access: yes, 2017
The importance of the Hurwitz Metzler matrices and the Hurwitz symmetric matrices can be appreciated in different applications: communication networks, biology and economics are some of them. In this paper, we use an approach of differential topology for
Aguirre-Hernández, Baltazar   +3 more
core   +1 more source

Some spectral bounds for the harmonic matrix

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017
The aim of this note is to establish new spectral bounds for the harmonic matrix.
Das Kinkar Ch., Fonseca Carlos M. da
doaj   +1 more source

Patterns with several multiple eigenvalues

open access: yesSpecial Matrices, 2014
Identified are certain special periodic diagonal matrices that have a predictable number of pairedeigenvalues. Since certain symmetric Toeplitz matrices are special cases, those that have several multiple 5eigenvalues are also investigated further.
Dorsey J., Johnson C.R., Wei Z.
doaj   +1 more source

Home - About - Disclaimer - Privacy