Convergence of the Eberlein diagonalization method under the generalized serial pivot strategies

12/15/2022
by   Erna Begovic, et al.
0

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 transformation. The paper studies the method under the broad class of generalized serial pivot strategies. We prove the global convergence of this method and present several numerical examples.

READ FULL TEXT
research
03/17/2021

A New Modified Newton-Type Iteration Method for Solving Generalized Absolute Value Equations

For the large sparse generalized absolute value equations (GAVEs) , the ...
research
11/19/2021

Impact of spatial coarsening on Parareal convergence

We study the impact of spatial coarsening on the convergence of the Para...
research
09/21/2018

A numerical approach for the filtered generalized Cech complex

In this paper, we present an algorithm to compute the filtered generaliz...
research
11/08/2018

Orthogonal Trace-Sum Maximization: Applications, Local Algorithms, and Global Optimality

This paper studies a problem of maximizing the sum of traces of matrix q...
research
08/01/2019

The J-method for the Gross-Pitaevskii eigenvalue problem

This paper studies the J-method of [E. Jarlebring, S. Kvaal, W. Michiels...
research
04/29/2020

Convergence Analysis of Extended LOBPCG for Computing Extreme Eigenvalues

This paper is concerned with the convergence analysis of an extended var...
research
09/02/2022

How Descriptive are GMRES Convergence Bounds?

GMRES is a popular Krylov subspace method for solving linear systems of ...

Please sign up or login with your details

Forgot password? Click here to reset