activity
20192021
collaborators

7 papers

math.NA2021

Palindromic linearization and numerical solution of nonsymmetric algebraic T-Riccati equations

Peter Benner, Bruno Iannazzo, Beatrice Meini +1

We 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 arr…

math.NA2021

An efficient, memory-saving approach for the Loewner framework

Davide Palitta, Sanda Lefteriu

The Loewner framework is one of the most successful data-driven model order reduction techniques. If is the cardinality of a given data set, the so-called Loewner and shifted L…

math.NA2020

On the Solution of the Nonsymmetric T-Riccati Equation

Peter Benner, Davide Palitta

The nonsymmetric T-Riccati equation is a quadratic matrix equation where the linear part corresponds to the so-called T-Sylvester or T-Lyapunov operator that has previously been st…

math.NA2019

On the convergence of Krylov methods with low-rank truncations

Davide Palitta, Patrick Kürschner

Low-rank Krylov methods are one of the few options available in the literature to address the numerical solution of large-scale general linear matrix equations. These routines amou…

math.NA2019

Matrix equation techniques for certain evolutionary partial differential equations

Davide Palitta

We show that the discrete operator stemming from the time and space discretization of evolutionary partial differential equations can be represented in terms of a single Sylvester…

math.NA2019

Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations

Davide Palitta, Valeria Simoncini

Galerkin and Petrov-Galerkin methods are some of the most successful solution procedures in numerical analysis. Their popularity is mainly due to the optimality properties of their…