Super-linear convergence in the p-adic QR-algorithm

08/31/2020
by   Avinash Kulkarni, et al.
0

The QR-algorithm is one of the most important algorithms in linear algebra. Its several variants make feasible the computation of the eigenvalues and eigenvectors of a numerical real or complex matrix, even when the dimensions of the matrix are enormous. The first adaptation of the QR-algorithm to local fields was given by the first author in 2019. However, in this version the rate of convergence is only linear and in some cases the decomposition into invariant subspaces is incomplete. We present a refinement of this algorithm with a super-linear convergence rate in many cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/31/2023

On the Linear Convergence of Policy Gradient under Hadamard Parameterization

The convergence of deterministic policy gradient under the Hadamard para...
research
09/23/2021

Low Rank Vectorized Hankel Lift for Matrix Recovery via Fast Iterative Hard Thresholding

We propose a VHL-FIHT algorithm for matrix recovery in blind super-resol...
research
09/07/2023

An Element-wise RSAV Algorithm for Unconstrained Optimization Problems

We present a novel optimization algorithm, element-wise relaxed scalar a...
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
02/22/2021

Super-Convergence with an Unstable Learning Rate

Conventional wisdom dictates that learning rate should be in the stable ...
research
08/07/2017

Linear Convergence of a Frank-Wolfe Type Algorithm over Trace-Norm Balls

We propose a rank-k variant of the classical Frank-Wolfe algorithm to so...
research
01/01/2022

Matrix Decomposition and Applications

In 1954, Alston S. Householder published Principles of Numerical Analysi...

Please sign up or login with your details

Forgot password? Click here to reset