Convergence results on greedy algorithms for high-dimensional eigenvalue problems

DOI10.1051/PROC/201445015zbMATH Open1337.65145OpenAlexW2125677358MaRDI QIDQ3465846FDOQ3465846

Authors: Virginie Ehrlacher 

Publication date: 29 January 2016

Published in: ESAIM: Proceedings and Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/proc/201445015

Recommendations

• Greedy algorithms for high-dimensional eigenvalue problems
• On the convergence of a greedy rank-one update algorithm for a class of linear systems
• Convergence of a greedy algorithm for high-dimensional convex nonlinear problems
• \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
• Greedy algorithms for high-dimensional non-symmetric linear problems

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical solutions to equations with linear operators (65J10)

Cited In (7)

• Convergence of algorithms of decomposition type for the eigenvalue problem
• Greedy algorithms for high-dimensional non-symmetric linear problems
• On the convergence of a greedy rank-one update algorithm for a class of linear systems
• Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods
• Convergence of algorithms for finding eigenvectors
• Greedy algorithms for high-dimensional eigenvalue problems
• Convergence of a greedy algorithm for high-dimensional convex nonlinear problems

This page was built for publication: Convergence results on 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 Q3465846)