Pages that link to "Item:Q485351"

The following pages link to Greedy algorithms for high-dimensional eigenvalue problems (Q485351):

Displaying 9 items.

• Reduced basis approximation and<i>a posteriori</i>error estimates for parametrized elliptic eigenvalue problems (Q2953005) (← links)
• Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality (Q2954392) (← links)
• The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor (Q3176269) (← links)
• Greedy algorithms for high-dimensional non-symmetric linear problems (Q3451670) (← links)
• Convergence results on greedy algorithms for high-dimensional eigenvalue problems (Q3465846) (← links)
• Range-Separated Tensor Format for Many-Particle Modeling (Q4637674) (← links)
• Low-rank approximation of linear parabolic equations by space-time tensor Galerkin methods (Q5230146) (← links)
• Low-rank tensor methods for partial differential equations (Q6047498) (← links)
• Reduced-order modeling of neutron transport eigenvalue problems separated in energy by proper generalized decomposition (Q6147105) (← links)