An iterative method to solve Lyapunov equations

09/21/2023
by   Licio Hernanes Bezerra, et al.
0

We present here a new splitting method to solve Lyapunov equations in a Kronecker product form. Although this resulting matrix is of order n^2, each iteration demands two operations with the matrix A: a multiplication of the form (A-σ I) B̃ and a inversion of the form (A-σ I)^-1B̃. We see that for some choice of a parameter the iteration matrix is such that all their eigenvalues are in absolute value less than 1. Moreover we present a theorem that enables us to get a good starting vector for the method.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
05/31/2023

Kaczmarz-Type Methods for Solving Matrix Equations

In this paper, several Kaczmarz-type numerical methods for solving the m...
research
03/18/2021

A class of inexact modified Newton-type iteration methods for solving the generalized absolute value equations

In Wang et al. (J. Optim. Theory Appl., 181: 216–230, 2019), a class of ...
research
09/22/2021

Simple exponential acceleration of the power iteration algorithm

Many real-world problems rely on finding eigenvalues and eigenvectors of...
research
01/03/2019

On Fast Matrix Inversion via Fast Matrix Multiplication

Volker Strassen first suggested an algorithm to multiply matrices with w...
research
11/26/2019

The fixed-stress splitting scheme for Biot's equations as a modified Richardson iteration: Implications for optimal convergence

The fixed-stress splitting scheme is a popular method for iteratively so...
research
03/17/2021

An inexact Douglas-Rachford splitting method for solving absolute value equations

The last two decades witnessed the increasing of the interests on the ab...

Please sign up or login with your details

Forgot password? Click here to reset