Add to ORKGIn this paper we develop new preconditioned iterative methods for solving monotone nonlinear eigenvalue problems. We investigate the convergence and derive grid-independent error estimates for these methods. Numerical experiments demonstrate the practical effectiveness of the proposed methods for a model problem
We will combine linear successive overrelaxation method with nonlinear monotone iterative scheme to ...
AbstractAn algorithm for solving nonlinear monotone equations is proposed, which combines a modified...
We numerically solving semilinear elliptic problems with the method of upper and lower solutions. In...
In this paper we develop new preconditioned iterative methods for solving monotone nonlinear eigen...
This paper proposes new iterative methods for the efficient computation of the smallest eigenvalue o...
AbstractThis paper proposes new iterative methods for the efficient computation of the smallest eige...
AbstractThis paper discusses from the computational point of view the convergence and error bounds o...
AbstractA simple technique is given in this paper for the construction and analysis of monotone iter...
A modification to an existing iterative method for computing zeros with unknown multiplicities of no...
AbstractThe nonlinear eigen-problemAx+F(x)=λx,where A is an n×n irreducible Stieltjes matrix, is con...
. In the Davidson method, any preconditioner can be exploited for the iterative computation of eigen...
In the Davidson method, any preconditioner can be exploited for the iterative computation of eigen-p...
Abstract. In the Davidson method, any preconditioner can be exploited for the iterative computation ...
A modification to an existing iterative method for computing zeros with unknown multiplicities of no...
AbstractIterative methods for solving large, sparse, symmetric eigenvalue problems often encounter c...
We will combine linear successive overrelaxation method with nonlinear monotone iterative scheme to ...
AbstractAn algorithm for solving nonlinear monotone equations is proposed, which combines a modified...
We numerically solving semilinear elliptic problems with the method of upper and lower solutions. In...
In this paper we develop new preconditioned iterative methods for solving monotone nonlinear eigen...
This paper proposes new iterative methods for the efficient computation of the smallest eigenvalue o...
AbstractThis paper proposes new iterative methods for the efficient computation of the smallest eige...
AbstractThis paper discusses from the computational point of view the convergence and error bounds o...
AbstractA simple technique is given in this paper for the construction and analysis of monotone iter...
A modification to an existing iterative method for computing zeros with unknown multiplicities of no...
AbstractThe nonlinear eigen-problemAx+F(x)=λx,where A is an n×n irreducible Stieltjes matrix, is con...
. In the Davidson method, any preconditioner can be exploited for the iterative computation of eigen...
In the Davidson method, any preconditioner can be exploited for the iterative computation of eigen-p...
Abstract. In the Davidson method, any preconditioner can be exploited for the iterative computation ...
A modification to an existing iterative method for computing zeros with unknown multiplicities of no...
AbstractIterative methods for solving large, sparse, symmetric eigenvalue problems often encounter c...
We will combine linear successive overrelaxation method with nonlinear monotone iterative scheme to ...
AbstractAn algorithm for solving nonlinear monotone equations is proposed, which combines a modified...
We numerically solving semilinear elliptic problems with the method of upper and lower solutions. In...