Approximations of inverse block Toeplitz matrices and Baxter-type theorems for long-memory processes

04/02/2023
by   Akihiko Inoue, et al.
0

We derive sharp approximation error bounds for inverse block Toeplitz matrices associated with multivariate long-memory stationary processes. The error bounds are evaluated for both column and row sums. These results are used to prove the strong convergence of the solutions of general block Toeplitz systems. A crucial part of the proof is to bound sums consisting of the Fourier coefficients of the phase function attached to the singular symbol of the Toeplitz matrices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2021

Explicit formulas for the inverses of Toeplitz matrices, with applications

We derive explicit formulas for the inverses of truncated block Toeplitz...
research
10/26/2021

Eigenvalue Bounds for Double Saddle-Point Systems

We derive bounds on the eigenvalues of a generic form of double saddle-p...
research
11/28/2022

A posteriori error bounds for the block-Lanczos method for matrix function approximation

We extend the error bounds from [SIMAX, Vol. 43, Iss. 2, pp. 787-811 (20...
research
08/19/2023

The extension of Weyl-type relative perturbation bounds

We extend several relative perturbation bounds to Hermitian matrices tha...
research
05/12/2023

Levenberg-Marquardt method with Singular Scaling and applications

Inspired by certain regularization techniques for linear inverse problem...
research
01/16/2021

A symbol based analysis for multigrid methods for Block-Circulant and Block-Toeplitz Systems

In the literature, there exist several studies on symbol-based multigrid...
research
06/19/2021

Comparison Theorems for Splittings of M-matrices in (block) Hessenberg Form

Some variants of the (block) Gauss-Seidel iteration for the solution of ...

Please sign up or login with your details

Forgot password? Click here to reset