scholarly journals A framework for dense triangular matrix kernels on various manycore architectures

2017 ◽  
Vol 29 (15) ◽  
pp. e4187 ◽  
Author(s):  
Ali Charara ◽  
David Keyes ◽  
Hatem Ltaief
Keyword(s):  
Triangular Matrix ◽  
Matrix Kernels

τ-tilting finite triangular matrix algebras

2021 ◽  
pp. 106785
Author(s):  
Takuma Aihara ◽  
Takahiro Honma
Keyword(s):  
Triangular Matrix ◽  
Matrix Algebras

scholarly journals Accurate and Efficient Derivative-Free Three-Phase Power Flow Method for Unbalanced Distribution Networks

Computation ◽  
2021 ◽  
Vol 9 (6) ◽  
pp. 61
Author(s):  
Oscar Danilo Montoya ◽  
Juan S. Giraldo ◽  
Luis Fernando Grisales-Noreña ◽  
Harold R. Chamorro ◽  
Lazaro Alvarado-Barrios
Keyword(s):  
Power Flow ◽  
Triangular Matrix ◽  
Distribution Networks ◽  
Flow Method ◽  
Processing Times ◽  
Three Phase ◽  
Derivative Free ◽  
Upper Triangular Matrix ◽  
Power Flow Problem ◽  
Power Flow Method

The power flow problem in three-phase unbalanced distribution networks is addressed in this research using a derivative-free numerical method based on the upper-triangular matrix. The upper-triangular matrix is obtained from the topological connection among nodes of the network (i.e., through a graph-based method). The main advantage of the proposed three-phase power flow method is the possibility of working with single-, two-, and three-phase loads, including Δ- and Y-connections. The Banach fixed-point theorem for loads with Y-connection helps ensure the convergence of the upper-triangular power flow method based an impedance-like equivalent matrix. Numerical results in three-phase systems with 8, 25, and 37 nodes demonstrate the effectiveness and computational efficiency of the proposed three-phase power flow formulation compared to the classical three-phase backward/forward method and the implementation of the power flow problem in the DigSILENT software. Comparisons with the backward/forward method demonstrate that the proposed approach is 47.01%, 47.98%, and 36.96% faster in terms of processing times by employing the same number of iterations as when evaluated in the 8-, 25-, and 37-bus systems, respectively. An application of the Chu-Beasley genetic algorithm using a leader–follower optimization approach is applied to the phase-balancing problem utilizing the proposed power flow in the follower stage. Numerical results present optimal solutions with processing times lower than 5 s, which confirms its applicability in large-scale optimization problems employing embedding master–slave optimization structures.

A quasi-affine transformation artificial bee colony algorithm for global optimization

2021 ◽  
pp. 1-18
Author(s):  
Baohua Zhao ◽  
Tien-Wen Sung ◽  
Xin Zhang
Keyword(s):  
Affine Transformation ◽  
Artificial Bee Colony ◽  
Triangular Matrix ◽  
Convergence Speed ◽  
Test Set ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Search Mechanism ◽  
Multiple Dimensions ◽  
Collaborative Search

The artificial bee colony (ABC) algorithm is one of the classical bioinspired swarm-based intelligence algorithms that has strong search ability, because of its special search mechanism, but its development ability is slightly insufficient and its convergence speed is slow. In view of its weak development ability and slow convergence speed, this paper proposes the QABC algorithm in which a new search equation is based on the idea of quasi-affine transformation, which greatly improves the cooperative ability between particles and enhances its exploitability. During the process of location updating, the convergence speed is accelerated by updating multiple dimensions instead of one dimension. Finally, in the overall search framework, a collaborative search matrix is introduced to update the position of particles. The collaborative search matrix is transformed from the lower triangular matrix, which not only ensures the randomness of the search, but also ensures its balance and integrity. To evaluate the performance of the QABC algorithm, CEC2013 test set and CEC2014 test set are used in the experiment. After comparing with the conventional ABC algorithm and some famous ABC variants, QABC algorithm is proved to be superior in efficiency, development ability, and robustness.

scholarly journals Functional identities on upper triangular matrix rings

2020 ◽  
Vol 18 (1) ◽  
pp. 182-193
Author(s):  
He Yuan ◽  
Liangyun Chen
Keyword(s):  
Triangular Matrix ◽  
Matrix Rings ◽  
Unital Ring ◽  
Functional Identities ◽  
Upper Triangular Matrix ◽  
Free Subset

Abstract Let R be a subset of a unital ring Q such that 0 ∈ R. Let us fix an element t ∈ Q. If R is a (t; d)-free subset of Q, then Tn(R) is a (t′; d)-free subset of Tn(Q), where t′ ∈ Tn(Q), $\begin{array}{} t_{ll}' \end{array} $ = t, l = 1, 2, …, n, for any n ∈ N.

On feckly polar rings

2019 ◽  
Vol 18 (02) ◽  
pp. 1950021
Author(s):  
Tugce Pekacar Calci ◽  
Huanyin Chen
Keyword(s):  
Triangular Matrix ◽  
Matrix Rings ◽  
Structure Theorems ◽  
Regular Rings

In this paper, we introduce a new notion which lies properly between strong [Formula: see text]-regularity and pseudopolarity. A ring [Formula: see text] is feckly polar if for any [Formula: see text] there exists [Formula: see text] such that [Formula: see text] Many structure theorems are proved. Further, we investigate feck polarity for triangular matrix and matrix rings. The relations among strongly [Formula: see text]-regular rings, pseudopolar rings and feckly polar rings are also obtained.

Some Criteria for Hermite Rings and Elementary Divisor Rings

1974 ◽  
Vol 26 (6) ◽  
pp. 1380-1383 ◽  
Author(s):  
Thomas S. Shores ◽  
Roger Wiegand
Keyword(s):  
Triangular Matrix ◽  
Elementary Divisor ◽  
Diagonal Matrix ◽  
Finitely Generated ◽  
Elementary Divisor Ring ◽  
Hermite Ring

Recall that a ring R (all rings considered are commutative with unit) is an elementary divisor ring (respectively, a Hermite ring) provided every matrix over R is equivalent to a diagonal matrix (respectively, a triangular matrix). Thus, every elementary divisor ring is Hermite, and it is easily seen that a Hermite ring is Bezout, that is, finitely generated ideals are principal. Examples have been given [4] to show that neither implication is reversible.

scholarly journals Skew polynomial rings of formal triangular matrix rings

2012 ◽  
Vol 349 (1) ◽  
pp. 201-216 ◽  
Author(s):  
Hoger Ghahramani
Keyword(s):  
Triangular Matrix ◽  
Polynomial Rings ◽  
Matrix Rings ◽  
Skew Polynomial Rings ◽  
Skew Polynomial

scholarly journals Adjacency preserving maps on upper triangular matrix algebras

2003 ◽  
Vol 367 ◽  
pp. 105-130 ◽  
Author(s):  
W.L Chooi ◽  
M.H Lim ◽  
Peter Šemrl
Keyword(s):  
Triangular Matrix ◽  
Matrix Algebras ◽  
Upper Triangular Matrix
Sign in / Sign up

Export Citation Format

Share Document