Abstract. We demonstrate that eigenvalue problems for ordinary differential equations can be recast in a formulation suitable for the solution by polynomial collocation. It is shown that the well-posedness of the two formulations is equivalent in the regular as well as in the singular case. Thus, a collocation code equipped with asymptotically correct error estimation and adaptive mesh selection can be successfully applied to compute the eigenvalues and eigenfunctions efficiently and with reliable control of the accuracy. Numerical examples illustrate this claim
AbstractWe consider boundary value problems of the form {xy″+f(x)y′+[g(x)+λσ(x)]y=0,x∈(0,1),y(0)=α,α...
Minimal structured perturbations are constructed such that an approximate eigenpair of a nonlinear e...
AbstractWe consider boundary value problems of the form {xy″+f(x)y′+[g(x)+λσ(x)]y=0,x∈(0,1),y(0)=α,α...
We demonstrate that eigenvalue problems for ordinary differential equations can be recast in a formu...
Abstract. We demonstrate that eigenvalue problems for ordinary differential equations can be recast ...
Discretisations of differential eigenvalue problems have a sensitivity to perturbations which is asy...
Discretisations of differential eigenvalue problems have a sensitivity to perturbations which is asy...
Discretisations of differential eigenvalue problems have a sensitivity to perturbations which is asy...
Discretisations of differential eigenvalue problems have a sensitivity to perturbations which is asy...
AbstractWe describe a mesh selection strategy for the numerical solution of boundary value problems ...
We put forward a new method for the solution of eigenvalue problems for (systems of) ordinary differ...
AbstractA recently proposed computational method for analyzing linear ordinary differential eigensys...
This work is concerned with numerical methods for matrix eigenvalue problems that are nonlinear in t...
This work is concerned with numerical methods for matrix eigenvalue problems that are nonlinear in t...
Often the easiest way to discretize an ordinary or partial differential equation is by a rectangular...
AbstractWe consider boundary value problems of the form {xy″+f(x)y′+[g(x)+λσ(x)]y=0,x∈(0,1),y(0)=α,α...
Minimal structured perturbations are constructed such that an approximate eigenpair of a nonlinear e...
AbstractWe consider boundary value problems of the form {xy″+f(x)y′+[g(x)+λσ(x)]y=0,x∈(0,1),y(0)=α,α...
We demonstrate that eigenvalue problems for ordinary differential equations can be recast in a formu...
Abstract. We demonstrate that eigenvalue problems for ordinary differential equations can be recast ...
Discretisations of differential eigenvalue problems have a sensitivity to perturbations which is asy...
Discretisations of differential eigenvalue problems have a sensitivity to perturbations which is asy...
Discretisations of differential eigenvalue problems have a sensitivity to perturbations which is asy...
Discretisations of differential eigenvalue problems have a sensitivity to perturbations which is asy...
AbstractWe describe a mesh selection strategy for the numerical solution of boundary value problems ...
We put forward a new method for the solution of eigenvalue problems for (systems of) ordinary differ...
AbstractA recently proposed computational method for analyzing linear ordinary differential eigensys...
This work is concerned with numerical methods for matrix eigenvalue problems that are nonlinear in t...
This work is concerned with numerical methods for matrix eigenvalue problems that are nonlinear in t...
Often the easiest way to discretize an ordinary or partial differential equation is by a rectangular...
AbstractWe consider boundary value problems of the form {xy″+f(x)y′+[g(x)+λσ(x)]y=0,x∈(0,1),y(0)=α,α...
Minimal structured perturbations are constructed such that an approximate eigenpair of a nonlinear e...
AbstractWe consider boundary value problems of the form {xy″+f(x)y′+[g(x)+λσ(x)]y=0,x∈(0,1),y(0)=α,α...