相关论文: Routines for the diagonalization of complex matric…

In this paper, we describe a new algorithm to build a few sparse principal components from a given data matrix. Our approach does not explicitly create the covariance matrix of the data and can be viewed as an extension of the Kogbetliantz…

The fractional quantization of singular systems with second order Lagrangian is examined. The fractional singular Lagrangian is presented. The equations of motion are written as total differential equations within fractional calculus. Also,…

We investigate Ambarzumian-type mixed inverse spectral problems for Jacobi matrices. Specifically, we examine whether the Jacobi matrix can be uniquely determined by knowing all but the first $m$ diagonal entries and a set of $m$ ordered…

We first present some identities involving the Pochhammer symbol (rising factorial). We also recall and present some new properties of the Jacobi polynomials. We use them to expand a general hypergeometric function in an orthogonal series…

In this work we find a unifying scheme for the known explicit complex-valued eigenfunctions on the classical compact Riemannian symmetric spaces. For this we employ the well-known Cartan embedding for those spaces. This also leads to the…

In this paper, we introduce novel fast matrix inversion algorithms that leverage triangular decomposition and recurrent formalism, incorporating Strassen's fast matrix multiplication. Our research places particular emphasis on triangular…

Branes and defects in topological Landau-Ginzburg models are described by matrix factorisations. We revisit the problem of deforming them and discuss various deformation methods as well as their relations. We have implemented these…

Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient…

We take matrix decompositions that are usually applied to matrices over the real numbers or complex numbers, and extend them to matrices over an algebra called the double numbers. In doing so, we unify some matrix decompositions: For…

We define Jacobi forms with complex multiplication. Analogous to modular forms with complex multiplication, they are constructed from Hecke characters of the associated imaginary quadratic field. From this construction we obtain a Jacobi…

The spectral properties of two special classes of Jacobi operators are studied. For the first class represented by the $2M$-dimensional real Jacobi matrices whose entries are symmetric with respect to the secondary diagonal, a new…

Recent efforts in applying implicit networks to solve inverse problems in imaging have achieved competitive or even superior results when compared to feedforward networks. These implicit networks only require constant memory during…

This paper is concerned with computations of a few smaller eigenvalues (in absolute value) of a large extremely ill-conditioned matrix. It is shown that smaller eigenvalues can be accurately computed for a diagonally dominant matrix or a…

Properties of partial integrals such as real and complex-valued polynomial, multiple polynomial, exponential, and conditional for ordinary differential systems are studied. The possibilities of constructing first integrals and last…

We write out explicit proper Calabi-Yau structures, i. e. non-degenerate cyclic cocycles on the differential graded categories of matrix factorizations of regular functions with isolated critical points. The formulas involve the Kapustin-Li…

A real persymmetric Jacobi matrix of order $n$ whose eigenvalues are $2k^2$ $(k=0, ..., n-1)$ is presented, with entries given as explicit functions of $n$. Besides the possible use for testing forward and inverse numerical algorithms, such…

Three refined and refined harmonic extraction-based Jacobi--Davidson (JD) type methods are proposed, and their thick-restart algorithms with deflation and purgation are developed to compute several generalized singular value decomposition…

From the literature it is known that orthogonal polynomials as the Jacobi polynomials can be expressed by hypergeometric series. In this paper, the authors derive several contiguous relations for terminating multivariate hypergeometric…

The Jacobi-Davidson method is one of the most popular approaches for iteratively computing a few eigenvalues and their associated eigenvectors of a large matrix. The key of this method is to expand the search subspace via solving the…

The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem.…