Zobrazeno 1 - 10
of 121
pro vyhledávání: '"65F18"'
We consider a network of identical agents, coupled through linear asymmetric coupling. An important case is when each agent has an asymptotically stable periodic orbit, so that the full network inherits a synchronous periodic orbit, but also chaotic
Externí odkaz:
http://arxiv.org/abs/2408.01066
Autor:
Dieci, Luca, Pugliese, Alessandro
Given a set of $n$ distinct real numbers, our goal is to form a symmetric, unreduced, tridiagonal, matrix with those numbers as eigenvalues. We give an algorithm which is a stable implementation of a naive algorithm forming the characteristic polynom
Externí odkaz:
http://arxiv.org/abs/2311.02677
Autor:
Abiad, Aida, Curtis, Bryan A., Flagg, Mary, Hall, H. Tracy, Lin, Jephian C. -H., Shader, Bryan
The inverse eigenvalue problem studies the possible spectra among matrices whose off-diagonal entries have their zero-nonzero patterns described by the adjacency of a graph $G$. In this paper, we refer to the $i$-nullity pair of a matrix $A$ as $(\op
Externí odkaz:
http://arxiv.org/abs/2310.13884
Autor:
Díaz, Roberto C., Julio, Ana I.
All graphs considered are simple and undirected. The Inverse Eigenvalue Problem of a Graph $G$ (IEP-G) aims to find all possible spectra for matrices whose $(i,j)-$entry, for $i\neq j$, is nonzero precisely when $i$ is adjacent to $j$. A cluster in a
Externí odkaz:
http://arxiv.org/abs/2303.09739
Autor:
Van Buggenhout, Niel
Sobolev orthogonal polynomials are polynomials orthogonal with respect to a Sobolev inner product, an inner product in which derivatives of the polynomials appear. They satisfy a long recurrence relation that can be represented by a Hessenberg matrix
Externí odkaz:
http://arxiv.org/abs/2302.10691
We consider different phase spaces for the Toda flows and the less familiar SVD flows. For the Toda flow, we handle symmetric and non-symmetric matrices with real simple eigenvalues, possibly with a given profile. Profiles encode, for example, band m
Externí odkaz:
http://arxiv.org/abs/2302.07144
The inverse eigenvalue problem of a graph $G$ is the problem of characterizing all lists of eigenvalues of real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of $G$. The strong spectral property is a powerful tool in
Externí odkaz:
http://arxiv.org/abs/2302.01670
Often, polynomials or rational functions, orthogonal for a particular inner product are desired. In practical numerical algorithms these polynomials are not constructed, but instead the associated recurrence relations are computed. Moreover, also typ
Externí odkaz:
http://arxiv.org/abs/2302.00355
In this work, we study the numerical solution of inverse eigenvalue problems from a machine learning perspective. Two different problems are considered: the inverse Strum-Liouville eigenvalue problem for symmetric potentials and the inverse transmiss
Externí odkaz:
http://arxiv.org/abs/2212.04279
Autor:
Li, Zihao, Lim, Lek-Heng
We show that the global minimum solution of $\lVert A - BXC \rVert$ can be found in closed-form with singular value decompositions and generalized singular value decompositions for a variety of constraints on $X$ involving rank, norm, symmetry, two-s
Externí odkaz:
http://arxiv.org/abs/2209.14954