A new method for the computation of eigenvalues

03/27/2020
by   Nassim Guerraiche, et al.
0

In this paper we are concerned to find the eigenvalues and eigenvectors of a real symetric matrix by applying a new numerical method similar to Jacobi method. Our approch consists to use a new orthogonal matrix. The computation of the eigenvalues and eigenvectors by using by using this method appears easier if compared with Jacobi method in the sense of the functions used in the orthogonal matrix.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/26/2017

Algorithms for the Computing Determinants in Commutative Rings

Two known computation methods and one new computation method for matrix ...
research
09/24/2020

Sampling the eigenvalues of random orthogonal and unitary matrices

We develop an efficient algorithm for sampling the eigenvalues of random...
research
08/03/2022

A new deflation criterion for the QZ algorithm

The QZ algorithm computes the Schur form of a matrix pencil. It is an it...
research
03/23/2020

Geometric Sparsification of Closeness Relations: Eigenvalue Clustering for Computing Matrix Functions

We show how to efficiently solve a clustering problem that arises in a m...
research
06/25/2020

A sorting algorithm for complex eigenvalues

We present SPEC-RE, a new algorithm to sort complex eigenvalues, generat...
research
04/04/2022

Learning Linear Symmetries in Data Using Moment Matching

It is common in machine learning and statistics to use symmetries derive...
research
02/19/2021

Equivalences for Linearizations of Matrix Polynomials

One useful standard method to compute eigenvalues of matrix polynomials ...

Please sign up or login with your details

Forgot password? Click here to reset