Related papers: The infinite Lanczos method for symmetric nonlinea…
In this work, we combine Beyn's method and the recently developed recursive integral method (RIM) to propose a contour integral-based, region partitioning eigensolver for nonlinear eigenvalue problems. A new partitioning criterion is…
We consider solving equality-constrained nonlinear, nonconvex optimization problems. This class of problems appears widely in a variety of applications in machine learning and engineering, ranging from constrained deep neural networks, to…
Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…
Recently, a class of algorithms combining classical fixed point iterations with repeated random sparsification of approximate solution vectors has been successfully applied to eigenproblems with matrices as large as $10^{108} \times…
The parallel orbital-updating approach is an orbital/eigenfunction iteration based approach for solving eigenvalue problems when many eigenpairs are required. It has been proven to be efficient, for instance, in electronic structure…
We adapt a symmetric interior penalty discontinuous Galerkin method using a patch reconstructed approximation space to solve elliptic eigenvalue problems, including both second and fourth order problems in 2D and 3D. It is a direct…
This paper is concerned with recovering the solution of a final value problem associated with a parabolic equation involving a non linear source and a non-local term, which to the best of our knowledge has not been studied earlier. It is…
We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…
The nonlinear eigenvalue problem of a class of second order semi-transcendental differential equations is studied. A nonlinear eigenvalue is defined as the initial condition which gives rise a separatrix solution. A semi-transcendental…
The solution of linear non-autonomous ordinary differential equation systems (also known as the time-ordered exponential) is a computationally challenging problem arising in a variety of applications. In this work, we present and study a…
In this article we are interested for the numerical study of nonlinear eigenvalue problems. We begin with a review of theoretical results obtained by functional analysis methods, especially for the Schrodinger pencils. Some recall are given…
We present a simple, accurate method for solving consistent, rank-deficient linear systems, with or without addi- tional rank-completing constraints. Such problems arise in a variety of applications, such as the computation of the…
An application of an effective numerical algorithm for solving eigenvalue problems which arise in modelling electronic properties of quantum disordered systems is considered. We study the electron states at the localization-delocalization…
We consider inverse problems for non-linear hyperbolic and elliptic equations and give an introduction to the method based on the multiple linearization, or on the construction of artificial sources, to solve these problems. The method is…
In recent years Landweber(-Kaczmarz) method has been proposed for solving nonlinear ill-posed inverse problems in Banach spaces using general convex penalty functions. The implementation of this method involves solving a (nonsmooth) convex…
The worst situation in computing the minimal nonnegative solution of a nonsymmetric algebraic Riccati equation associated with an M-matrix occurs when the corresponding linearizing matrix has two very small eigenvalues, one with positive…
We obtain a comparison result for solutions to nonlinear fully anisotropic elliptic problems by means of anisotropic symmetrization. As consequence we deduce a priori estimates for norms of the relevant solutions.
This paper explores variants of the subspace iteration algorithm for computing approximate invariant subspaces. The standard subspace iteration approach is revisited and new variants that exploit gradient-type techniques combined with a…
We combine the parameterization method for invariant manifolds with the finite element method for elliptic PDEs,to obtain a new computational framework for high order approximation of invariant manifolds attached to unstable equilibrium…
We apply the asymptotic iteration method (AIM) [J. Phys. A: Math. Gen. 36, 11807 (2003)] to solve new classes of second-order homogeneous linear differential equation. In particular, solutions are found for a general class of eigenvalue…