AbstractA theoretical framework is developed for constructing spectral refinement schemes for a simple eigenelement which achieve arbitrarily high rates of convergence while keeping the computational cost at a minimum. The new approach is illustrated by considering a Newton type iteration scheme. Numerical results are given by considering a model problem
© 2015, Pleiades Publishing, Ltd. We study an eigenvalue problem with a nonlinear dependence on the ...
We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on...
The boundary matrix method for solving eigenvalue problems for the Laplace operator is formulated in...
AbstractA theoretical framework is developed for constructing spectral refinement schemes for a simp...
A general framework is developed for constructing higher order spectral refinement schemes for a sim...
In this paper we consider two spectral refinement schemes, elementary and double iteration, for the ...
In this paper, we extent the classical spectral approximation theory for compact and bounded operato...
Exact eigenvalues, eigenvectors, and principal vectors of operators with infinite dimensional ranges...
We discuss the close connection between eigenvalue computation and optimization using the Newton met...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/17...
Arnoldi's method is often used to compute a few eigenvalues and eigenvectors of large, sparse matric...
This thesis focuses on the construction of the eigen-based high-order expansion bases for spectral e...
Graduation date: 1973In this thesis we examine the approximation theory of the\ud eigenvalue problem...
summary:We propose a new type of multilevel method for solving eigenvalue problems based on Newton's...
AbstractIn several applications needing the numerical computation of eigenvalues and eigenvectors we...
© 2015, Pleiades Publishing, Ltd. We study an eigenvalue problem with a nonlinear dependence on the ...
We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on...
The boundary matrix method for solving eigenvalue problems for the Laplace operator is formulated in...
AbstractA theoretical framework is developed for constructing spectral refinement schemes for a simp...
A general framework is developed for constructing higher order spectral refinement schemes for a sim...
In this paper we consider two spectral refinement schemes, elementary and double iteration, for the ...
In this paper, we extent the classical spectral approximation theory for compact and bounded operato...
Exact eigenvalues, eigenvectors, and principal vectors of operators with infinite dimensional ranges...
We discuss the close connection between eigenvalue computation and optimization using the Newton met...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/17...
Arnoldi's method is often used to compute a few eigenvalues and eigenvectors of large, sparse matric...
This thesis focuses on the construction of the eigen-based high-order expansion bases for spectral e...
Graduation date: 1973In this thesis we examine the approximation theory of the\ud eigenvalue problem...
summary:We propose a new type of multilevel method for solving eigenvalue problems based on Newton's...
AbstractIn several applications needing the numerical computation of eigenvalues and eigenvectors we...
© 2015, Pleiades Publishing, Ltd. We study an eigenvalue problem with a nonlinear dependence on the ...
We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on...
The boundary matrix method for solving eigenvalue problems for the Laplace operator is formulated in...
DOI
Add to ORKG