GEOMETRIC CHARACTERIZATION OF LEWIS STRUCTURE ALGORITHM

Authors
BONILLA M MALABRE M
Citation
M. Bonilla et M. Malabre, GEOMETRIC CHARACTERIZATION OF LEWIS STRUCTURE ALGORITHM, Circuits, systems, and signal processing, 13(2-3), 1994, pp. 255-272
Citations number
9
Categorie Soggetti
Engineering, Eletrical & Electronic
Journal title
Circuits, systems, and signal processing → ACNP
ISSN journal
0278081X
Volume
13
Issue
2-3
Year of publication
1994
Pages
255 - 272
Database
ISI
SICI code
0278-081X(1994)13:2-3<255:GCOLSA>2.0.ZU;2-4
Abstract
A geometric interpretation of the Lewis Structure Algorithm (LSA) is g iven in terms of precise projection maps directly defined from the (E, A, B, C) maps of the system. An extended version of LSA is offered wh ich, in addition to this geometric information, also provides in a dir ect way, and within the same (E, A, B, C) class of models, a left inve rse (if any) of the system. An example is given.