A pre-processing procedure for the implementation of the greedy rank-one algorithm to solve high-dimensional linear systems

Algorithms that use tensor decompositions are widely used due to how well they perfor with large amounts of data. Among them, we find the algorithms that search for the solution of a linear system in separated form, where the greedy rank-one update method stands out, to be the starting point of the...

Full description

Bibliographic Details

Published in:	AIMS Mathematics
Main Authors:	J. Alberto Conejero, Antonio Falcó, María Mora–Jiménez
Format:	Article
Language:	English
Published:	AIMS Press 2023-09-01
Subjects:	tensor decompositions rank-one tensors high-dimensional linear systems laplacian-like matrices partial differential equations
Online Access:	https://www.aimspress.com/article/doi/10.3934/math.20231308?viewType=HTML