Zobrazeno 1 - 10
of 178
pro vyhledávání: '"Poloni, Federico"'
We propose an extremely versatile approach to address a large family of matrix nearness problems, possibly with additional linear constraints. Our method is based on splitting a matrix nearness problem into two nested optimization problems, of which
Externí odkaz:
http://arxiv.org/abs/2407.03957
By exploiting the connection between solving algebraic $\top$-Riccati equations and computing certain deflating subspaces of $\top$-palindromic matrix pencils, we obtain theoretical and computational results on both problems. Theoretically, we introd
Externí odkaz:
http://arxiv.org/abs/2302.10604
A general framework for the rigorous computation of invariant densities and the coarse-fine strategy
In this paper we present a general, axiomatical framework for the rigorous approximation of invariant densities and other important statistical features of dynamics. We approximate the system trough a finite element reduction, by composing the associ
Externí odkaz:
http://arxiv.org/abs/2212.05017
We discuss various models for epidemics on networks that rely on Markov chains. Random walks on graphs are often used to predict epidemic spread and to investigate possible control actions to mitigate them. In this study, we demonstrate that they do
Externí odkaz:
http://arxiv.org/abs/2207.02737
Motivation: A Chemical Reaction Network (CRN) is a set of chemical reactions, which can be very complex and difficult to analyze. Indeed, dynamical properties of CRNs can be described by a set of non-linear differential equations that rarely can be s
Externí odkaz:
http://arxiv.org/abs/2107.00289
Autor:
Gemignani, Luca, Poloni, Federico
Some variants of the (block) Gauss--Seidel iteration for the solution of linear systems with $M$-matrices in (block) Hessenberg form are discussed. Comparison results for the asymptotic convergence rate of some regular splittings are derived: in part
Externí odkaz:
http://arxiv.org/abs/2106.10492
Autor:
Bucci, Alberto, Poloni, Federico
The multilinear Pagerank model [Gleich, Lim and Yu, 2015] is a tensor-based generalization of the Pagerank model. Its computation requires solving a system of polynomial equations that contains a parameter $\alpha \in [0,1)$. For $\alpha \approx 1$,
Externí odkaz:
http://arxiv.org/abs/2102.12714
Autor:
Poloni, Federico
We review a family of algorithms for Lyapunov- and Riccati-type equations which are all related to each other by the idea of \emph{doubling}: they construct the iterate $Q_k = X_{2^k}$ of another naturally-arising fixed-point iteration $(X_h)$ via a
Externí odkaz:
http://arxiv.org/abs/2005.08903
Autor:
Noferini, Vanni, Poloni, Federico
We study the problem of finding the nearest $\Omega$-stable matrix to a certain matrix $A$, i.e., the nearest matrix with all its eigenvalues in a prescribed closed set $\Omega$. Distances are measured in the Frobenius norm. An important special case
Externí odkaz:
http://arxiv.org/abs/2002.07052