This project involves the development of a program to read a sparse matrix from an MM file, convert it to Compressed Sparse Row (CSR) format, and then solve for vector x using Jacobi's method.

Abstract: Bounds on the exponential decay of generalized eigenfunctions of bounded and unbounded selfadjoint Jacobi matrices in $\ell^2(\mathbb N)$ are established. Two cases are considered separately ...

The trend can be explained by the communication overhead required for the parallel Jacobi matrix multiplication. As explained in the code design, the Jacobi algorithm requires several communication ...

Abstract: To solve the problem of excessive reactive power and high voltage caused by renewable energy connection and the increase of the proportion of cables, a reactive power optimization approach ...

We construct a new example of 2 × 2-matrix quasi-exactly solvable (QES) Hamiltonian which is associated to a potential depending on the Jacobi elliptic functions. We establish three necessary and ...

Funktionalmatrix, an der Stelle x = (x 1,…,x n), die innerer Punkt von \(G\subset {{\mathbb{R}}}^{n}\) sei, einer dort partiell differenzierbaren Funktion \(f=({f ...

Institut de Pédagogie Appliquée, Université du Burundi, Bujumbura, Burundi. In quantum physics, one of the main mathematical problems consists in constructing the spectrum of a linear operator defined ...