Nearly optimal scaling in the SR decomposition

04/07/2020
by   Heike Fassbender, et al.
0

In this paper we analyze the nearly optimal block diagonal scalings of the rows of one factor and the columns of the other factor in the triangular form of the SR decomposition. The result is a block generalization of the result of the van der Sluis about the almost optimal diagonal scalings of the general rectangular matrices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/03/2020

A note on 2× 2 block-diagonal preconditioning

For 2x2 block matrices, it is well-known that block-triangular or block-...
research
03/14/2018

Block Diagonally Dominant Positive Definite Sub-optimal Filters and Smoothers

We examine stochastic dynamical systems where the transition matrix, Φ, ...
research
11/05/2019

Adaptive Domain Decomposition method for Saddle Point problem in Matrix Form

We introduce an adaptive domain decomposition (DD) method for solving sa...
research
12/23/2020

Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge-Kutta Schemes for Parabolic PDEs

Runge-Kutta (RK) schemes, especially Gauss-Legendre and some other fully...
research
09/16/2021

The enhanced derived-vector-space approach to domain decomposition methods

Standard approaches to domain decomposition methods (DDM) are uncapable ...
research
09/02/2022

Optimal Diagonal Preconditioning: Theory and Practice

Preconditioning has been a staple technique in optimization and machine ...
research
12/24/2020

Q-SR: An Extensible Optimization Framework for Segment Routing

Segment routing (SR) combines the advantages of source routing supported...

Please sign up or login with your details

Forgot password? Click here to reset