Search results for: Solvable%20Lie%20algebra

Authors: Manuel Ceballos, Juan Nunez, Angel F. Tenorio

Abstract:

The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie algebra, starting from the nonzero brackets in its law. More concretely, an algorithm is described and implemented to compute a basis for each nontrivial abelian subalgebra with the help of the symbolic computation package MAPLE. Finally, it is also shown a brief computational study for this implementation, considering both the computing time and the used memory.

Keywords: Solvable Lie algebra, maximal abelian dimension, algorithm.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1244

Authors: Hans H. Diel

Abstract:

A computer model of Quantum Theory (QT) has been developed by the author. Major goal of the computer model was support and demonstration of an as large as possible scope of QT. This includes simulations for the major QT (Gedanken-) experiments such as, for example, the famous double-slit experiment. Besides the anticipated difficulties with (1) transforming exacting mathematics into a computer program, two further types of problems showed up, namely (2) areas where QT provides a complete mathematical formalism, but when it comes to concrete applications the equations are not solvable at all, or only with extremely high effort; (3) QT rules which are formulated in natural language and which do not seem to be translatable to precise mathematical expressions, nor to a computer program. The paper lists problems in all three categories and describes also the possible solutions or circumventions developed for the computer model.

Keywords: Computability, Foundation of Quantum Mechanics, Measurement Process, Modeling.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1648

Authors: Amir T. Payandeh Najafabadi

Abstract:

This article considers the problem of evaluating infinite-time (or finite-time) ruin probability under a given compound Poisson surplus process by approximating the claim size distribution by a finite mixture exponential, say Hyperexponential, distribution. It restates the infinite-time (or finite-time) ruin probability as a solvable ordinary differential equation (or a partial differential equation). Application of our findings has been given through a simulation study.

Keywords: Ruin probability, compound Poisson processes, mixture exponential (hyperexponential) distribution, heavy-tailed distributions.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1242

Authors: Toru Murayama, Akinori Nagano, Zhi-Wei Luo

Abstract:

In this research, we study a control method of a multivehicle system while considering the limitation of communication range for each vehicles. When we control networked vehicles with limitation of communication range, it is important to control the communication network structure of a multi-vehicle system in order to keep the network-s connectivity. From this, we especially aim to control the network structure to the target structure. We formulate the networked multi-vehicle system with some disturbance and the communication constraints as a hybrid dynamical system, and then we study the optimal control problems of the system. It is shown that the system converge to the objective network structure in finite time when the system is controlled by the receding horizon method. Additionally, the optimal control probrems are convertible into the mixed integer problems and these problems are solvable by some branch and bound algorithm.

Keywords: Hybrid system, multi-vehicle system, receding horizon control, topology control.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1354