English
Related papers

Related papers: Centrality of Lowdin orthogonalizations

200 papers

High-dimensional image data often require dimensionality reduction before further analysis. This paper provides a purely analytical comparison of two linear techniques-Principal Component Analysis (PCA) and Singular Value Decomposition…

Computer Vision and Pattern Recognition · Computer Science 2025-06-27 Michael Gyimadu , Gregory Bell , Ph. D

Singular Value Decomposition (SVD) and its close relative, Principal Component Analysis (PCA), are well-known linear matrix decomposition techniques that are widely used in applications such as dimension reduction and clustering. However,…

Computer Vision and Pattern Recognition · Computer Science 2021-06-25 Abdolrahman Khoshrou , Eric J. Pauwels

Singular value decomposition (SVD) has a crucial role in model order reduction. It is often utilized in the offline stage to compute basis functions that project the high-dimensional nonlinear problem into a low-dimensionsl model which is,…

Numerical Analysis · Mathematics 2016-11-09 Alessandro Alla , J. Nathan Kutz

In this paper, we present a natural implementation of singular value decomposition (SVD) and polar decomposition of an arbitrary multivector in nondegenerate real and complexified Clifford geometric algebras of arbitrary dimension and…

Mathematical Physics · Physics 2024-12-24 D. S. Shirokov

The singular value decomposition (SVD) is not only a classical theory in matrix computation and analysis, but also is a powerful tool in machine learning and modern data analysis. In this tutorial we first study the basic notion of SVD and…

Machine Learning · Computer Science 2015-10-30 Zhihua Zhang

Proper orthogonal decomposition (POD) and dynamic mode decomposition (DMD) are two complementary singular-value decomposition (SVD) techniques that are widely used to construct reduced-order models (ROMs) in a variety of fields of science…

Numerical Analysis · Mathematics 2020-02-19 Hannah Lu , Daniel M. Tartakovsky

Linear least-squares regression with a "design" matrix A approximates a given matrix B via minimization of the spectral- or Frobenius-norm discrepancy ||AX-B|| over every conformingly sized matrix X. Another popular approximation is…

Methodology · Statistics 2024-04-09 Mark Tygert

Variables in many massive high-dimensional data sets are structured, arising for example from measurements on a regular grid as in imaging and time series or from spatial-temporal measurements as in climate studies. Classical multivariate…

Methodology · Statistics 2012-03-14 Genevera I. Allen , Logan Grosenick , Jonathan Taylor

We present a new methodology for decomposing flows with multiple transports that further extends the shifted proper orthogonal decomposition (sPOD). The sPOD tries to approximate transport-dominated flows by a sum of co-moving data fields.…

Numerical Analysis · Mathematics 2025-03-07 Philipp Krah , Arthur Marmin , Beata Zorawski , Julius Reiss , Kai Schneider

Many statistical problems involve the estimation of a $\left(d\times d\right)$ orthogonal matrix $\textbf{Q}$. Such an estimation is often challenging due to the orthonormality constraints on $\textbf{Q}$. To cope with this problem, we…

Methodology · Statistics 2019-06-04 Luca Bagnato , Antonio Punzo

This work presents the application of the Complex Orthogonal Decomposition (C.O.D.) to a simple spatio-temporal signal. C.O.D. has been introduced rst in the article of B. Feeny, entitled "A Complex Orthogonal Decomposition for Wave Motion…

Signal Processing · Electrical Eng. & Systems 2026-04-16 Marc Vacher , Stéphane Perrard , Sophie Ramananarivo

These notes are an overview of some classical linear methods in Multivariate Data Analysis. This is a good old domain, well established since the 60's, and refreshed timely as a key step in statistical learning. It can be presented as part…

Numerical Analysis · Mathematics 2023-05-25 Alain Franc

Structured optimization uses a prescribed set of atoms to assemble a solution that fits a model to data. Polarity, which extends the familiar notion of orthogonality from linear sets to general convex sets, plays a special role in a simple…

Optimization and Control · Mathematics 2019-12-12 Zhenan Fan , Halyun Jeong , Yifan Sun , Michael P. Friedlander

The canonical polyadic decomposition (CPD) is a fundamental tensor decomposition which expresses a tensor as a sum of rank one tensors. In stark contrast to the matrix case, with light assumptions, the CPD of a low rank tensor is…

Numerical Analysis · Mathematics 2022-02-24 Eric Evert , Michiel Vandecappelle , Lieven De Lathauwer

Notions of the orthogonality and convolution orthogonality are explored with the use of the Kontorovich-Lebedev transform and its convolution. New classes of the corresponding orthogonal polynomials and functions are investigated. Integral…

Classical Analysis and ODEs · Mathematics 2019-09-24 Semyon Yakubovich

Our goal here is to see the space of matrices of a given size from a geometric and topological perspective, with emphasis on the families of various ranks and how they fit together. We pay special attention to the nearest orthogonal…

Singular value decomposition (SVD) is the mathematical basis of principal component analysis (PCA). Together, SVD and PCA are one of the most widely used mathematical formalism/decomposition in machine learning, data mining, pattern…

Machine Learning · Computer Science 2018-04-17 Shuai Zheng , Chris Ding , Feiping Nie

The research detailed in this paper scrutinizes Principal Component Analysis (PCA), a seminal method employed in statistics and machine learning for the purpose of reducing data dimensionality. Singular Value Decomposition (SVD) is often…

Methodology · Statistics 2024-04-02 Donggun Kim , Kisung You

The singular value decomposition (SVD) and the principal component analysis are fundamental tools and probably the most popular methods for data dimension reduction. The rapid growth in the size of data matrices has lead to a need for…

Statistics Theory · Mathematics 2020-02-03 Ting-Li Chen , Su-Yun Huang , Weichung Wang

Low rank orthogonal tensor approximation (LROTA) is an important problem in tensor computations and their applications. A classical and widely used algorithm is the alternating polar decomposition method (APD). In this article, an improved…

Optimization and Control · Mathematics 2020-01-01 Shenglong Hu , Ke Ye
‹ Prev 1 2 3 10 Next ›