Greedy algorithms for high-dimensional eigenvalue problems
From MaRDI portal
Estimates of eigenvalues in context of PDEs (35P15) PDEs in connection with quantum mechanics (35Q40) PDEs in connection with mechanics of deformable solids (35Q74) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Eigenvalue problems for linear operators (47A75) Numerical solutions to equations with linear operators (65J10)
Abstract: In this article, we present two new greedy algorithms for the computation of the lowest eigenvalue (and an associated eigenvector) of a high-dimensional eigenvalue problem, and prove some convergence results for these algorithms and their orthogonalized versions. The performance of our algorithms is illustrated on numerical test cases (including the computation of the buckling modes of a microstructured plate), and compared with that of another greedy algorithm for eigenvalue problems introduced by Ammar and Chinesta.
Recommendations
Cites work
- 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?)
- 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
- 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
- \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
Cited in
(9)- Convergence results on greedy algorithms for high-dimensional eigenvalue problems
- Greedy algorithms for high-dimensional non-symmetric linear problems
- Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
- Reduced-order modeling of neutron transport eigenvalue problems separated in energy by proper generalized decomposition
- Low-rank tensor methods for partial differential equations
- Low-rank approximation of linear parabolic equations by space-time tensor Galerkin methods
- The optimization landscape for fitting a rank-2 tensor with a rank-1 tensor
- Range-separated tensor format for many-particle modeling
- Reduced basis approximation and a posteriori error estimates for parametrized elliptic eigenvalue problems
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)
