Proves relative-gap-preserving error bounds for singular vectors and eigenvectors from mixed-precision Jacobi methods that depend on the preconditioned matrix scaled condition number rather than the original.
Horn and Charles R
5 Pith papers cite this work. Polarity classification is still indexing.
verdicts
UNVERDICTED 5representative citing papers
Introduces downward conditional monotonicity for MMPP to obtain stochastic domination bounds that determine survival and extinction regimes for contact processes in finite-state random environments via QBD eigenvalue comparison.
Introduces graph-to-image prediction of per-node dynamic stability landscapes in oscillator networks from topology, releases two 10k-graph datasets, and shows GNN-CNN models achieve good accuracy with cross-size generalization.
Erlang mixture approximations with the linear chain trick convert distributed delay DDEs into ODEs, with convergence proofs for bounded kernels and applications to stability analysis.
NetSMF enables scalable network embedding by applying spectral sparsification to produce a sparse approximation of the dense matrix implicitly factorized by methods such as DeepWalk.
citing papers explorer
-
On Erlang mixture approximations for differential equations with distributed time delays
Erlang mixture approximations with the linear chain trick convert distributed delay DDEs into ODEs, with convergence proofs for bounded kernels and applications to stability analysis.