Greedy algorithms for high-dimensional eigenvalue problems
Estimates of eigenvalues in context of PDEs (35P15) PDEs in connection with quantum mechanics (35Q40) PDEs in connection with mechanics of deformable solids (35Q74) Eigenvalue problems for linear operators (47A75) Numerical solutions to equations with linear operators (65J10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)
The authors work within the following context. They consider two Hilbert spaces \((V,\langle\cdot,\cdot\rangle_V)\) and \((H,\langle\cdot,\cdot\rangle)\) with the induced norms \(\|\cdot\|_V\) and \(\|\cdot\|,\) respectively, and suppose that (HV) the embedding \(V\hookrightarrow H\) is dense and compact. They consider also a symmetric continuous bilinear form \(a(\cdot,\cdot)\) on \(V\times V\) such that (HA) \(\exists \gamma,\nu >0\) such that \(a(v,v)\geq\gamma \|v\|^2_V-\nu \|v\|^2\) for all \(v\in V\) . It is known that, under the hypotheses (HV) and (HA), there exists a sequence \((\psi_k,\mu_k)_{k\geq 1}\) of solutions to the elliptic eigenvalue problem (*) find \((\psi,\mu)\in V\times \mathbb R,\, \|\psi\|=1\) such that \(a(\psi,v)=\mu \langle \psi,v\rangle\) for all \(v\in V\), and such that the sequence \((\mu_k)\) is nondecreasing with \(\mu_k\to \infty\) and \((\psi_k)\) forms an orthonormal basis of \(H\). The paper is concerned with the calculation of the smallest eigenvalue \(\mu_1\) and of an associated \(H\)-normalized eigenvector. The authors propose two greedy algorithms for the solution of this problem -- \textit{Pure Rayleigh Algorithm} and \textit{Pure Residual Algorithm} -- and prove some convergence results for these algorithms. Some numerical test cases (as, e.g., the computation of the buckling modes of a microstructured plate) are included.
- \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
- A new family of solvers for some classes of multidimensional partial differential equations encountered in kinetic theory modeling of complex fluids
- Algorithms for Numerical Analysis in High Dimensions
- Approximating a wavefunction as an unconstrained sum of Slater determinants
- Circumventing Curse of Dimensionality in the Solution of Highly Multidimensional Models Encountered in Quantum Mechanics Using Meshfree Finite Sums Decomposition
- Constructive solution of a bilinear optimal control problem for a Schrödinger equation
- Convergence of a greedy algorithm for high-dimensional convex nonlinear problems
- Convergence of gradient-based algorithms for the Hartree-Fock equations
- Greedy algorithms for high-dimensional non-symmetric linear problems
- Greedy approximation
- Greedy approximation
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3168288 (Why is no real title available?)
- scientific article; zbMATH DE number 51146 (Why is no real title available?)
- scientific article; zbMATH DE number 3622441 (Why is no real title available?)
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- scientific article; zbMATH DE number 1250672 (Why is no real title available?)
- scientific article; zbMATH DE number 3321507 (Why is no real title available?)
- scientific article; zbMATH DE number 3381034 (Why is no real title available?)
- Low-rank approximate inverse for preconditioning tensor-structured linear systems
- Numerical solution of parabolic equations in high dimensions
- On local convergence of alternating schemes for optimization of convex problems in the tensor train format
- Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces
- QTT representation of the Hartree and exchange operators in electronic structure calculations
- Recent developments in spectral stochastic methods for the numerical solution of stochastic partial differential equations
- Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations
- Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
- Tensor spaces and numerical tensor calculus
- Tensor-based methods for numerical homogenization from high-resolution images
- The alternating linear scheme for tensor optimization in the tensor train format
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Reduced basis approximation and a posteriori error estimates for parametrized elliptic eigenvalue problems
- Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
- The optimization landscape for fitting a rank-2 tensor with a rank-1 tensor
- Greedy algorithms for high-dimensional non-symmetric linear problems
- Convergence results on greedy algorithms for high-dimensional eigenvalue problems
- Range-separated tensor format for many-particle modeling
- Low-rank approximation of linear parabolic equations by space-time tensor Galerkin methods
- A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors
- Low-rank tensor methods for partial differential equations
- Reduced-order modeling of neutron transport eigenvalue problems separated in energy by proper generalized decomposition
This page was built for publication: Greedy algorithms for high-dimensional eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q485351)
