相关论文: Spectrum of MATLABs magic squares
A spectral approach to building the exterior calculus in manifold learning problems is developed. The spectral approach is shown to converge to the true exterior calculus in the limit of large data. Simultaneously, the spectral approach…
In this paper some algorithms will be presented which can be used for the calculation of zeros of polynomials and eigenvalues of polynomial matrices with a multiplicity larger than one. The numerical values calculated with MATLAB are used…
We derive, similar to Lau and Riha, a matrix formulation of a general best approximation theorem of Singer for the special case of spectral approximations of a given matrix from a given subspace. Using our matrix formulation we describe the…
We compute the spectra of the adjacency matrices of the semi-regular polytopes. A few different techniques are employed: the most sophisticated, which relates the 1-skeleton of the polytope to a Cayley graph, is based on methods akin to…
In this paper we introduce doubly symmetric functions, arising from the equivalence of particular linear combinations of Schur functions and hook Schur functions. We study algebraic and combinatorial aspects of doubly symmetric functions,…
We improve Gilbert-Varshamov bound by graph spectral method. Gilbert graph $G_{q,n,d}$ is a graph with all vectors in $\mathbb{F}_q^n$ as vertices where two vertices are adjacent if their Hamming distance is less than $d$. In this paper, we…
Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…
Eigenvalue and eigenpair backward errors are computed for matrix pencils arising in optimal control. In particular, formulas for backward errors are developed that are obtained under block-structure-preserving and…
For a closed Riemannian orbifold $O$, we compare the spectra of the Laplacian, acting on functions or differential forms, to the Neumann spectra of the orbifold with boundary given by a domain $U$ in $O$ whose boundary is a smooth manifold.…
We investigate the conditions under which systems of two differential eigenvalue equations are quasi exactly solvable. These systems reveal a rich set of algebraic structures. Some of them are explicitely described. An exemple of quasi…
By considering an empirical approximation, and a new class of operators that we will call walking operators, we construct, for any positive ND-toeplitz matrix, an infinite in all dimensions matrix, for which the inverse approximates the…
Magic sets of observables are minimal structures that capture quantum state-independent advantage for systems of $n\ge 2$ qubits and are, therefore, fundamental tools for investigating the interface between classical and quantum physics. A…
Several specific Franklin squares and magic squares are decomposed into their quotient and remainder squares. The results support the conjecture that Franklin used the Eulerian composition method to construct many of his squares. This…
Extension procedure for supermanifold ${\cal M}_{cl}$ of superfields ${\cal A}^{\imath}(\theta)$, ghost number construction are considered. Classical and $\hbar$-deformed generating (master) equations, existence theorems for their solutions…
We exhibit very small eigenvalues of the quadratic form associated to the Weil explicit formulas restricted to test functions whose support is within a fixed interval with upper bound S. We show both numerically and conceptually that the…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…
The Gram-Schmidt algorithm produces a pairwise orthogonal set from a linearly independent set of vectors in an inner product vector space V. We give a linear algorithm that constructs vectors with the same span and which have pairwise the…
We present a randomized, inverse-free algorithm for producing an approximate diagonalization of any $n \times n$ matrix pencil $(A,B)$. The bulk of the algorithm rests on a randomized divide-and-conquer eigensolver for the generalized…
Spectral functions of symmetric matrices -- those depending on matrices only through their eigenvalues -- appear often in optimization. A cornerstone variational analytic tool for studying such functions is a formula relating their…