DeepAI AI Chat
Log In Sign Up

Convergence analysis of the Newton-Schur method for the symmetric elliptic eigenvalue problem

by   Nian Shao, et al.

In this paper, we consider the Newton-Schur method in Hilbert space and obtain quadratic convergence. For the symmetric elliptic eigenvalue problem discretized by the standard finite element method and non-overlapping domain decomposition method, we use the Steklov-Poincaré operator to reduce the eigenvalue problem on the domain Ω into the nonlinear eigenvalue subproblem on Γ, which is the union of subdomain boundaries. We prove that the convergence rate for the Newton-Schur method is ϵ_N≤ CH^2(1+ln(H/h))^2ϵ^2, where the constant C is independent of the fine mesh size h and coarse mesh size H, and ϵ_N and ϵ are errors after and before one iteration step respectively. Numerical experiments confirm our theoretical analysis.


A Two-Level Preconditioned Helmholtz-Jacobi-Davidson Method for the Maxwell Eigenvalue Problem

In this paper, based on a domain decomposition (DD) method, we shall pro...

Riemannian Acceleration with Preconditioning for symmetric eigenvalue problems

In this paper, we propose a Riemannian Acceleration with Preconditioning...

Analysis of the Schwarz domain decomposition method for the conductor-like screening continuum model

We study the Schwarz overlapping domain decomposition method applied to ...

A Two-Level Block Preconditioned Jacobi-Davidson Method for Computing Multiple and Clustered Eigenvalues

In this paper, we propose a two-level block preconditioned Jacobi-Davids...

The standard forms of the Kaczmarz-Tanabe type methods and their convergence theory

In this paper, we consider the standard form of two kinds of Kaczmarz-Ta...

The J-method for the Gross-Pitaevskii eigenvalue problem

This paper studies the J-method of [E. Jarlebring, S. Kvaal, W. Michiels...