Vanni Noferini

Orcid: 0000-0002-1775-041X

According to our database1, Vanni Noferini authored at least 34 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs.
SIAM J. Matrix Anal. Appl., March, 2024

2023
Perturbation Theory of Transfer Function Matrices.
SIAM J. Matrix Anal. Appl., September, 2023

Revisiting the Matrix Polynomial Greatest Common Divisor.
SIAM J. Matrix Anal. Appl., September, 2023

A Riemannian optimization method to compute the nearest singular pencil.
CoRR, 2023

Generating functions of non-backtracking walks on weighted digraphs: radius of convergence and Ihara's theorem.
CoRR, 2023

Computing a compact local Smith McMillan form.
CoRR, 2023

2022
The DL(P) vector space of pencils for singular matrix polynomials.
CoRR, 2022

On the Rellich eigendecomposition of para-Hermitian matrices and the sign characteristics of *-palindromic matrix polynomials.
CoRR, 2022

2021
A Theory for Backtrack-Downweighted Walks.
SIAM J. Matrix Anal. Appl., 2021

Nearest $\varOmega $-stable matrix via Riemannian optimization.
Numerische Mathematik, 2021

On role extraction for digraphs via neighbourhood pattern similarity.
CoRR, 2021

On computing root polynomials and minimal bases of matrix pencils.
CoRR, 2021

Relative-error stability of numerical algorithms.
CoRR, 2021

Tropical Laurent series, their tropical roots, and localization results for the eigenvalues of nonlinear matrix functions.
CoRR, 2021

2020
Wilkinson's Bus: Weak Condition Numbers, with an Application to Singular Polynomial Eigenproblems.
Found. Comput. Math., 2020

Nearest Ω-stable matrix via Riemannian optimization.
CoRR, 2020

2019
The Structured Condition Number of a Differentiable Map between Matrix Manifolds, with Applications.
SIAM J. Matrix Anal. Appl., 2019

Non-Backtracking Alternating Walks.
SIAM J. Appl. Math., 2019

Non-backtracking PageRank.
J. Sci. Comput., 2019

Structured backward errors in linearizations.
CoRR, 2019

2018
The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis.
SIAM J. Matrix Anal. Appl., 2018

Non-backtracking walk centrality for directed networks.
J. Complex Networks, 2018

2017
A Formula for the Fréchet Derivative of a Generalized Matrix Function.
SIAM J. Matrix Anal. Appl., 2017

Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach.
SIAM J. Matrix Anal. Appl., 2017

Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
Math. Comput., 2017

2016
Numerical Instability of Resultant Methods for Multidimensional Rootfinding.
SIAM J. Numer. Anal., 2016

Fiedler-comrade and Fiedler-Chebyshev pencils.
SIAM J. Matrix Anal. Appl., 2016

An algorithm to compute the polar decomposition of a 3 × 3 matrix.
Numer. Algorithms, 2016

On the stability of computing polynomial roots via confederate linearizations.
Math. Comput., 2016

2015
Tropical Roots as Approximations to Eigenvalues of Matrix Polynomials.
SIAM J. Matrix Anal. Appl., 2015

Computing the common zeros of two bivariate functions via Bézout resultants.
Numerische Mathematik, 2015

Are resultant methods numerically unstable for multidimensional rootfinding?
CoRR, 2015

2013
Locating the Eigenvalues of Matrix Polynomials.
SIAM J. Matrix Anal. Appl., 2013

2012
Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials.
Numer. Algorithms, 2012


  Loading...