On the convergence of a greedy rank-one update algorithm for a class of linear systems
DOI10.1007/s11831-010-9048-zzbMath1269.65120OpenAlexW2007170193WikidataQ113323918 ScholiaQ113323918MaRDI QIDQ358491
Amine Ammar, Francisco Chinesta, Antonio Falcó
Publication date: 9 August 2013
Published in: Archives of Computational Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11831-010-9048-z
Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (36)
Cites Work
- Unnamed Item
- Unnamed Item
- A new family of solvers for some classes of multidimensional partial differential equations encountered in kinetic theory modelling of complex fluids. II: Transient simulation using space-time separated representations
- A new family of solvers for some classes of multidimensional partial differential equations encountered in kinetic theory modeling of complex fluids
- Projection pursuit
- The ubiquitous Kronecker product
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- Orthogonal Tensor Decompositions
- Greedy approximation
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Matching pursuits with time-frequency dictionaries
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Algorithms for Numerical Analysis in High Dimensions
This page was built for publication: On the convergence of a greedy rank-one update algorithm for a class of linear systems