Results 51 to 60 of about 3,813,510 (369)
On the Gauss decomposition of a matrix
A variation of the Gauss elimination with reduction process and the decomposition of the computation of the order of some finite linear groups of a matrix is described. Some applications are given analogous to canonical forms of decompositions. The canonical Gauss decomposition is also discussed for the case when the eigenvector matrix contains a ...
openaire +2 more sources
Decompose Boolean Matrices with Correlation Clustering
One of the tasks of data science is the decomposition of large matrices in order to understand their structures. A special case of this is when we decompose relations, i.e., logical matrices.
László Aszalós
doaj +1 more source
On the Iwasawa decomposition of a symplectic matrix
AbstractWe consider the computation of the Iwasawa decomposition of a symplectic matrix via the QR factorization. The algorithms presented improve on the method recently described by T.-Y. Tam in [Computing Iwasawa decomposition of a symplectic matrix by Cholesky factorization, Appl. Math. Lett. (in press) doi:10.1016/j.aml.2006.03.001].
Benzi, Michele, Razouk, Nader
openaire +3 more sources
Penalized matrix decomposition for denoising, compression, and improved demixing of functional imaging data [PDF]
Calcium imaging has revolutionized systems neuroscience, providing the ability to image large neural populations with single-cell resolution. The resulting datasets are quite large (with scales of TB/hour in some cases), which has presented a barrier to ...
E. Kelly Buchanan +19 more
semanticscholar +1 more source
Decrypting cancer's spatial code: from single cells to tissue niches
Spatial transcriptomics maps gene activity across tissues, offering powerful insights into how cancer cells are organised, switch states and interact with their surroundings. This review outlines emerging computational, artificial intelligence (AI) and geospatial approaches to define cell states, uncover tumour niches and integrate spatial data with ...
Cenk Celik +4 more
wiley +1 more source
The integration of renewable energy sources into modern power systems requires simulations with smaller step sizes, larger network models and the incorporation of complex nonlinear component models.
Jan Dinkelbach +4 more
doaj +1 more source
Fast Spectral Clustering Using Autoencoders and Landmarks
In this paper, we introduce an algorithm for performing spectral clustering efficiently. Spectral clustering is a powerful clustering algorithm that suffers from high computational complexity, due to eigen decomposition.
A Choromanska +5 more
core +1 more source
Rethinking plastic waste: innovations in enzymatic breakdown of oil‐based polyesters and bioplastics
Plastic pollution remains a critical environmental challenge, and current mechanical and chemical recycling methods are insufficient to achieve a fully circular economy. This review highlights recent breakthroughs in the enzymatic depolymerization of both oil‐derived polyesters and bioplastics, including high‐throughput protein engineering, de novo ...
Elena Rosini +2 more
wiley +1 more source
Altered Dynamic Functional Network Connectivity in Post‐Stroke Aphasia
ABSTRACT Objective Previous studies examining post‐stroke aphasia (PSA) patients via resting‐state functional magnetic resonance imaging (rs‐fMRI) have predominantly focused on static functional connectivity. In contrast, the current investigation aims to elucidate the alterations in dynamic functional network connectivity (dFNC) among PSA patients ...
Guihua Xu +6 more
wiley +1 more source
Jordan Matrix Decomposition [PDF]
We follow the rules: i, j, m, n, k denote natural numbers, K denotes a field, and a, λ denote elements of K. Let us consider K, λ, n. The Jordan block of λ and n yields a matrix over K and is defined by the conditions (Def. 1). (Def. 1)(i) len (the Jordan block of λ and n) = n, (ii) width (the Jordan block of λ and n) = n, and (iii) for all i, j such ...
openaire +2 more sources

