Using singular value decomposition of component eigenmodes for interface reduction
نویسندگان
چکیده
منابع مشابه
Principal Component Analysis using Singular Value Decomposition of Microarray Data
A series of microarray experiments produces observations of differential expression for thousands of genes across multiple conditions. Principal component analysis(PCA) has been widely used in multivariate data analysis to reduce the dimensionality of the data in order to simplify subsequent analysis and allow for summarization of the data in a parsimonious manner. PCA, which can be implemented...
متن کاملپیشنهاد روش جدیدی برای محاسبه polynomial singular value decomposition ) psvd )
در این پایان نامه به معرفی روشهای مختلف محاسبه psvd می پردازیم. بخشی از این روشها به بررسی روشهای مختلف محاسبه psvd در مقالات مطالعه شده می پردازد که می توان به محاسبهpsvd با استفاده از الگوریتمهای pqrd و pevd و sbr2 و محاسبه psvd براساس تکنیک kogbetliantz و روش پارامتریک برای محاسبه psvd اشاره نمود. بخش بعدی نیز به بررسی روشهای مستقیم پیشنهادی محاسبه psvd برای ماتریسهای 2×2و2× n و n×2 و 3× n و...
15 صفحه اولConcept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexity plays significant role when computing all concepts from a huge incidence matrix. In this paper we try to modify an incidence matrix using matrix decomposition, creating a new matrix with fewer dimensions as an input...
متن کاملSingular Value Decomposition based Steganography Technique for JPEG2000 Compressed Images
In this paper, a steganography technique for JPEG2000 compressed images using singular value decomposition in wavelet transform domain is proposed. In this technique, DWT is applied on the cover image to get wavelet coefficients and SVD is applied on these wavelet coefficients to get the singular values. Then secret data is embedded into these singular values using scaling factor. Different com...
متن کاملMore Accurate Bidiagonal Reduction for Computing the Singular Value Decomposition
Bidiagonal reduction is the preliminary stage for the fastest stable algorithms for computing the singular value decomposition. However, the best error bounds on bidiagonal reduction methods are of the form A + A = UBV T ; kAk 2 " M f(n)kAk 2 where B is bidiagonal, U and V are orthogonal, " M is machine precision, and f(n) is a modestly growing function of the dimensions of A. A Givens-based bi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Sound and Vibration
سال: 2018
ISSN: 0022-460X
DOI: 10.1016/j.jsv.2017.05.029