Pith. sign in

REVIEW

Low-cost singular value decomposition with optimal sensor placement

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.09791 v2 pith:4WQ3MMPU submitted 2023-11-16 cs.CE

Low-cost singular value decomposition with optimal sensor placement

classification cs.CE
keywords methodoptimalsensoralgorithmallowsbeencalculatedcomputational
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper presents a new method capable of reconstructing datasets with great precision and very low computational cost using a novel variant of the singular value decomposition (SVD) algorithm that has been named low-cost SVD (lcSVD). This algorithm allows to reconstruct a dataset from a minimum amount of points, that can be selected randomly, equidistantly or can be calculated using the optimal sensor placement functionality that is also presented in this paper, which finds minimizing the reconstruction error to validate the calculated sensor positions. This method also allows to find the optimal number of sensors, aiding users in optimizing experimental data recollection. The method is tested in a series of datasets, which vary between experimental and numerical simulations, two- and three-dimensional data and laminar and turbulent flow, which have been used to demonstrate the capacity of this method based on its high reconstruction accuracy, robustness, and computational resource optimization. Maximum speed-up factors of 630 and memory reduction of 37% are found when compared to the application of standard SVD to the dataset. This method will be incorporated into ModelFLOWs-app's next version release.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.