相关论文: The LU-decomposition of Lehmer's tridiagonal matri…

In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…

We study matrix three term relations for orthogonal polynomials in two variables constructed from orthogonal polynomials in one variable. Using the three term recurrence relation for the involved univariate orthogonal polynomials, the…

We show constructively that, under certain regularity assumptions, any system of coupled linear differential equations with variable coefficients can be tridiagonalized by a time-dependent Lanczos-like method. The proof we present formally…

The inverse of the Vandermonde and confluent Vandermonde matrices are presented. In the case of the Vandermonde matrix, we present a decomposition in three factors, one of them a diagonal matrix. The evaluation of such inverse matrices is a…

An orthogonal decomposition problem of Lie algebras over the complex numbers has been studied since the 1980s. It has many applications and relations to other areas of mathematics and sciences. In this paper, we consider this decomposition…

We study tridimensional tensors on the complex field from the point of view of hypermatrices, taking into consideration the problem of determining whether they are degenerate or not, concise or not, what is their essential format if they…

We find solutions for a linear deformation of the symmetric three-term recursion relation. The orthogonal polynomials of the first and second kind associated with the deformed relation are obtained. The new density (weight) function is…

We present a fast randomized algorithm that computes a low rank LU decomposition. Our algorithm uses random projections type techniques to efficiently compute a low rank approximation of large matrices. The randomized LU algorithm can be…

For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…

We examine a result of Basor and Ehrhardt concerning Hankel and Toeplitz plus Hankel matrices, within the context of the Riordan group of lower-triangular matrices. This allows us to determine the LDU decomposition of certain symmetric…

We give a simple and short proof of the classical Lebesgue decomposition theorem of measures via the Riesz orthogonal decomposition theorem of Hilbert spaces. The tools we employ are elementary Hilbert space techniques.

We define lower triangular tensors, and show that all diagonal entries of such a tensor are eigenvalues of that tensor. We then define lower triangular sub-symmetric tensors, and show that the number of independent entries of a lower…

Convergence is a crucial issue in iterative algorithms. Damping is commonly employed to ensure the convergence of iterative algorithms. The conventional ways of damping are scalar-wise, and either heuristic or empirical. Recently, an…

We prove the decomposition conjecture of Leclerc and Thibon for the Schur algebra. We also give a new approach to the Lusztig conjecture for the dimension of the simple U(sl_k)-modules at roots of unity via canonical bases of the Hall…

Higher-order tensors appear in various areas of mechanics as well as physics, medicine or earth sciences. As these tensors are highly complex, most are not well understood. Thus, the analysis and the visualization process form a highly…

In this paper we generalize previous work on decomposition in three-dimensional orbifolds by 2-groups realized as analogues of central extensions, to orbifolds by more general 2-groups. We describe the computation of such orbifolds in…

In this note, we explore the connections between the confluent Vandermonde matrix over an arbitrary field and several mathematical topics, including interpolation polynomials, Hasse derivatives, LU factorization, companion matrices and…

We present an algorithm to compute $\mathrm{LCLM}$-decompositions for linear differentials operators with coefficients in the rational function field of characteristic $p$, $\mathbb{F}_{p^n}(t)$. We show that for an operator $L$ of order…

Instantaneous derivation of the Thomas precession.

The matrix LU factorization algorithm is a fundamental algorithm in linear algebra. We propose a generalization of the LU and LEU algorithms to accommodate the case of a commutative domain and its field of quotients. This algorithm…