Circulants, displacements and decompositions of matrices
نویسندگان
چکیده
منابع مشابه
Decompositions of complete graphs into circulants
Let C(n;S) be a fixed circulant. The main problem is to determine the spectrum for values of v such that the complete graph Kv admits an edge-disjoint decomposition into subgraphs each of which is isomorphic to C(n;S). A complete solution in not to be expected since some instances correspond to famous existence problems (for instance, the existence of BIBD’s with λ = 1). On the other hand, the ...
متن کاملDecompositions of displacements of thin structures
In this study we present first the main theorem of the unfolding method in linearized elasticity. Then we prove that every displacement of a thin structure (curved rod or shell) is the sum of an elementary displacement and a warping. Thanks to the previous theorem we obtain sharp estimates of the displacements of this decomposition. Résumé. Dans cette étude on présente d’abord le théorème fonda...
متن کاملSum Decompositions of Symmetric Matrices
Given a symmetric n X n matrix A and n numbers rl," " rn , necessary and sufficient conditions for the existence of a matrix B, with a given zero pattern, with row sums r 1 , ... , rn , and such that A = B + BT are proven. If the pattern restriction * The research of all three authors was supported by the Funda~ao Calouste Gulbenkian, Lisboa. tThe research of this author was carried out within ...
متن کاملOn Smooth Decompositions of Matrices
In this paper we consider smooth orthonormal decompositions of smooth time varying matrices. Among others, we consider QR–, Schur–, and singular value decompositions, and their block-analogues. Sufficient conditions for existence of such decompositions are given and differential equations for the factors are derived. Also generic smoothness of these factors is discussed.
متن کاملCUR Decompositions, Similarity Matrices, and Subspace Clustering
A general framework for solving the subspace clustering problem using the CUR decomposition is presented. The CUR decomposition provides a natural way to construct similarity matrices for data that come from a union of unknown subspaces U = M ⋃ i=1 Si. The similarity matrices thus constructed give the exact clustering in the noise-free case. A simple adaptation of the technique also allows clus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Integral Equations and Operator Theory
سال: 1992
ISSN: 0378-620X,1420-8989
DOI: 10.1007/bf01200697