𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for generating all Kekulé patterns of a generalized benzenoid system

✍ Scribed by Xiao-feng Guo; Fuji Zhang

Publisher
Springer
Year
1993
Tongue
English
Weight
532 KB
Volume
12
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Accurate and Efficient Algorithm for
An Accurate and Efficient Algorithm for the Computation of the Characteristic Polynomial of a General Square Matrix
✍ S. Rombouts; K. Heyde 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 99 KB

An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant quantum Monte-Carlo methods.

An algorithm for the realization of gene
An algorithm for the realization of generalized linear systems via Taylor series expansion about an arbitrary point “a”
✍ M.A. Christodoulou; G. Vachtsevanos; B.G. Mertzios 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 432 KB

An algorithm is developed for the realization of generalized state space linear systems via Taylor series expansion about a nominal point <<a". The algorithm provides minimal, jinite dimensional realizations when the data of the external description, such as the impulse response or the frequency res

An iterative algorithm based on -proxima
An iterative algorithm based on -proximal mappings for a system of generalized implicit variational inclusions in Banach spaces
✍ K.R. Kazmi; M.I. Bhat; Naeem Ahmad 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 751 KB

In this paper, we give the notion of M-proximal mapping, an extension of P-proximal mapping given in [X.P. Ding, F.Q. Xia, A new class of completely generalized quasivariational inclusions in Banach spaces, J. Comput. Appl. Math. 147 (2002) 369-383], for a nonconvex, proper, lower semicontinuous and