Adaptive Low-Rank Approximation of Collocation Matrices
نویسندگان
چکیده
منابع مشابه
Adaptive Variable - Rank Approximation of General Dense Matrices Steffen
In order to handle large dense matrices arising in the context of integral equations efficiently, panel-clustering approaches (like the popular multipole expansion method) have proven to be very useful. These techniques split the matrix into blocks, approximate the kernel function on each block by a degenerate expansion, and discretize this expansion in order to find an efficient low-rank appro...
متن کاملAdaptive Variable-Rank Approximation of General Dense Matrices
In order to handle large dense matrices arising in the context of integral equations efficiently, panel-clustering approaches (like the popular multipole expansion method) have proven to be very useful. These techniques split the matrix into blocks, approximate the kernel function on each block by a degenerate expansion, and discretize this expansion in order to find an efficient low-rank appro...
متن کاملLow-rank Matrices in the Approximation of Tensors
Most successful numerical algorithms for multi-dimensional problems usually involve multi-index arrays, also called tensors, and capitalize on those tensor decompositions that reduce, one way or another, to low-rank matrices associated with the given tensors. It can be argued that the most of recent progress is due to the TT and HT decompostions [1]. The differences between the two decompositio...
متن کاملNon-iterative generalized low rank approximation of matrices
As an extension to 2DPCA, Generalized Low Rank Approximation of Matrices (GLRAM) applies two-sided (i.e., the left and right) rather than single-sided (i.e., the left or the right alone) linear projecting transform(s) to each 2D image for compression and feature extraction. Its advantages over 2DPCA include higher compression ratio and superior classification performance etc. However, GLRAM can...
متن کاملLiterature survey on low rank approximation of matrices
Low rank approximation of matrices has been well studied in literature. Singular value decomposition , QR decomposition with column pivoting, rank revealing QR factorization (RRQR), Interpolative decomposition etc are classical deterministic algorithms for low rank approximation. But these techniques are very expensive (O(n 3) operations are required for n × n matrices). There are several rando...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing
سال: 2003
ISSN: 0010-485X,1436-5057
DOI: 10.1007/s00607-002-1469-6