Related papers: A Jacobi-Type Eigensolver for Diagonally Dominant …
We present here the necessary and sufficient conditions for the invertibility of tridiagonal matrices, commonly named Jacobi matrices, and explicitly compute their inverse. The techniques we use are related with the solution of…
This paper proposes a Newton-type method to solve numerically the eigenproblem of several diagonalizable matrices, which pairwise commute. A classical result states that these matrices are simultaneously diagonalizable. From a suitable…
In this paper, we study the approximate orthogonal diagonalization problem of third order symmetric tensors. We define several classes of approximately diagonal tensors, including the ones corresponding to the stationary points of this…
We present a new algorithm for solving an eigenvalue problem for a real symmetric matrix which is a rank-one modification of a diagonal matrix. The algorithm computes each eigenvalue and all components of the corresponding eigenvector with…
We present a novel numerical method, called {\tt Jacobi-predictor-corrector approach}, for the numerical solution of fractional ordinary differential equations based on the polynomial interpolation and the Gauss-Lobatto quadrature w.r.t.…
In this work, we explicitly compute the group inverse of symmetric and periodic Jacobi matrices.
In this paper we study various difference equations related to Jacobi-type pencils. By a Jacobi-type pencil one means the following pencil: $J_5 - \lambda J_3$, where $J_3$ is a Jacobi matrix and $J_5$ is a semi-infinite real symmetric…
Convergence problems in coupled-cluster iterations are discussed, and a new iteration scheme is proposed. Whereas the Jacobi method inverts only the diagonal part of the large matrix of equation coefficients, we invert a matrix which also…
In this paper a recursive algorithm is presented for evaluating multivariate Pad\'e approximants (of the rectangular type described in the work of Lutterodt) which is analogous to the Jacobi formula for univariate Pad\'e approximants. This…
We make a convergence analysis of the harmonic and refined harmonic extraction versions of Jacobi-Davidson SVD (JDSVD) type methods for computing one or more interior singular triplets of a large matrix $A$. At each outer iteration of these…
This paper proposes a new distributed algorithm for solving linear systems associated with a sparse graph under a generalised diagonal dominance assumption. The algorithm runs iteratively on each node of the graph, with low complexities on…
Jacobi matrices are parametrized by their eigenvalues and norming constants (first coordinates of normalized eigenvectors): this coordinate system breaks down at reducible tridiagonal matrices. The set of real symmetric tridiagonal matrices…
By using the Hadamard matrix product concept, this paper introduces two generalized matrix formulation forms of numerical analogue of nonlinear differential operators. The SJT matrix-vector product approach is found to be a simple,…
It is shown that the problem of balancing a nonnegative matrix by positive diagonal matrices can be recast as a constrained nonlinear multiparameter eigenvalue problem. Based on this equivalent formulation some adaptations of the power…
The Eberlein diagonalization method is an iterative Jacobi-type method for solving the eigenvalue problem of a general complex matrix. In this paper we develop the block version of the Eberlein method. We prove the global convergence of our…
Traditional numerical methods for calculating matrix eigenvalues are prohibitively expensive for high-dimensional problems. Iterative random sparsification methods allow for the estimation of a single dominant eigenvalue at reduced cost by…
Recently Ahmadi et al. (2021) and Tagliaferro (2022) proposed some iterative methods for the numerical solution of linear systems which, under the classical hypothesis of strict diagonal dominance, typically converge faster than the Jacobi…
This paper introduces a novel framework for matrix diagonalization, recasting it as a sequential decision-making problem and applying the power of Decision Transformers (DTs). Our approach determines optimal pivot selection during…
In this pedagogical article, we present a simple direct matrix method for analytically computing the Jacobian of nonlinear algebraic equations that arise from the discretization of nonlinear integro-differential equations. The method is…
The family of left-to-right GCD algorithms reduces input numbers by repeatedly subtracting the smaller number, or multiple of the smaller number, from the larger number. This paper describes how to extend any such algorithm to compute the…