Related papers: Globally convergent Jacobi-type algorithms for sim…
In this paper, we describe a new algorithm that approximates the extreme eigenvalue/eigenvector pairs of a symmetric matrix. The proposed algorithm can be viewed as an extension of the Jacobi eigenvalue method for symmetric matrices…
We introduce a new set of algorithms to compute Jacobi matrices associated with measures generated by infinite systems of iterated functions. We demonstrate their relevance in the study of theoretical problems, such as the continuity of…
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…
We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…
In this paper we introduce an iterative Jacobi algorithm for solving distributed model predictive control (DMPC) problems, with linear coupled dynamics and convex coupled constraints. The algorithm guarantees stability and persistent…
A systematic investigation of the skew-symmetric solutions of the three-dimensional Jacobi equations is presented. As a result, three disjoint and complementary new families of solutions are characterized. Such families are very general,…
In this paper, we introduce innovative approaches for accelerating the Jacobi method for matrix diagonalization, specifically through the formulation of large matrix diagonalization as a Semi-Markov Decision Process and small matrix…
We generalize the property of Jacobi-orthogonality to indefinite scalar product spaces. We compare various principles and investigate relations between Osserman, Jacobi-dual, and Jacobi-orthogonal algebraic curvature tensors. We show that…
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…
We find all spectral type differential equations satisfied by the symmetric generalized ultraspherical polynomials which are orthogonal on the interval [-1,1] with respect to the classical symmetric weight function for the Jacobi…
The Eberlein method is a Jacobi-type process for solving the eigenvalue problem of an arbitrary matrix. In each iteration two transformations are applied on the underlying matrix, a plane rotation and a non-unitary elementary…
Orthogonal polynomials on the real line always satisfy a three-term recurrence relation. The recurrence coefficients determine a tridiagonal semi-infinite matrix (Jacobi matrix) which uniquely characterizes the orthogonal polynomials. We…
We study the symmetric outer product decomposition which decomposes a fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present iterative algorithms for the third-order partially symmetric…
This is an ultimate completion of our earlier paper [Acta.\ Math.\ Hungar.\ 140 (2013), 248--292] where mapping properties of several fundamental harmonic analysis operators in the setting of symmetrized Jacobi trigonometric expansions were…
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…
The paper describes several efficient parallel implementations of the one-sided hyperbolic Jacobi-type algorithm for computing eigenvalues and eigenvectors of Hermitian matrices. By appropriate blocking of the algorithms an almost ideal…
This paper presents a method for the accurate and efficient computations on scalar, vector and tensor fields in three-dimensional spherical polar coordinates. The methods uses spin-weighted spherical harmonics in the angular directions and…
We provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…
We show that $\lambda$-symmetries can be algorithmically obtained by using the Jacobi last multiplier. Several examples are provided.
A selfadjoined block tridiagonal matrix with positive definite blocks on the off-diagonals is by definition a Jacobi matrix with matrix entries. Transfer matrix techniques are extended in order to develop a rotation number calculation for…