An Alternate Method for Computation of Transfer Function Matrix by Appukuttan K. K., Suma Bhat

“…A direct and simple numerical method is presented for calculating the transfer function matrix of a linear time invariant multivariable system (A, B, C). …”
Get full text

On the Lanczos Method for Computing Some Matrix Functions by Ying Gu, Hari Mohan Srivastava, Xiaolan Liu

Get full text

Computing the matrix exponential with the double exponential formula by Tatsuoka Fuminori, Sogabe Tomohiro, Kemmochi Tomoya, Zhang Shao-Liang

“…This article considers the computation of the matrix exponential eA{{\rm{e}}}^{A} with numerical quadrature. …”
Get full text

Jordan–Schur Algorithms for Computing the Matrix Exponential by Petko H. Petkov

“…In this paper, two new versions of the Schur algorithm for computing the matrix exponential of an n×n complex matrix A are presented. …”
Get full text

GPU-Accelerated Fock Matrix Computation with Efficient Reduction by Satoki Tsuji, Yasuaki Ito, Haruto Fujii, Nobuya Yokogawa, Kanta Suzuki, Koji Nakano, Victor Parque, Akihiko Kasagi

“…In quantum chemistry, constructing the Fock matrix is essential to compute Coulomb interactions among atoms and electrons and, thus, to determine electron orbitals and densities. …”
Get full text

CALCULATION OF MATRIX CORRESPONDENCE WITH THE USE OF PARALLEL COMPUTING TECHNOLOGIES by E. E. Ilyasov, A. M. Amirov

Get full text

Tight computationally efficient approximation of matrix norms with applications by Juditsky, Anatoli, Kotsalis, Georgios, Nemirovski, Arkadi

“…It is known that aside of a fistful of “solvable cases”, most notably, the case when both given norms are Euclidean, computing operator norm of a matrix is NP-hard. We specify rather general families of norms on the argument and the images space (“ellitopic” and “co-ellitopic”, respectively) allowing for reasonably tight computationally efficient upper-bounding of the associated operator norms. …”
Get full text

Computation of the Golden Matrix Exponential Functions of Special Matrices by Mustafa Bahşi, Efruz Özlem Mersin

“…Computation of the matrix exponential functions is important in solving various scientific and engineering problems due to their active role in solving differential equations. …”
Get full text

A Rapid Numerical Algorithm to Compute Matrix Inversion by F. Soleymani

“…The aim of the present work is to suggest and establish a numerical algorithm based on matrix multiplications for computing approximate inverses. …”
Get full text

Computation of the zeros of a quaternionic polynomial using matrix methods by N. A. Rather, Tanveer Bhat, Ishfaq Dar, Bilal Khan, Arjika Sama

Get full text

Bus Admittance Matrix Revisited: Performance Challenges on Modern Computers by Hantao Cui

Subjects: “…Bus admittance matrix…”
Get full text

Matrix computation over homomorphic plaintext-ciphertext and its application by Yang LIU, Linhan YANG, Jingwei CHEN, Wenyuan WU, Yong FENG

Subjects: Get full text

An Accelerated Sixth-Order Procedure to Determine the Matrix Sign Function Computationally by Shuai Wang, Ziyang Wang, Wu Xie, Yunfei Qi, Tao Liu

“…The matrix sign function has a key role in several applications in numerical linear algebra. …”
Get full text

A Method of Kill Chains Fusion Based on Granulated Rules and Matrix Computation by Haijun Ye, Wei Gao

Subjects: Get full text

Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation by Qing ZHU, Le-nan WU, Yong-biao YANG, Jie LI, Shi-ming XU

“…Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 basic graph structures were defined to realize recursive calculate in the implementation process.Compared with previous works,the algorithm provided many methods for counting the same length of cycles.The same result confirmed the correctness of the algorithm.The new algorithm could not only calculate the total number of cycles,but also gave the number each edge participating in fixed-length cycles.Its complexity was proportional to the product of D and square of N,where D was the average degree of variable nodes,and N denoted the code length.For LDPC codes,D was far less than N.For most of the LDPC codes,the calculation for numbers of cycle-length g、g+2、g+4 was only several seconds.…”
Get full text

Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation by Qing ZHU, Le-nan WU, Yong-biao YANG, Jie LI, Shi-ming XU

“…Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 basic graph structures were defined to realize recursive calculate in the implementation process.Compared with previous works,the algorithm provided many methods for counting the same length of cycles.The same result confirmed the correctness of the algorithm.The new algorithm could not only calculate the total number of cycles,but also gave the number each edge participating in fixed-length cycles.Its complexity was proportional to the product of D and square of N,where D was the average degree of variable nodes,and N denoted the code length.For LDPC codes,D was far less than N.For most of the LDPC codes,the calculation for numbers of cycle-length g、g+2、g+4 was only several seconds.…”
Get full text

A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization by M. Rezghi, M. Yousefi

“…Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. …”
Get full text

Computing the Matrix G of Multi-Dimensional Markov Chains of M/G/1 Type by Valeriy Naumov, Konstantin Samouylov

“…The level of a state is defined by the minimum value in its first component. The matrix <b>G</b> of the process represents the conditional probabilities that, starting from a given state of a certain level, the Markov chain will first reach a lower level in a specific state. …”
Get full text

Computation of Invariant Measures and Stationary Expectations for Markov Chains with Block-Band Transition Matrix by Hendrik Baumann, Thomas Hanschke

“…This paper deals with the computation of invariant measures and stationary expectations for discrete-time Markov chains governed by a block-structured one-step transition probability matrix. …”
Get full text

Terminal zeroing neural network for time-varying matrix computing under bounded noise by ZHONG Guomin, TANG Yifei, SUN Mingxuan

Subjects: “…time-varying matrix computation;ZNN;fixed/predefined-time convergence;repetitive motion planning…”
Get full text