Results 71 to 80 of about 256 (175)

Potential counter-examples to a conjecture on the column space of the adjacency matrix

Special Matrices
Attempts to resolve the Akbari-Cameron-Khosrovshahi-conjecture have so far focused on the rank of a matrix. The conjecture claims that there exists a nonzero (0, 1)-vector in the row space of a (0, 1)-adjacency matrix A{\bf{A}} of a graph GG, that is not
Sciriha Irene, Kaur Bableen, Borg James L., Debono Mark   +3 more
doaj   +1 more source

Sombor spectra of chain graphs. [PDF]

Heliyon, 2023
Imran M, Rather BA.
europepmc   +1 more source

AN EFFICIENT GAUSS-NEWTON ALGORITHM FOR SYMMETRIC LOW-RANK PRODUCT MATRIX APPROXIMATIONS [PDF]

, 2015
. We derive and study a Gauss-Newton method for computing a symmetric low-rank product XXT, where X ∈ Rn×k for k < n, that is the closest to a given symmetric matrix A ∈ Rn×n in Frobenius norm.
Wen, Zaiwen, Zhang, Yin, Zaiwen Wen, Yin Zhang, Xin Liu, Liu, Xin   +5 more
core   +1 more source

© Hindawi Publishing Corp. A NOTE ON THE SPECTRA OF TRIDIAGONAL MATRICES

, 2003
Using orthogonal polynomials, we give a different approach to some recent results on tridiagonal matrices. 2000 Mathematics Subject Classification: 15A18. 1. Introduction and preliminaries.
J. Petronilho, C. M. Da Fonseca
core  

Some stable and closed-shell structures of anticancer drugs by graph theoretical parameters. [PDF]

Heliyon, 2023
Koam ANA, Ahmad A, Azeem M, Hakami KH, Elahi K.   +4 more
europepmc   +1 more source

Geometric multiplicity margin for a submatrix [PDF]

, 2002
Let G be a square complex matrix with less than k nonconstant invariant factors. We find a complex matrix that gives an optimal approximation to G among all possible matrices that have more than or equal to k invariant factors, obtained by varying only ...
González de Durana García, José María, Gracia Melero, Juan Miguel   +1 more
core   +1 more source

Extreme Eigenvalues Of Real Symmetric Toeplitz Matrices

, 2000
We exploit the even and odd spectrum of real symmetric Toeplitz matrices for the computation of their extreme eigenvalues, which are obtained as the solutions of spectral, or secular, equations.
A. Melman, A Melman
core  

Convergence analysis of non-matching finite elements for a linear monotone additive Schwarz scheme for semi-linear elliptic problems

Nonlinear Engineering
In this article, we are interested in the standard finite element approximation method of linear additive Schwarz iterations for a class of semi-linear elliptic problems, for two subdomains, in the context of non-matching grids.
Al Farei Qais, Boulbrachene Messaoud
doaj   +1 more source

THE COPOSITIVE COMPLETION PROBLEM: UNSPECIFIED DIAGONAL ENTRIES [PDF]

, 2006
In [L. Hogben, C.R. Johnson, R. Reams, The copositive matrix completion problem, Linear Algebra Appl. 408 (2005) 207–211] it was shown that any partial (strictly) copositive matrix all of whose diagonal entries are specified can be completed to a ...
Leslie Hogben, Hogben, Leslie
core   +1 more source

On The Spectra Of Sums Of Orthogonal Projections With Applications To Parallel Computing

, 1991
. Many parallel iterative algorithms for solving symmetric, positive definite problems proceed by solving in each iteration, a number of independent systems on subspaces.
Petter E. Bj��rstad, Jan Mandel, Petter E. Bjørstad   +2 more
core