Sparse approximation of complex networks

DOI10.1016/J.APNUM.2024.01.002MaRDI QIDQ7031617zbMATH OpenFDO

Authors Omar De la Cruz Cabrera, Jiafeng Jin, Lothar Reichel

Publication date 6 February 2025

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.APNUM.2024.01.002

zbMATH Keywords

communicability matrixnetwork approximationsparse approximation

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Cites work

• Analysis of directed networks via the matrix exponential
• Between hard and soft thresholding: optimal iterative thresholding algorithms
• Computing low‐rank approximations of the Fréchet derivative of a matrix function using Krylov subspace methods
• Consideration on computing real logarithms of matrices, Hamiltonian logarithms, and skew-symmetric logarithms
• First-order methods in optimization
• Functions of Matrices
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 852532 (Why is no real title available?)
• Introduction to nonlinear optimization: theory, algorithms, and applications with MATLAB
• Modern multidimensional scaling: theory and applications
• Networks. An introduction.
• Proximal Newton-type methods for minimizing composite functions

This page was built for publication: Sparse approximation of complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031617)