Implementation of the gmr algorithm for large symmetric eigenproblems
One of the most efficient methods for solving the polynomial eigenvalue problem (PEP) is the Sakurai-Sugiura method with Rayleigh-Ritz projection (SS-RR), which finds the eigenvalues contained in a certain domain using the contour integral. The SS-RR method converts the original PEP to a small projected PEP using the Rayleigh-Ritz projection. However, the SS-RR method suffers from backward instability when the norms of the coefficient matrices of the projected PEP vary widely. To improve the backward...
Within the effective mass and nonparabolic band theory, a general framework of mathematical models and numerical methods is developed for theoretical studies of semiconductor quantum dots. It includes single-electron models and many-electron models of Hartree-Fock, configuration interaction, and current-spin density functional theory approaches. These models result in nonlinear eigenvalue problems from a suitable discretization. Cubic and quintic Jacobi-Davidson methods of block or nonblock version...
One method for computing the least eigenvalue of a positive definite matrix of order is described.
An algorithm for quadratic minimization with simple bounds is introduced, combining, as many well-known methods do, active set strategies and projection steps. The novelty is that here the criterion for acceptance of a projected trial point is weaker than the usual ones, which are based on monotone decrease of the objective function. It is proved that convergence follows as in the monotone case. Numerical experiments with bound-constrained quadratic problems from CUTE collection show that the modified...