Generalised norm resolvent convergence: comparison of different concepts

02/07/2022
by   Olaf Post, et al.
0

In this paper, we show that the two concepts of generalised norm resolvent convergence introduced by Weidmann and the first author of this paper are equivalent. We also focus on the convergence speed and provide conditions under which the convergence speed is the same for both concepts. We illustrate the abstract results by a large number of examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/04/2018

Analysis for the Slow Convergence in Arimoto Algorithm

In this paper, we investigate the convergence speed of the Arimoto algor...
research
09/17/2020

Analysis of the Convergence Speed of the Arimoto-Blahut Algorithm by the Second Order Recurrence Formula

In this paper, we investigate the convergence speed of the Arimoto-Blahu...
research
10/19/2020

On the Effectiveness of Fekete's Lemma

Fekete's lemma is a well known combinatorial result pertaining to number...
research
03/08/2021

Exact Gap between Generalization Error and Uniform Convergence in Random Feature Models

Recent work showed that there could be a large gap between the classical...
research
02/24/2021

Convergence in the maximum norm of ADI-type methods for parabolic problems

Results on unconditional convergence in the Maximum norm for ADI-type me...
research
10/27/2021

Constrained Optimization Involving Nonconvex ℓ_p Norms: Optimality Conditions, Algorithm and Convergence

This paper investigates the optimality conditions for characterizing the...
research
05/15/2023

Testing equivalence of multinomial distributions – a constrained bootstrap approach

In this paper we develop a novel bootstrap test for the comparison of tw...

Please sign up or login with your details

Forgot password? Click here to reset