[图书][B] Combinatorial scientific computing

U Naumann, O Schenk - 2012 - api.taylorfrancis.com
Combinatorial techniques have become essential tools across the landscape of
computational science, and some of the combinatorial ideas undergirding these tools are …

Spectral measurement sparsification for pose-graph SLAM

KJ Doherty, DM Rosen… - 2022 IEEE/RSJ …, 2022 - ieeexplore.ieee.org
Simultaneous localization and mapping (SLAM) is a critical capability in autonomous
navigation, but in order to scale SLAM to the setting of “lifelong” SLAM, particularly under …

Fast link prediction for large networks using spectral embedding

B Pachev, B Webb - Journal of Complex Networks, 2018 - academic.oup.com
Many link prediction algorithms require the computation of a similarity metric on each vertex
pair, which is quadratic in the number of vertices and infeasible for large networks. We …

MAC: Maximizing Algebraic Connectivity for Graph Sparsification

K Doherty, A Papalia, Y Huang, D Rosen… - arXiv preprint arXiv …, 2024 - arxiv.org
Simultaneous localization and mapping (SLAM) is a critical capability in autonomous
navigation, but memory and computational limits make long-term application of common …

Dynamic and heterogeneity-sensitive urban network partitioning: a data-driven technique

H Moradi, S Sasaninejad, S Wittevrongel… - Transportmetrica B …, 2023 - Taylor & Francis
Information of Connected Vehicles (CVs) could describe vehicular dynamics in much greater
detail, enhancing the effectiveness of traffic control systems. One important such system is …

PSPIKE+: a family of parallel hybrid sparse linear system solvers

Y Zhu, AH Sameh - Journal of Computational and Applied Mathematics, 2017 - Elsevier
We present PSPIKE+, as a family of parallel hybrid linear system solvers that are more
robust than other available preconditioned iterative methods, and more scalable than …

Local manifold distance based on neighborhood graph reordering

I Theodorakopoulos, G Economou, S Fotopoulos… - Pattern Recognition, 2016 - Elsevier
In this paper we consider the problem of estimating pair-wise signals׳ dissimilarities through
the comparison of the underlying local manifold structures. Aiming to confront with issues …

Parallel solution of sparse linear systems

M Manguoglu - High-Performance Scientific Computing: Algorithms …, 2012 - Springer
Many simulations in science and engineering give rise to sparse linear systems of
equations. It is a well known fact that the cost of the simulation process is almost always …

[HTML][HTML] An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration

J Wu, J Song, W Zhang - Journal of computational and applied mathematics, 2014 - Elsevier
The Fiedler vector of a graph plays a vital role in many applications. But it is usually very
expensive in that it involves the solution of an eigenvalue problem. In this paper, we …

A scalable hybrid linear solver based on combinatorial algorithms

M Sathe, O Schenk, B Uçar… - … , Chapman-Hall/CRC …, 2012 - api.taylorfrancis.com
The availability of large-scale computing platforms comprising of tens of thousands of
multicore processors motivates the need for the next generation of highly scalable sparse …