Bruno Iannazzo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Bruno Iannazzo has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Federico Poloni
Department of Computer Science, University of Pisa, Pisa, Italy
11 shared publications - Beatrice Meini
Dipartimento di Matematica Università di Pisa Italy
8 shared publications - Fernando De Terán
Departamento de Matemáticas Universidad Carlos III de Madrid Leganés Spain
7 shared publications - Dario Andrea Bini
Dipartimento di Matematica, Università di Pisa, Pisa, Italy
6 shared publications Dario A. Bini
5 shared publications- Leonardo Robol
Department of Mathematics, University of Pisa, Pisa, Italy
5 shared publications
Latest Publications
- Open Access
Uniqueness of solution of systems of generalized Sylvester and conjugate-Sylvester equations
We provide a characterization for a periodic system of generalized Sylvester and conjugate-Sylvester equations, with at most one generalized conjugate-Sylvester equation, to have a unique solution when all coefficient matrices are square and all unknown matrices of the system have the same size. We also present a procedure to reduce an arbitrary system of generalized Sylvester and conjugate-Sylvester equations to periodic systems having at most one generalized conjugate-Sylvester equation. Therefore, the obtained characterization for the uniqueness of solution of periodic systems provides a characterization for general systems of generalized Sylvester and conjugate-Sylvester equations.
Open AccessUniqueness of solution of systems of generalized Sylvester and conjugate-Sylvester equations
We provide a characterization for a periodic system of generalized Sylvester and conjugate-Sylvester equations, with at most one generalized conjugate-Sylvester equation, to have a unique solution when all coefficient matrices are square and all unknown matrices of the system have the same size. We also present a procedure to reduce an arbitrary system of generalized Sylvester and conjugate-Sylvester equations to periodic systems having at most one generalized conjugate-Sylvester equation. Therefore, the obtained characterization for the uniqueness of solution of periodic systems provides a characterization for general systems of generalized Sylvester and conjugate-Sylvester equations.
- 28 December 2024
- Published by Springer Nature in Advances in Operator Theory
- Vol. 10 (1) , 1-24
Convergence properties of sequences related to the Ando–Li–Mathias construction and to the weighted Cheap mean
- 28 December 2024
- Published by Springer Nature in Advances in Operator Theory
- Vol. 10 (1) , 1-24
Convergence properties of sequences related to the Ando–Li–Mathias construction and to the weighted Cheap mean
- Open Access
- 4 September 2024
- Published by Springer Nature in Acta Scientiarum Mathematicarum
- Vol. 90 (3-4) , 349-389
Computational aspects of the geometric mean of two matrices: a survey
Algorithms for the computation of the (weighted) geometric mean G of two positive definite matrices are described and discussed. For large and sparse matrices the problem of computing the product $$y=Gb$$ , and of solving the linear system $$Gx=b$$ , without forming G, is addressed. An analysis of the conditioning is provided. Substantial numerical experimentation is carried out to test and compare the performances of these algorithms in terms of CPU time, numerical stability, and number of iterative steps.- 4 September 2024
- Published by Springer Nature in Acta Scientiarum Mathematicarum
- Vol. 90 (3-4) , 349-389
Open AccessComputational aspects of the geometric mean of two matrices: a survey
Algorithms for the computation of the (weighted) geometric mean G of two positive definite matrices are described and discussed. For large and sparse matrices the problem of computing the product $$y=Gb$$ , and of solving the linear system $$Gx=b$$ , without forming G, is addressed. An analysis of the conditioning is provided. Substantial numerical experimentation is carried out to test and compare the performances of these algorithms in terms of CPU time, numerical stability, and number of iterative steps. - 22 April 2024
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 73 (9) , 2060-2088
Deflating subspaces of T -palindromic pencils and algebraic T -Riccati equations
- 22 April 2024
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 73 (9) , 2060-2088
Deflating subspaces of T -palindromic pencils and algebraic T -Riccati equations
- 8 March 2023
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 63 (2) , 1-30
Geometric means of quasi-Toeplitz matrices
- 8 March 2023
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 63 (2) , 1-30
Geometric means of quasi-Toeplitz matrices
- Open Access
Invariant subspaces of $T$-palindromic pencils and algebraic $T$-Riccati equations
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 introduce conditions to avoid the presence of modulus-one eigenvalues in a $\top$-palindromic matrix pencil and conditions for the existence of solutions of a $\top$-Riccati equation. Computationally, we improve the palindromic QZ algorithm with a new ordering procedure and introduce new algorithms for computing a deflating subspace of the $\top$-palindromic pencil, based on quadraticizations of the pencil or on an integral representation of the orthogonal projector on the sought deflating subspace.
Open AccessInvariant subspaces of $T$-palindromic pencils and algebraic $T$-Riccati equations
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 introduce conditions to avoid the presence of modulus-one eigenvalues in a $\top$-palindromic matrix pencil and conditions for the existence of solutions of a $\top$-Riccati equation. Computationally, we improve the palindromic QZ algorithm with a new ordering procedure and introduce new algorithms for computing a deflating subspace of the $\top$-palindromic pencil, based on quadraticizations of the pencil or on an integral representation of the orthogonal projector on the sought deflating subspace.
- 15 August 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 92 (1) , 89-118
Computing eigenvalues of semi-infinite quasi-Toeplitz matrices
- 15 August 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 92 (1) , 89-118
Computing eigenvalues of semi-infinite quasi-Toeplitz matrices
- Open Access
- 20 May 2022
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 62 (4) , 1649-1672
Palindromic linearization and numerical solution of nonsymmetric algebraic $T$-Riccati equationsWe identify a relationship between the solutions of a nonsymmetric algebraic $$T$$ -Riccati equation ( $$T$$ -NARE) and the deflating subspaces of a palindromic matrix pencil, obtained by arranging the coefficients of the $$T$$ -NARE. The interplay between $$T$$ -NAREs and palindromic pencils allows one to derive both theoretical properties of the solutions of the equation, and new methods for its numerical solution. In particular, we propose methods based on the (palindromic) QZ algorithm and the doubling algorithm, whose effectiveness is demonstrated by several numerical tests.- 20 May 2022
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 62 (4) , 1649-1672
Open AccessPalindromic linearization and numerical solution of nonsymmetric algebraic $T$-Riccati equationsWe identify a relationship between the solutions of a nonsymmetric algebraic $$T$$ -Riccati equation ( $$T$$ -NARE) and the deflating subspaces of a palindromic matrix pencil, obtained by arranging the coefficients of the $$T$$ -NARE. The interplay between $$T$$ -NAREs and palindromic pencils allows one to derive both theoretical properties of the solutions of the equation, and new methods for its numerical solution. In particular, we propose methods based on the (palindromic) QZ algorithm and the doubling algorithm, whose effectiveness is demonstrated by several numerical tests. - 1 April 2022
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 638, 80-109
Geometries on the cone of positive-definite matrices derived from the power potential and their relation to the power means
- 1 April 2022
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 638, 80-109
Geometries on the cone of positive-definite matrices derived from the power potential and their relation to the power means
- Open Access
Geometries on the cone of positive-definite matrices derived from the power potential and their relation to the power means
We study a Riemannian metric on the cone of symmetric positive-definite matrices obtained from the Hessian of the power potential function $(1-\det(X)^\beta)/\beta$. We give explicit expressions for the geodesics and distance function, under suitable conditions. In the scalar case, the geodesic between two positive numbers coincides with a weighted power mean, while for matrices of size at least two it yields a notion of weighted power mean different from the ones given in the literature. As $\beta$ tends to zero, the power potential converges to the logarithmic potential, that yields a well-known metric associated with the matrix geometric mean; we show that the geodesic and the distance associated with the power potential converge to the weighted matrix geometric mean and the distance associated with the logarithmic potential, respectively.Open AccessGeometries on the cone of positive-definite matrices derived from the power potential and their relation to the power means
We study a Riemannian metric on the cone of symmetric positive-definite matrices obtained from the Hessian of the power potential function $(1-\det(X)^\beta)/\beta$. We give explicit expressions for the geodesics and distance function, under suitable conditions. In the scalar case, the geodesic between two positive numbers coincides with a weighted power mean, while for matrices of size at least two it yields a notion of weighted power mean different from the ones given in the literature. As $\beta$ tends to zero, the power potential converges to the logarithmic potential, that yields a well-known metric associated with the matrix geometric mean; we show that the geodesic and the distance associated with the power potential converge to the weighted matrix geometric mean and the distance associated with the logarithmic potential, respectively.