Results 51 to 60 of about 5,012,670 (186)
Revista Brasileira de MeteorologiaResumo As variações das propriedades óticas dos aerossóis podem interferir nos processos de transferência de energia entre a atmosfera e a superfície terrestre. A AOD (Aerosol Optical Depth) é a variável mais usada para este propósito, a qual possibilita
Rafael da Silva Palácios +7 more
doaj +1 more source
Bounds for the Energy of Hypergraphs
AxiomsThe concept of the energy of a graph has been widely explored in the field of mathematical chemistry and is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix.
Liya Jess Kurian, Chithra Velu
doaj +1 more source
Highlighting Link Prediction in Bipartite Networks via Structural Perturbation
IEEE Access, 2018 Most of the link prediction algorithms for bipartite networks assume that the generation of link is based on a predefined prior assumption. However, for the real-world bipartite networks, the generation mechanism of link is still ambiguous due to their ...
Xue Chen +4 more
doaj +1 more source
Singular polynomials from orbit spaces [PDF]
, 2012 We consider the polynomial representation S(V*) of the rational Cherednik algebra H_c(W) associated to a finite Coxeter group W at constant parameter c.
Feigin, M., Silantyev, A.
core +1 more source
On approximating functions of the singular values in a stream [PDF]
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, 2016 For any real number $p > 0$, we nearly completely characterize the space complexity of estimating $\|A\|_p^p = \sum_{i=1}^n σ_i^p$ for $n \times n$ matrices $A$ in which each row and each column has $O(1)$ non-zero entries and whose entries are presented one at a time in a data stream model. Here the $σ_i$ are the singular values of $A$, and when $p
Yi Li 0002, David P. Woodruff
openaire +3 more sources
A generalization of the randomized singular value decomposition
CoRR, 2021 The randomized singular value decomposition (SVD) is a popular and effective algorithm for computing a near-best rank $k$ approximation of a matrix $A$ using matrix-vector products with standard Gaussian vectors. Here, we generalize the randomized SVD to multivariate Gaussian vectors, allowing one to incorporate prior knowledge of $A$ into the ...
Boulle, N, Townsend, A
openaire +7 more sources
Combinatorial Designs with Two Singular Values II. Partial Geometric Designs [PDF]
In this and an earlier paper [17] we study combinatorial designs whose incidence matrix has two distinct singular values.These generalize (v, k, ë) designs, and include uniform multiplicative designs and partial geometric designs.Here we study the latter,
Spence, E., Dam, E.R. van
core +2 more sources
On the Singular Values of Matrices with Displacement Structure [PDF]
SIAM Journal on Matrix Analysis and Applications, 2017 22 pages, 4 ...
Bernhard Beckermann, Alex Townsend
openaire +4 more sources
Computing Structured Singular Values for Sturm-Liouville Problems
International Journal of Analysis and Applications, 2019 In this article we present numerical computation of pseudo-spectra and the bounds of Structured Singular Values (SSV) for a family of matrices obtained while considering matrix representation of SturmLiouville (S-L) problems with eigenparameter-dependent
Mutti-Ur Rehman +2 more
doaj +2 more sources
Applied Sciences, 2016 Singular value decomposition (SVD) is a widely used and powerful tool for signal extraction under noise. Noise attenuation relies on the selection of the effective singular value because these values are significant features of the useful signal ...
Jie Gao +3 more
doaj +1 more source