Results 31 to 40 of about 243,973 (317)

Second order accurate distributed eigenvector computation for extremely large matrices

, 2009
We propose a second-order accurate method to estimate the eigenvectors of extremely large matrices thereby addressing a problem of relevance to statisticians working in the analysis of very large datasets.
d'Aspremont, Alexandre, Karoui, Noureddine El   +1 more
core   +2 more sources

Partial eigenvalue assignment problem of linear control systems using orthogonality relations [PDF]

Acta Montanistica Slovaca, 2006
The partial eigenvalue assignment is the problem of reassigning a part of the open-loop spectrum of a linear system by a feedback control, leaving the rest of the spectrum invariant.
Mohamed A. Ramadan, Ehab A. El - Sayed
doaj  

Spectrum of free-form Sudoku graphs

Open Mathematics, 2018
A free-form Sudoku puzzle is a square arrangement of m ×m cells such that the cells are partitioned into m subsets (called blocks) of equal cardinality. The goal of the puzzle is to place integers 1, . .
Abudayah Mohammad, Alomari Omar, Sander Torsten   +2 more
doaj   +1 more source

Galerkin eigenvector approximations [PDF]

Mathematics of Computation, 2000
39 ...
openaire   +3 more sources

The Spectrum of the Neumann Matrix with Zero Modes [PDF]

, 2002
We calculate the spectrum of the matrix M' of Neumann coefficients of the Witten vertex, expressed in the oscillator basis including the zero-mode a_0. We find that in addition to the known continuous spectrum inside [-1/3,0) of the matrix M without the ...
, B. Feng, Bo Feng, D. Gaiotto, D.J. Gross, D.J. Gross, D.J. Gross, D.J. Gross, G. Moore, H. Hata, K. Furuuchi, K. Okuyama, K. Okuyama, L. Bonora, L. Rastelli, L. Rastelli, L. Rastelli, L. Rastelli, L. Rastelli, L. Rastelli, L. Rastelli, L. Rastelli, L. Rastelli, M.R. Douglas, Nicolas Moeller, P. Mukhopadhyay, T. Okuda, Yang-Hui He   +27 more
core   +3 more sources

Uplifting edges in higher-order networks: Spectral centralities for non-uniform hypergraphs

AIMS Mathematics
Spectral analysis of networks states that many structural properties of graphs, such as the centrality of their nodes, are given in terms of their adjacency matrices.
Gonzalo Contreras-Aso , Cristian Pérez-Corral, Miguel Romance   +2 more
doaj   +1 more source

Eigenvector dreaming

Journal of Statistical Mechanics: Theory and Experiment
Abstract Among the performance-enhancing procedures for Hopfield-type networks that implement associative memory, Hebbian unlearning (HU) (or dreaming) strikes for its simplicity and lucid biological interpretation. However, it does not easily lend to a clear analytical understanding.
Benedetti, Marco, Carillo, Louis, Marinari, Enzo, Mézard, Marc   +3 more
openaire   +4 more sources

A First Approach to Quantum Logical Shape Classification Framework

Mathematics
Quantum logic is a well-structured theory, which has recently received some attention because of its fundamental relation to quantum computing. However, the complex foundation of quantum logic borrowing concepts from different branches of mathematics as ...
Alexander Köhler, Marvin Kahra, Michael Breuß   +2 more
doaj   +1 more source

Approximate eigenvectors as preconditioner

Linear Algebra and its Applications, 2000
Given approximate eigenvector matrix of a Hermitian nonsingular matrix H, the spectral decomposition of H can be obtained by computing H´=*H and then diagonalizing H´. This work addresses the issue of numerical stability of the transition from H to H´ in finite precision arithmetic.
Krešimir Veselić, Zlatko Drmač
openaire   +3 more sources

Reversible Self-Dual Codes Over the Ring F₂ + uF₂

IEEE Access
In this study, we introduce bisymmetric self-dual codes over the finite field ${\mathbb F}_{2}$ of order two. We developed a method to generate binary bisymmetric self-dual codes from a small-length bisymmetric self-dual code by increasing its length ...
Hyun Jin Kim, Whan-Hyuk Choi
doaj   +1 more source