𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On coherency-based decomposition algorithms

✍ Scribed by A.J. Fossard; M. Berthelot; J.F. Magni


Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
528 KB
Volume
19
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

✦ Synopsis


A new grouping algorithm of machines into coherent areas does not imply the knowledge of the eigenvalues and eigenvectors of the system or an a priori knowledge of the number of coherent areas.


πŸ“œ SIMILAR VOLUMES


Coherency based decomposition and aggreg
✍ P.V. Kokotovic; B. Avramovic; J.H. Chow; J.R. Winkelman πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 853 KB

When coherency is interpreted via aggregation, and structural properties of the aggregates are characterized, then a relation between slow coherency and weak coupling between coherent areas can be derived for a class of large scale systems.

Numerical Algorithms Based on Characteri
✍ Tarvainen, P. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 148 KB

A new numerical solution algorithm for obstacle problems is proposed, where the characteristic domain decomposition into active and inactive subdomains separated by the free boundary is approximated by a Schwarz method. Such an approach gives an opportunity to apply fast linear system solvers to gen

A Note on the Uniqueness of Coherent Dec
✍ J.H. Koolen; V. Moulton πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 135 KB

In Bandelt and Dress Ad¨. in Math. 92 1992 , 47᎐105 the concept of a coherent decomposition of a finite metric is introduced and it is conjectured that every such metric can be decomposed into a coherent sum of prime metrics in a unique way. In this note we give a counterexample to this conjecture.