An ultraweak variational method for parameterized linear differential-algebraic equations [PDF]
Emil Beurer +3 more
openalex +1 more source
Review of Memristors for In‐Memory Computing and Spiking Neural Networks
Memristors uniquely enable energy‐efficient, brain‐inspired computing by acting as both memory and synaptic elements. This review highlights their physical mechanisms, integration in crossbar arrays, and role in spiking neural networks. Key challenges, including variability, relaxation, and stochastic switching, are discussed, alongside emerging ...
Mostafa Shooshtari +2 more
wiley +1 more source
Reliability assessment method of distribution system based on algebraic model
In order to solve the shortcomings of existing distribution system reliability dependent simulation methods and imprecise optimization methods, a new and efficient distribution system reliability evaluation method based on algebraic model is proposed in ...
YU Wei +5 more
doaj +1 more source
Diagonally Implicit Symplectic Runge-Kutta Methods with High Algebraic and Dispersion Order
The numerical integration of Hamiltonian systems with oscillating solutions is considered in this paper. A diagonally implicit symplectic nine-stages Runge-Kutta method with algebraic order 6 and dispersion order 8 is presented.
Y. H. Cong, C. X. Jiang
doaj +1 more source
Efficient Dynamics: Reduced‐Order Modeling of the Time‐Dependent Schrödinger Equation
Reduced‐order modeling (ROM) approaches for the time‐dependent Schrödinger equation are investigated, highlighting their ability to simulate quantum dynamics efficiently. Proper Orthogonal Decomposition, Dynamic Mode Decomposition, and Reduced Basis Methods are compared across canonical systems and extended to higher dimensions.
Kolade M. Owolabi
wiley +1 more source
Computational Characterization of the Multiplication Operation of Octonions via Algebraic Approaches
A succinct and systematic form of multiplication for any arbitrary pairs of octonions is devised. A typical expression of multiplication for any pair of octonions involves 64 terms, which, from the computational and theoretical aspect, is too cumbersome.
Ray-Ming Chen
doaj +1 more source
Abstract Large swarms often adopt a hierarchical network structure that incorporates information aggregation. Although this approach offers significant advantages in terms of communication efficiency and computational complexity, it can also lead to degradation due to information constraints.
Kento Fujita, Daisuke Tsubakino
wiley +1 more source
Direct Approaches for Representations of Various Algebraic Domains via Closure Spaces
In this paper, F-augmented closure spaces are generalized to F-closure spaces, and the concept of F-closed sets are introduced. Properties of their ordered structures are investigated.
Guojun Wu, Luoshan Xu
doaj +1 more source
Finite automata over algebraic structures: models and some methods of analysis [PDF]
In this paper some results of research in two new trends of finite automata theory are presented. For understanding the value and the aim of these researches some short retrospective analysis of development of finite automata theory is given.
Volodymyr V. Skobelev +1 more
doaj
Risk‐aware safe reinforcement learning for control of stochastic linear systems
Abstract This paper presents a risk‐aware safe reinforcement learning (RL) control design for stochastic discrete‐time linear systems. Rather than using a safety certifier to myopically intervene with the RL controller, a risk‐informed safe controller is also learned besides the RL controller, and the RL and safe controllers are combined together ...
Babak Esmaeili +2 more
wiley +1 more source

