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
summary:The iteration subspace method for approximating a few points of the spectrum of a positive l...
Graduation date: 1973In this thesis we examine the approximation theory of the\ud eigenvalue problem...
Discretisations of differential eigenvalue problems have a sensitivity to perturbations which is asy...
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 ...
summary:A survey of simple iterative processes is given with theorems and conditions for their conve...
AbstractWe investigate novel iterative refinement methods for solving eigenvalue problems which are ...
AbstractRefined error estimates are obtained for the approximation of discrete spectra of linear ope...
This thesis is concerned with inexact eigenvalue algorithms for solving large and sparse algebraic e...
AbstractBy means of a Fixed Slope Inexact Newton Method we define an Iterative Refinement Process fo...
AbstractInverse iteration and Newton's method for the eigenvalue problem are related to best approxi...
We discuss the close connection between eigenvalue computation and optimization using the Newton met...
AbstractThis paper proposes new iterative methods for the efficient computation of the smallest eige...
AbstractIn this paper we propose a Modified Block Newton Method (MBNM) for approximating an invarian...
summary:The iteration subspace method for approximating a few points of the spectrum of a positive l...
Graduation date: 1973In this thesis we examine the approximation theory of the\ud eigenvalue problem...
Discretisations of differential eigenvalue problems have a sensitivity to perturbations which is asy...
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 ...
summary:A survey of simple iterative processes is given with theorems and conditions for their conve...
AbstractWe investigate novel iterative refinement methods for solving eigenvalue problems which are ...
AbstractRefined error estimates are obtained for the approximation of discrete spectra of linear ope...
This thesis is concerned with inexact eigenvalue algorithms for solving large and sparse algebraic e...
AbstractBy means of a Fixed Slope Inexact Newton Method we define an Iterative Refinement Process fo...
AbstractInverse iteration and Newton's method for the eigenvalue problem are related to best approxi...
We discuss the close connection between eigenvalue computation and optimization using the Newton met...
AbstractThis paper proposes new iterative methods for the efficient computation of the smallest eige...
AbstractIn this paper we propose a Modified Block Newton Method (MBNM) for approximating an invarian...
summary:The iteration subspace method for approximating a few points of the spectrum of a positive l...
Graduation date: 1973In this thesis we examine the approximation theory of the\ud eigenvalue problem...
Discretisations of differential eigenvalue problems have a sensitivity to perturbations which is asy...
DOI
Add to ORKG