Minimization of the computational labor in determining the first eigenvalues of differential operators

From MaRDI portal
Publication:1156465

DOI10.1007/BF01139851zbMath0468.65056MaRDI QIDQ1156465

M. Yu. Orekhov, Evgenij D'yakonov

Publication date: 1980

Published in: Mathematical Notes (Search for Journal in Brave)




Related Items

On the approximation of electronic wavefunctions by anisotropic Gauss and Gauss-Hermite functions, A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases, Preconditioned iterative methods for a class of nonlinear eigenvalue problems, Localization and Delocalization of Ground States of Bose--Einstein Condensates Under Disorder, Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization, Enhanced error estimates for augmented subspace method, Quantitative Anderson localization of Schrödinger eigenstates under disorder potentials, A Parallel Augmented Subspace Method for Eigenvalue Problems, A subspace preconditioning algorithm for eigenvector/eigenvalue computation, Preconditioned gradient iterations for the eigenproblem of definite matrix pairs, Towards solving large-scale topology optimization problems with buckling constraints at the cost of linear analyses, An efficient method for band structure calculations in 2D photonic crystals, Fast Eigenpairs Computation with Operator Adapted Wavelets and Hierarchical Subspace Correction, Effective dimensional reduction algorithm for eigenvalue problems for thin elastic structures: A paradigm in three dimensions, A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient, A geometric theory for preconditioned inverse iteration. II: Convergence estimates, A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems



Cites Work