default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFederico Poloni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i12]Miryam Gnazzo, Vanni Noferini, Lauri Nyman
, Federico Poloni:
Riemann-Oracle: A general-purpose Riemannian optimizer to solve nearness problems in matrix theory. CoRR abs/2407.03957 (2024)- 2023
- [j25]Diego Altafini, Dario A. Bini, Valerio Cutini, Beatrice Meini, Federico Poloni:
An Edge Centrality Measure Based on the Kemeny Constant. SIAM J. Matrix Anal. Appl. 44(2): 648-669 (2023) - [i11]Bruno Iannazzo, Beatrice Meini, Federico Poloni:
Invariant subspaces of T-palindromic pencils and algebraic T-Riccati equations. CoRR abs/2302.10604 (2023) - 2022
- [j24]Alberto Bucci, Federico Poloni:
A continuation method for computing the multilinear PageRank. Numer. Linear Algebra Appl. 29(4) (2022) - [i10]Diego Altafini, Dario Andrea Bini, Valerio Cutini, Beatrice Meini, Federico Poloni:
An edge centrality measure based on the Kemeny constant. CoRR abs/2203.06459 (2022) - [i9]Stefano Galatolo, Maurizio Monge, Isaia Nisoli, Federico Poloni:
A general framework for the rigorous computation of invariant densities and the coarse-fine strategy. CoRR abs/2212.05017 (2022) - 2021
- [j23]Vanni Noferini, Federico Poloni:
Nearest $\varOmega $-stable matrix via Riemannian optimization. Numerische Mathematik 148(4): 817-851 (2021) - [i8]Alberto Bucci, Federico Poloni:
A continuation method for computing the multilinear Pagerank. CoRR abs/2102.12714 (2021) - [i7]Luca Gemignani, Federico Poloni:
Comparison Theorems for Splittings of M-matrices in (block) Hessenberg Form. CoRR abs/2106.10492 (2021) - [i6]Lucia Nasti, Roberta Gori, Paolo Milazzo, Federico Poloni:
Efficient Analysis of Chemical Reaction Networks Dynamics based on Input-Output Monotonicity. CoRR abs/2107.00289 (2021) - 2020
- [i5]Vanni Noferini, Federico Poloni:
Nearest Ω-stable matrix via Riemannian optimization. CoRR abs/2002.07052 (2020) - [i4]Federico Poloni:
Iterative and doubling algorithms for Riccati-type matrix equations: a comparative introduction. CoRR abs/2005.08903 (2020)
2010 – 2019
- 2019
- [j22]Fernando de Terán, Bruno Iannazzo, Federico Poloni, Leonardo Robol:
Nonsingular systems of generalized Sylvester equations: An algorithmic approach. Numer. Linear Algebra Appl. 26(5) (2019) - [j21]Gianna M. Del Corso, Federico Poloni, Leonardo Robol, Raf Vandebril:
When is a matrix unitary or Hermitian plus low rank? Numer. Linear Algebra Appl. 26(6) (2019) - 2018
- [j20]Beatrice Meini, Federico Poloni:
Perron-based algorithms for the multilinear PageRank. Numer. Linear Algebra Appl. 25(6) (2018) - [j19]Nigel G. Bean, Giang T. Nguyen, Federico Poloni:
Doubling algorithms for stationary distributions of fluid queues: A probabilistic interpretation. Perform. Evaluation 125: 1-20 (2018) - 2017
- [j18]Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Federico Poloni, Nicola Santoro, Giovanni Viglietta:
Mutual visibility by luminous robots without collisions. Inf. Comput. 254: 392-418 (2017) - [j17]Tayyebe Haqiri, Federico Poloni:
Methods for verified stabilizing solutions to continuous-time algebraic Riccati equations. J. Comput. Appl. Math. 313: 515-535 (2017) - 2016
- [j16]Volker Mehrmann, Federico Poloni:
An inverse-free ADI algorithm for computing Lagrangian invariant subspaces. Numer. Linear Algebra Appl. 23(1): 147-168 (2016) - [j15]Federico Poloni, Timo Reis:
A structure-preserving doubling algorithm for Lur'e equations. Numer. Linear Algebra Appl. 23(1): 169-186 (2016) - 2015
- [j14]Giang T. Nguyen, Federico Poloni:
Componentwise accurate fluid queue computations using doubling algorithms. Numerische Mathematik 130(4): 763-792 (2015) - [i3]Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Federico Poloni, Nicola Santoro, Giovanni Viglietta:
Mutual Visibility by Luminous Robots Without Collisions. CoRR abs/1503.04347 (2015) - 2014
- [j13]Federico Poloni, Giacomo Sbrana:
Feasible generalized least squares estimation of multivariate GARCH(1, 1) models. J. Multivar. Anal. 129: 151-159 (2014) - [c1]Giuseppe Antonio Di Luna, Paola Flocchini, Federico Poloni, Nicola Santoro, Giovanni Viglietta:
The Mutual Visibility Problem for Oblivious Robots. CCCG 2014 - 2013
- [j12]Volker Mehrmann, Federico Poloni:
Using permuted graph bases in H∞H∞ control. Autom. 49(6): 1790-1797 (2013) - [j11]Giacomo Sbrana, Federico Poloni:
A closed-form estimator for the multivariate GARCH(1, 1)(1, 1) model. J. Multivar. Anal. 120: 152-162 (2013) - [j10]Volker Mehrmann, Federico Poloni:
A generalized structured doubling algorithm for the numerical solution of linear quadratic optimal control problems. Numer. Linear Algebra Appl. 20(1): 112-137 (2013) - [j9]Bruno Iannazzo, Federico Poloni:
A subspace shift technique for nonsymmetric algebraic Riccati equations associated with an M-matrix. Numer. Linear Algebra Appl. 20(3): 440-452 (2013) - 2012
- [j8]Volker Mehrmann, Federico Poloni:
Doubling Algorithms with Permuted Lagrangian Graph Bases. SIAM J. Matrix Anal. Appl. 33(3): 780-805 (2012) - [j7]Federico Poloni, Timo Reis:
A Deflation Approach for Large-Scale Lur'e Equations. SIAM J. Matrix Anal. Appl. 33(4): 1339-1368 (2012) - 2011
- [j6]Dario A. Bini, Beatrice Meini, Federico Poloni:
On the solution of a quadratic vector equation arising in Markovian Binary Trees. Numer. Linear Algebra Appl. 18(6): 981-991 (2011) - [j5]Beatrice Meini, Federico Poloni:
A Perron Iteration for the Solution of a Quadratic Vector Equation Arising in Markovian Binary Trees. SIAM J. Matrix Anal. Appl. 32(1): 248-261 (2011) - 2010
- [j4]Dario Andrea Bini, Beatrice Meini, Federico Poloni:
An effective matrix geometric mean satisfying the Ando-Li-Mathias properties. Math. Comput. 79(269): 437-452 (2010) - [j3]Federico Poloni:
A note on the O(n)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices. Numer. Algorithms 55(1): 115-139 (2010) - [j2]Dario A. Bini, Beatrice Meini, Federico Poloni:
Transforming algebraic Riccati equations into unilateral quadratic matrix equations. Numerische Mathematik 116(4): 553-578 (2010)
2000 – 2009
- 2008
- [j1]Dario Bini, Bruno Iannazzo, Federico Poloni:
A Fast Newton's Method for a Nonsymmetric Algebraic Riccati Equation. SIAM J. Matrix Anal. Appl. 30(1): 276-290 (2008) - 2007
- [i2]Dario Andrea Bini, Bruno Iannazzo, Beatrice Meini, Federico Poloni:
Nonsymmetric algebraic Riccati equations associated with an M-matrix: recent advances and algorithms. Numerical Methods for Structured Markov Chains 2007 - [i1]Dario Andrea Bini, Beatrice Meini, Federico Poloni:
From Algebraic Riccati equations to unilateral quadratic matrix equations: old and new algorithms. Numerical Methods for Structured Markov Chains 2007
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
