Results 11 to 20 of about 454,491 (346)
THE GENERALIZED PASCAL MATRIX VIA THE GENERALIZED FIBONACCI MATRIX AND THE GENERALIZED PELL MATRIX [PDF]
Journal of the Korean Mathematical Society, 2008 In [4], the authors studied the Pascal matrix and the Stirling matrices of the first kind and the second kind via the Fibonacci matrix. In this paper, we consider generalizations of Pascal matrix, Fibonacci matrix and Pell matrix. And, by using Riordan method, we have factorizations of them. We, also, consider some combinatorial identities.
Gwang-Yeon Lee, Seong-Hoon Cho
openaire +1 more source
Generalized Matrix Nearness Problems
SIAM Journal on Matrix Analysis and Applications, 2023 18 pages, 2 ...
Zihao Li, Lek-Heng Lim
openaire +3 more sources
The generalized matrix chain algorithm [PDF]
Proceedings of the 2018 International Symposium on Code Generation and Optimization - CGO 2018, 2018 In this paper, we present a generalized version of the matrix chain algorithm to generate efficient code for linear algebra problems, a task for which human experts often invest days or even weeks of works. The standard matrix chain problem consists in finding the parenthesization of a matrix product $M := A_1 A_2 \cdots A_n$ that minimizes the number ...
Henrik Barthels +2 more
openaire +2 more sources
The generalized Lilbert matrix
Periodica Mathematica Hungarica, 2016 We introduce a generalized Lilbert [Lucas-Hilbert] matrix. Explicit formul' are derived for the LU-decomposition and their inverses, as well as the Cholesky decomposition. The approach is to use q-analysis and to leave the justification of the necessary identities to the q-version of Zeilberger's celebrated algorithm.
Emrah Kiliç, Helmut Prodinger
openaire +2 more sources
Computation of Generalized Matrix Functions [PDF]
SIAM Journal on Matrix Analysis and Applications, 2016 We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear and Multilinear Algebra 1(2), 1973, pp. 163-171]. Our algorithms are based on Gaussian quadrature and Golub--Kahan bidiagonalization. Block variants are also investigated. Numerical experiments
Francesca Arrigo +2 more
openaire +3 more sources
General Randić matrix and general Randić incidence matrix
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruifang Liu, Wai Chee Shiu
openaire +2 more sources
Generation matrix: An embeddable matrix representation for hierarchical trees
Theoretical Computer Science, 2023 Starting from the local structures to study hierarchical trees is a common research method. However, the cumbersome analysis and description make the naive method challenging to adapt to the increasingly complex hierarchical tree problems. To improve the efficiency of hierarchical tree research, we propose an embeddable matrix representation for ...
Jianping Cai +3 more
openaire +3 more sources
A Systematic Survey of General Sparse Matrix-matrix Multiplication
ACM Computing Surveys, 2023 General Sparse Matrix-Matrix Multiplication (SpGEMM) has attracted much attention from researchers in graph analyzing, scientific computing, and deep learning. Many optimization techniques have been developed for different applications and computing architectures over the past decades.
Jianhua Gao +6 more
openaire +2 more sources
Representation of Quantum Mechanical Resonances in the Lax-Phillips Hilbert Space [PDF]
, 1998 We discuss the quantum Lax-Phillips theory of scattering and unstable systems. In this framework, the decay of an unstable system is described by a semigroup.
Aguilar J. +10 more
core +3 more sources
On generalized corners and matrix multiplication
CoRR, 2023 Suppose that $S \subseteq [n]^2$ contains no three points of the form $(x,y), (x,y+δ), (x+δ,y')$, where $δ\neq 0$. How big can $S$ be? Trivially, $n \le |S| \le n^2$. Slight improvements on these bounds are obtained from Shkredov's upper bound for the corners problem [Shk06], which shows that $|S| \le O(n^2/(\log \log n)^c)$ for some small $c > 0 ...
openaire +4 more sources