• Corpus ID: 245837696

Global monotone convergence of Newton-like iteration for a nonlinear eigen-problem

@inproceedings{Guo2022GlobalMC,
  title={Global monotone convergence of Newton-like iteration for a nonlinear eigen-problem},
  author={Pei-Chang Guo},
  year={2022}
}
The nonlinear eigen-problem Ax+ F(x) = λx is studied where A is an n × n irreducible Stieltjes matrix. Under certain conditions, this problem has a unique positive solution. We show that, starting from a multiple of the positive eigenvector of A, the Newton-like iteration for this problem converges monotonically. Numerical results illustrate the effectiveness of this Newton-like method. 

Tables from this paper

References

SHOWING 1-10 OF 10 REFERENCES
Convergence analysis of the Newton–Shamanskii method for a nonsymmetric algebraic Riccati equation
TLDR
Convergence analysis shows that the sequence of vectors generated by the Newton–Shamanskii method is monotonically increasing and converges to the minimal positive solution of the vector equation.
Matrix Iterative Analysis
Matrix Properties and Concepts.- Nonnegative Matrices.- Basic Iterative Methods and Comparison Theorems.- Successive Overrelaxation Iterative Methods.- Semi-Iterative Methods.- Derivation and
Monotone convergence of Newton-like methods for M-matrix algebraic Riccati equations
TLDR
It is shown that the sequence generated by the Newton–Shamanskii method converges monotonically to the minimal nonnegative solution of the Riccati equation, and it is explained that the Newton-like methods can be used to great advantage when solving some RicCati equations involving a parameter.
A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible $$M$$M-matrix
TLDR
This paper presents inexact Noda iterations (INI), to find the smallest eigenvalue and the associated positive eigenvector of a large irreducible nonsingular, and compares them with the Jacobi–Davidson method, the implicitly restarted Arnoldi method and the explicitly restarted Krylov–Schur method to illustrate that the overall efficiency of the INI algorithms is competitive with and can be considerably higher than the latter three methods.
A positivity preserving iterative method for finding the ground states of saturable nonlinear Schrödinger equations
TLDR
It is proved that this iterative method to compute the positive ground states of saturable nonlinear Schrodinger equations converges globally with a locally quadratic convergence rate to a positive solution of NAEP.
Solving Nonlinear Equations with Newton's Method
TLDR
This chapter discusses how to get the Newton Step with Gaussian Elimination software and some of the methods used to achieve this goal.
Theory of Bose-Einstein condensation in trapped gases
The phenomenon of Bose-Einstein condensation of dilute gases in traps is reviewed from a theoretical perspective. Mean-field theory provides a framework to understand the main features of the
Solving Nonlinear Equations
in: A Generalization of the Perron-Frobenius Theorem for Non-Linear Perturbations of Stieltjes Matrices
  • in: Contemporary Mathematics, AMS, Providence, RI, vol. 281
  • 2001