The following pages link to Federico Poloni (Q244145):
Displaying 44 items.
- Methods for verified stabilizing solutions to continuous-time algebraic Riccati equations (Q344315) (← links)
- A closed-form estimator for the multivariate GARCH(1,1) model (Q391807) (← links)
- Using permuted graph bases in \(\mathcal{H}_\infty\) control (Q522828) (← links)
- Mutual visibility by luminous robots without collisions (Q528203) (← links)
- The Padé iterations for the matrix sign function and their reciprocals are optimal (Q649549) (← links)
- Transforming algebraic Riccati equations into unilateral quadratic matrix equations (Q711584) (← links)
- Fast solution of a certain Riccati equation through Cauchy-like matrices (Q964066) (← links)
- Iterative methods for the delay Lyapunov equation with T-Sylvester preconditioning (Q1615853) (← links)
- Quadratic vector equations (Q1940316) (← links)
- Solvability and uniqueness criteria for generalized Sylvester-type equations (Q2002795) (← links)
- Corrigendum to: ``Solvability and uniqueness criteria for generalized Sylvester-type equations'' (Q2002796) (← links)
- Feasible generalized least squares estimation of multivariate GARCH(1,1) models (Q2015062) (← links)
- Nearest \(\Omega \)-stable matrix via Riemannian optimization (Q2049921) (← links)
- Comparison theorems for splittings of M-matrices in (block) Hessenberg form (Q2162721) (← links)
- Duality of matrix pencils, Wong chains and linearizations (Q2261572) (← links)
- Componentwise accurate fluid queue computations using doubling algorithms (Q2353379) (← links)
- Counting Fiedler pencils with repetitions (Q2401305) (← links)
- Principal Pivot Transforms of Quasidefinite Matrices and Semidefinite Lagrangian Subspaces (Q2813054) (← links)
- (Q2869433) (← links)
- A subspace shift technique for nonsymmetric algebraic Riccati equations associated with an M-matrix (Q2931516) (← links)
- Permuted Graph Matrices and Their Applications (Q2950175) (← links)
- A Perron Iteration for the Solution of a Quadratic Vector Equation Arising in Markovian Binary Trees (Q3008247) (← links)
- Constructing matrix geometric means (Q3075153) (← links)
- (Q3086650) (← links)
- Algorithms for Quadratic Matrix and Vector Equations (Q3090325) (← links)
- Perron-based algorithms for the multilinear PageRank (Q3120345) (← links)
- Factoring Block Fiedler Companion Matrices (Q3294688) (← links)
- An effective matrix geometric mean satisfying the Ando–Li–Mathias properties (Q3584784) (← links)
- A Fast Newton's Method for a Nonsymmetric Algebraic Riccati Equation (Q3609025) (← links)
- On the solution of a quadratic vector equation arising in Markovian Binary Trees (Q4897513) (← links)
- Doubling Algorithms with Permuted Lagrangian Graph Bases (Q4902921) (← links)
- A Deflation Approach for Large-Scale Lur'e Equations (Q4918169) (← links)
- Nonsingular systems of generalized Sylvester equations: An algorithmic approach (Q5206496) (← links)
- When is a matrix unitary or Hermitian plus low rank? (Q5206501) (← links)
- A generalized structured doubling algorithm for the numerical solution of linear quadratic optimal control problems (Q5397306) (← links)
- An inverse‐free ADI algorithm for computing Lagrangian invariant subspaces (Q5739755) (← links)
- A structure‐preserving doubling algorithm for Lur'e equations (Q5739756) (← links)
- A continuation method for computing the multilinear PageRank (Q5867170) (← links)
- A note on the \(O(n)\)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices (Q5962189) (← links)
- Iterative and doubling algorithms for Riccati‐type matrix equations: A comparative introduction (Q6144046) (← links)
- An Edge Centrality Measure Based on the Kemeny Constant (Q6158484) (← links)
- A continuation method for computing the multilinear Pagerank (Q6361518) (← links)
- A general framework for the rigorous computation of invariant densities and the coarse-fine strategy (Q6420076) (← links)
- Riemann-Oracle: A general-purpose Riemannian optimizer to solve nearness problems in matrix theory (Q6735231) (← links)
