2019
DOI: 10.1002/nla.2246
|View full text |Cite
|
Sign up to set email alerts
|

Fast approximate truncated SVD

Abstract: Summary This paper presents a new method for the computation of truncated singular value decomposition (SVD) of an arbitrary matrix. The method can be qualified as deterministic because it does not use randomized schemes. The number of operations required is asymptotically lower than that using conventional methods for nonsymmetric matrices and is at a par with the best existing deterministic methods for unstructured symmetric ones. It slightly exceeds the asymptotical computational cost of SVD methods based o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 15 publications
(4 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…The analytical BER computed from the derived PDSNR/ PDSINR is represented as "ana" and simulated BER is denoted as "sim." As the analytical BER given in (37) is inversely proportional to the PDSNR/PDSINR, therefore, the BER performance of linear detection schemes shown in Figure 6 follows an inverse trend with reference to PDSNR/PDSINR. A substantial improvement in the BER is witnessed for TSVD-based schemes when compared with the MRC, direct pseudo-inverse, and ZF schemes.…”
Section: Linear Detection Scheme Complexitymentioning
confidence: 90%
See 1 more Smart Citation
“…The analytical BER computed from the derived PDSNR/ PDSINR is represented as "ana" and simulated BER is denoted as "sim." As the analytical BER given in (37) is inversely proportional to the PDSNR/PDSINR, therefore, the BER performance of linear detection schemes shown in Figure 6 follows an inverse trend with reference to PDSNR/PDSINR. A substantial improvement in the BER is witnessed for TSVD-based schemes when compared with the MRC, direct pseudo-inverse, and ZF schemes.…”
Section: Linear Detection Scheme Complexitymentioning
confidence: 90%
“…a TSVD-based ZF using randomized schemes [36][37][38] In this section, Monte Carlo trails are used to demonstrate the effect of PDSINR on the BER of TSVD-based detection schemes. The simulation parameters used in this paper are given in Table 2.…”
Section: Linear Detection Scheme Complexitymentioning
confidence: 99%
“…Besides sparsity, a more reasonable property to leverage is fast eigenvalue decay, which opens onto a variety of methods for truncated approximate SVD. Deterministic methods allow to compute an r -rank approximation in O(r N 2 ) [52], whereas randomized methods can further reduce the complexity to O(log r N 2 + r 2 N ) [32,40]. We also remark that the actual Monte Carlo approximation of a given signal is in principle a different problem than the computation of the frame itself, and as such may in some cases be more tractable.…”
Section: Computational Considerationsmentioning
confidence: 96%
“…Next, the inverse document frequency (IDF) value of each word was calculated to build a custom IDF dictionary, enhancing the accuracy of keyword extraction. The TF-IDF algorithm was then applied to extract keywords from all the tower crane safety texts collected [55]. Using the constructed tower crane safety domain feature dictionary, feature matching was performed on the extracted keywords, obtaining the feature attributes of each tower crane safety accident text.…”
Section: Text Mining For Tower Crane Accidentsmentioning
confidence: 99%