Application of the sequential matrix diagonalization algorithm to high-dimensional functional MRI data
From MaRDI portal
Recommendations
- Spatial functional principal component analysis with applications to brain image data
- Sparse-smooth regularized singular value decomposition
- A generalized least-square matrix decomposition
- Prewhitening high-dimensional fMRI data sets without eigendecomposition
- Sparse principal component analysis in Hilbert space
Cites work
- An EVD Algorithm for Para-Hermitian Polynomial Matrices
- Fast projection methods for minimal design problems in linear system theory
- scientific article; zbMATH DE number 432514 (Why is no real title available?)
- scientific article; zbMATH DE number 837698 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Independent component analysis for tensor-valued data
- Independent component analysis, a new concept?
- On the Existence and Uniqueness of the Eigenvalue Decomposition of a Parahermitian Matrix
- Sequential Matrix Diagonalization Algorithms for Polynomial EVD of Parahermitian Matrices
- Templates for the Solution of Algebraic Eigenvalue Problems
Cited in
(5)- Circulant Partial Hadamard Matrices: Construction via General Difference Sets and Its Application to fMRI Experiments
- Prewhitening high-dimensional fMRI data sets without eigendecomposition
- Supervised classification of curves via a combined use of functional data analysis and tree-based methods
- Pooling random forest and functional data analysis for biomedical signals supervised classification: theory and application to electrocardiogram data
- Functional data analysis applications in medicine: a systematic review
This page was built for publication: Application of the sequential matrix diagonalization algorithm to high-dimensional functional MRI data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782634)