Stefano Massei

Orcid: 0000-0003-1813-4181

According to our database1, Stefano Massei authored at least 28 papers between 2018 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On Stochastic Roundoff Errors in Gradient Descent with Low-Precision Computation.
J. Optim. Theory Appl., February, 2024

2023
Improved ParaDiag via low-rank updates and interpolation.
Numerische Mathematik, October, 2023

AdamL: A fast adaptive gradient method incorporating loss function.
CoRR, 2023

Optimizing network robustness via Krylov subspaces.
CoRR, 2023

On the Convergence of the Gradient Descent Method with Stochastic Fixed-point Rounding Errors under the Polyak-Lojasiewicz Inequality.
CoRR, 2023

A nested divide-and-conquer method for tensor Sylvester equations with positive definite hierarchically semiseparable coefficients.
CoRR, 2023

2022
Mixed Precision Recursive Block Diagonalization for Bivariate Functions of Matrices.
SIAM J. Matrix Anal. Appl., 2022

Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure.
SIAM J. Matrix Anal. Appl., 2022

Hierarchical adaptive low-rank format with applications to discretized partial differential equations.
Numer. Linear Algebra Appl., 2022

Improved parallel-in-time integration via low-rank updates and interpolation.
CoRR, 2022

On the influence of roundoff errors on the convergence of the gradient descent method with low-precision floating-point computation.
CoRR, 2022

2021
Compress-and-restart block Krylov subspace methods for Sylvester matrix equations.
Numer. Linear Algebra Appl., 2021

Hierarchical adaptive low-rank format with applications to discretized PDEs.
CoRR, 2021

2020
hm-toolbox: MATLAB Software for HODLR and HSS Matrices.
SIAM J. Sci. Comput., 2020

A Computational Framework for Two-Dimensional Random Walks With Restarts.
SIAM J. Sci. Comput., 2020

A Low-Rank Technique for Computing the Quasi-Stationary Distribution of Subcritical Galton-Watson Processes.
SIAM J. Matrix Anal. Appl., 2020

Low-rank updates and divide-and-conquer methods for quadratic matrix equations.
Numer. Algorithms, 2020

Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices.
CoRR, 2020

Certified and fast computations with shallow covariance kernels.
CoRR, 2020

Quasi-Optimal Sampling to Learn Basis Updates for Online Adaptive Model Reduction with Adaptive Empirical Interpolation.
Proceedings of the 2020 American Control Conference, 2020

2019
Fast Solvers for Two-Dimensional Fractional Diffusion Equations Using Rank Structured Matrices.
SIAM J. Sci. Comput., 2019

Low-Rank Updates and a Divide-And-Conquer Method for Linear Matrix Equations.
SIAM J. Sci. Comput., 2019

Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox.
Numer. Algorithms, 2019

Rational Krylov for Stieltjes matrix functions: convergence and pole selection.
CoRR, 2019

On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices.
CoRR, 2019

2018
Solving Rank-Structured Sylvester and Lyapunov Equations.
SIAM J. Matrix Anal. Appl., 2018

On quadratic matrix equations with infinite size coefficients encountered in QBD stochastic processes.
Numer. Linear Algebra Appl., 2018

Semi-infinite quasi-Toeplitz matrices with applications to QBD stochastic processes.
Math. Comput., 2018


  Loading...