𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for solving the vibronic coupling problem

✍ Scribed by K.P Lawley

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
855 KB
Volume
70
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

NOSER: An algorithm for solving the inve
NOSER: An algorithm for solving the inverse conductivity problem
✍ M. Cheney; D. Isaacson; J. C. Newell; S. Simske; J. Goble πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 885 KB

The inverse conductivity problem is the mathematical problem that must be solved in order for electrical impedance tomography systems to be able to make images. Here we show how this inverse conductivity problem is related to a number of other inverse problems. We then explain the workings of an alg

An Algorithm for Solving Boundary Value
An Algorithm for Solving Boundary Value Problems
✍ Elias Deeba; S.A. Khuri; Shishen Xie πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 83 KB

In this paper a numerical algorithm, based on the decomposition technique, is presented for solving a class of nonlinear boundary value problems. The method is implemented for well-known examples, including Troesch's and Bratu's problems which have been extensively studied. The scheme is shown to be

An algorithm to solve coupled 2D rolling
An algorithm to solve coupled 2D rolling contact problems
✍ JosΓ© A. GonzΓ‘lez; RamΓ³n Abascal πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 294 KB

This work presents a new approach to the steady-state rolling contact problem for two-dimensional elastic bodies, with and without force transmission. The problem solution is achieved by minimizing a general function representing the equilibrium equation and the contact restrictions. The boundary el

An Algorithm for Solving the Factorizati
An Algorithm for Solving the Factorization Problem in Permutation Groups
✍ T. Minkwitz πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 345 KB

The factorization problem in permutation groups is to represent an element g of some permutation group G as a word over a given set S of generators of G. For practical purposes, the word should be as short as possible, but must not be minimal. Like many other problems in computational group theory,