Greedy algorithms for high-dimensional eigenvalue problems

DOI10.1007/S00365-014-9266-YzbMath1310.47025arXiv1304.2631OpenAlexW2090649942MaRDI QIDQ485351

Virginie Ehrlacher, Eric Cancès, Tony Lelièvre

Publication date: 9 January 2015

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.2631

zbMATH Keywords

eigenvalueeigenvectorgreedy algorithmSchrödinger equationnonlinear approximationbuckling plate

Mathematics Subject Classification ID

Estimates of eigenvalues in context of PDEs (35P15) Eigenvalue problems for linear operators (47A75) PDEs in connection with quantum mechanics (35Q40) Numerical solutions to equations with linear operators (65J10) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) PDEs in connection with mechanics of deformable solids (35Q74) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (7)

The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor ⋮ Low-rank tensor methods for partial differential equations ⋮ Reduced basis approximation anda posteriorierror estimates for parametrized elliptic eigenvalue 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 ⋮ Range-Separated Tensor Format for Many-Particle Modeling ⋮ Low-rank approximation of linear parabolic equations by space-time tensor Galerkin methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces
• Tensor-based methods for numerical homogenization from high-resolution images
• 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
• A new family of solvers for some classes of multidimensional partial differential equations encountered in kinetic theory modeling of complex fluids
• QTT representation of the Hartree and exchange operators in electronic structure calculations
• Constructive solution of a bilinear optimal control problem for a Schrödinger equation
• Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
• Convergence of gradient-based algorithms for the Hartree-Fock equations
• On Local Convergence of Alternating Schemes for Optimization of Convex Problems in the Tensor Train Format
• A prioriconvergence of the Greedy algorithm for the parametrized reduced basis method
• CONVERGENCE OF A GREEDY ALGORITHM FOR HIGH-DIMENSIONAL CONVEX NONLINEAR PROBLEMS
• The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
• Low-Rank Approximate Inverse for Preconditioning Tensor-Structured Linear Systems
• Greedy Approximation
• Tensor Spaces and Numerical Tensor Calculus
• Greedy algorithms for high-dimensional non-symmetric linear problems
• 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
• Greedy approximation
• Numerical solution of parabolic equations in high dimensions
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Algorithms for Numerical Analysis in High Dimensions

This page was built for publication: Greedy algorithms for high-dimensional eigenvalue problems