Real-domain QR decomposition models employing zeroing neural network and time-discretization formulas for time-varying matrices

2021 ◽  
Vol 448 ◽  
pp. 217-227
Author(s):  
Zhenyu Li ◽  
Yunong Zhang ◽  
Liangjie Ming ◽  
Jinjin Guo ◽  
Vasilios N. Katsikis
Keyword(s):  
Neural Network ◽  
Time Discretization ◽  
Qr Decomposition ◽  
Time Varying ◽  
Real Domain ◽  
Decomposition Models

PLATO'S PHAEDO: ARE THE PHILOSOPHERS’ PLEASURES OF LEARNING PURE PLEASURES?

2019 ◽  
Vol 69 (2) ◽  
pp. 566-584
Author(s):  
Georgia Mouroutsou
Keyword(s):  
The Body ◽  
Ordinary People ◽  
Real Domain

Though Plato's Phaedo does not focus on pleasure, some considerable talk on pleasure takes place in it. Socrates argues for the soul's immortality and, while doing so, hopes to highlight to his companions how important it is to take care of our soul by focussing on the intellect and by neglecting the bodily realm as far as is possible in this life. Doing philosophy, so his argument goes, is something like dying, if we grant that death is the separation of the soul from the body and notice that genuine philosophers wish nothing else than to be detached from the bodily realm. For indulging into bodily pleasures has detrimental consequences on the soul, impeding the search of truth and distorting reality, and so philosophers should undertake to purify themselves from all bodily concerns and gratifications and love the objects of learning and knowledge without deviation and distraction. On the contrary, ordinary people fall for the bodily realm as the only real domain that should therefore be of priority and of their earnest concern.

Partially observable semi-Markov reward processes

1993 ◽  
Vol 30 (3) ◽  
pp. 548-560 ◽  
Author(s):  
Yasushi Masuda
Keyword(s):  
Markov Process ◽  
Counting Process ◽  
Probabilistic Interpretation ◽  
Real Domain ◽  
Semi Markov Process ◽  
Reward Process ◽  
Markov Reward ◽  
Partially Observable ◽  
Joint Behavior

The main objective of this paper is to investigate the conditional behavior of the multivariate reward process given the number of certain signals where the underlying system is described by a semi-Markov process and the signal is defined by a counting process. To this end, we study the joint behavior of the multivariate reward process and the multivariate counting process in detail. We derive transform results as well as the corresponding real domain expressions, thus providing clear probabilistic interpretation.

scholarly journals Lower Bounds for Nodal Sets of Eigenfunctions

2011 ◽  
Vol 306 (3) ◽  
pp. 777-784 ◽  
Author(s):  
Tobias H. Colding ◽  
William P. Minicozzi
Keyword(s):  
Lower Bounds ◽  
Nodal Sets

Linear Differential Equations in the Real Domain

1967 ◽  
Vol 51 (378) ◽  
pp. 364
Author(s):  
R. P. Gillespie ◽  
Kenneth S. Miller
Keyword(s):  
Differential Equations ◽  
Linear Differential Equations ◽  
The Real ◽  
Real Domain ◽  
Linear Differential

Concise Equations for Rotor Dynamics Analysis

1995 ◽  
Author(s):  
W. J. Chen
Keyword(s):  
Equations Of Motion ◽  
Rotor Dynamics ◽  
Memory Storage ◽  
The Other ◽  
Dynamics Analysis ◽  
Real Domain ◽  
The Matrix ◽  
System Equations ◽  
Ordering Algorithms ◽  
Matrix Bandwidth

Abstract Concise equations for rotor dynamics analysis are presented. Two coordinate ordering methods are introduced in the element equations of motion. One is in the real domain and the other is in the complex domain. The two proposed ordering algorithms lead to more compact element matrices. A station numbering technique is also proposed for the system equations during the assembly process. This numbering technique can minimize the matrix bandwidth, the memory storage and can increase the computational efficiency.

A Note on Computational Rotor Dynamics

1998 ◽  
Vol 120 (1) ◽  
pp. 228-233 ◽  
Author(s):  
W. J. Chen
Keyword(s):  
Computational Efficiency ◽  
Equations Of Motion ◽  
Rotor Dynamics ◽  
Memory Storage ◽  
Rotor Systems ◽  
Real Domain ◽  
The Matrix ◽  
System Equations ◽  
Ordering Algorithms ◽  
Matrix Bandwidth

Concise equations for improvements in computational efficiency on dynamics of rotor systems are presented. Two coordinate ordering methods are introduced in the element equations of motion. One is in the real domain and the other is in the complex domain. The two coordinate ordering algorithms lead to compact element matrices. A station numbering technique is also proposed for the system equations during the assembly process. The proposed numbering technique can minimize the matrix bandwidth, the memory storage and can increase the computational efficiency. Numerical examples are presented to demonstrate the benefit of the proposed algorithms.

Sign in / Sign up

Export Citation Format

Share Document