Related papers: A Jacobi-Type Eigensolver for Diagonally Dominant …
A method is presented for fast diagonalization of a 2x2 or 3x3 real symmetric matrix, that is determination of its eigenvalues and eigenvectors. The Euler angles of the eigenvectors are computed. A small computer algebra program is used to…
We consider the class of bounded symmetric Jacobi matrices $J$ with positive off-diagonal elements and complex diagonal elements. With each matrix $J$ from this class, we associate the spectral data, which consists of a pair $(\nu,\psi)$.…
We look for differential equations satisfied by the generalized Jacobi polynomials which are orthogonal on the interval [-1,1] with respect to the classical weight function for the Jacobi polynomials together with point masses at both…
We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as…
We consider the inverse dynamic problem for a dynamical system with discrete time associated with a semi-infinite complex Jacobi matrix. We propose two approaches of recovering coefficients from dynamic response operator and answer a…
It is proved that the eigenvalues of the Jacobi Tau method for the second derivative operator with Dirichlet boundary conditions are real, negative and distinct for a range of the Jacobi parameters. Special emphasis is placed on the…
We look for spectral type differential equations satisfied by the generalized Jacobi polynomials which are orthogonal on the interval [-1,1] with respect to a weight function consisting of the classical Jacobi weight function together with…
This article presents a unified approach to simultaneously compute the Jacobians of several singular matrix transformations in the real, complex, quaternion and octonion cases. Formally, these Jacobians are obtained for real normed division…
We present new algorithms for computing the log-determinant of symmetric, diagonally dominant matrices. Existing algorithms run with cubic complexity with respect to the size of the matrix in the worst case. Our algorithm computes an…
This paper presents a novel Jacobi-style iteration algorithm for solving the problem of distributed submodular maximization, in which each agent determines its own strategy from a finite set so that the global submodular objective function…
A previous knowledge of the domains of dependence of an Hamilton Jacobi equation can be useful in its study and approximation. Information of this nature are, in general, difficult to obtain directly from the data of the problem. In this…
We introduce a novel eigenvalue algorithm for near-diagonal matrices inspired by Rayleigh-Schr\"odinger perturbation theory and termed Iterative Perturbative Theory (IPT). Contrary to standard eigenvalue algorithms, which are either…
In this work, a new algorithm for solving symmetric indefinite systems of linear equations is presented. It factorizes the matrix into the form LDLt using Jacobi rotations in order to increase the pivot's absolute value. Furthermore, Rook's…
The Wigner-von Neumann method, which was previously used for perturbing continuous Schr\"{o}dinger operators, is here applied to their discrete counterparts. In particular, we consider perturbations of arbitrary $T$-periodic Jacobi…
Eigenvalue analysis is widely used for linear instability analysis in both external and internal aerodynamics. It typically involves finding the steady state, linearizing around it to obtain the Jacobian, and then solving for its…
The multi-indexed Jacobi polynomials are the main part of the eigenfunctions of exactly solvable quantum mechanical systems obtained by certain deformations of the P\"oschl-Teller potential (Odake-Sasaki). By fine-tuning the parameter(s) of…
We propose a spectral method by using the Jacobi functions for computing eigenvalue gaps and their distribution statistics of the fractional Schr\"{o}dinger operator (FSO). In the problem, in order to get reliable gaps distribution…
In this paper, we propose a simple sparse approximate inverse for triangular matrices (SAIT). Using the Jacobi iteration method, we obtain an expression of the exact inverse of triangular matrix, which is a finite series. The SAIT is…
We consider positive Jacobi matrices $J$ with compact inverses and consequently with purely discrete spectra. A number of properties of the corresponding sequence of orthogonal polynomials is studied including the convergence of their…
The solution of parameter-dependent linear systems, by classical methods, leads to an arithmetic effort that grows exponentially in the number of parameters. This renders the multigrid method, which has a well understood convergence theory,…