default search action
Davide Palitta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Martin J. Gander
, Davide Palitta
A New ParaDiag Time-Parallel Time Integration Method. SIAM J. Sci. Comput. 46(2): 697- (2024) - [i20]Davide Palitta, Sascha Portaro:
Row-aware Randomized SVD with applications. CoRR abs/2408.04503 (2024) - [i19]Alberto Bucci, Davide Palitta, Leonardo Robol:
Randomized sketched TT-GMRES for linear systems with tensor structure. CoRR abs/2409.09471 (2024) - 2023
- [j11]Davide Palitta
Stein-based preconditioners for weak-constraint 4D-var. J. Comput. Phys. 482: 112068 (2023) - [j10]Peter Benner
On an integrated Krylov-ADI solver for large-scale Lyapunov equations. Numer. Algorithms 92(1): 35-63 (2023) - [i18]Martin J. Gander
A new ParaDiag time-parallel time integration method. CoRR abs/2304.12597 (2023) - [i17]Davide Palitta, Marcel Schweitzer, Valeria Simoncini:
Sketched and truncated polynomial Krylov methods: Evaluation of matrix functions. CoRR abs/2306.06481 (2023) - [i16]Stefania Bellavia, Davide Palitta, Margherita Porcelli, Valeria Simoncini:
Regularized methods via cubic subspace minimization for nonconvex optimization. CoRR abs/2306.14290 (2023) - [i15]Davide Palitta, Marcel Schweitzer, Valeria Simoncini:
Sketched and Truncated Polynomial Krylov Subspace Methods: Matrix Equations. CoRR abs/2311.16019 (2023) - [i14]Kathryn Lund, Davide Palitta:
Low-rank-modified Galerkin methods for the Lyapunov equation. CoRR abs/2312.00463 (2023) - [i13]Davide Palitta, Zoran Tomljanovic, Ivica Nakic, Jens Saak:
Efficient solution of sequences of parametrized Lyapunov equations with applications. CoRR abs/2312.08201 (2023) - 2022
- [j9]Davide Palitta
An Efficient, Memory-Saving Approach for the Loewner Framework. J. Sci. Comput. 91(1): 31 (2022) - [j8]Davide Palitta
The Short-Term Rational Lanczos Method and Applications. SIAM J. Sci. Comput. 44(4): 2843- (2022) - [i12]Peter Benner, Davide Palitta, Jens Saak:
Krylov techniques for low-rank ADI. CoRR abs/2203.17174 (2022) - [i11]Davide Palitta, Jemima M. Tabeart
Stein-based preconditioners for weak-constraint 4D-var. CoRR abs/2203.17184 (2022) - 2021
- [j7]Davide Palitta
Matrix Equation Techniques for Certain Evolutionary Partial Differential Equations. J. Sci. Comput. 87(3): 99 (2021) - [j6]Davide Palitta
On the convergence of Krylov methods with low-rank truncations. Numer. Algorithms 88(3): 1383-1417 (2021) - [j5]Daniel Kressner
Compress-and-restart block Krylov subspace methods for Sylvester matrix equations. Numer. Linear Algebra Appl. 28(1) (2021) - [i10]Davide Palitta, Stefano Pozza, Valeria Simoncini:
The Short-term Rational Lanczos Method and Applications. CoRR abs/2103.04054 (2021) - [i9]Davide Palitta, Sanda Lefteriu:
An efficient, memory-saving approach for the Loewner framework. CoRR abs/2103.07146 (2021) - [i8]Julian Henning, Davide Palitta, Valeria Simoncini, Karsten Urban:
Very Weak Space-Time Variational Formulation for the Wave Equation: Analysis and Efficient Numerical Solution. CoRR abs/2107.12119 (2021) - [i7]Peter Benner, Bruno Iannazzo, Beatrice Meini, Davide Palitta:
Palindromic linearization and numerical solution of nonsymmetric algebraic T-Riccati equations. CoRR abs/2110.03254 (2021) - 2020
- [i6]Daniel Kressner, Kathryn Lund
Compress-and-restart block Krylov subspace methods for Sylvester matrix equations. CoRR abs/2002.01506 (2020) - [i5]Peter Benner, Davide Palitta:
On the Solution of the Nonsymmetric T-Riccati Equation. CoRR abs/2003.03693 (2020)
2010 – 2019
- 2019
- [c1]Julian Henning, Davide Palitta
Matrix Oriented Reduction of Space-Time Petrov-Galerkin Variational Problems. ENUMATH 2019: 1049-1057 - [i4]Davide Palitta, Valeria Simoncini:
Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations. CoRR abs/1908.06016 (2019) - [i3]Davide Palitta:
Matrix equation techniques for certain evolutionary partial differential equations. CoRR abs/1908.11851 (2019) - [i2]Davide Palitta, Patrick Kürschner
On the convergence of Krylov methods with low-rank truncations. CoRR abs/1909.01226 (2019) - [i1]Julian Henning, Davide Palitta, Valeria Simoncini, Karsten Urban:
Matrix oriented reduction of space-time Petrov-Galerkin variational problems. CoRR abs/1912.10082 (2019) - 2018
- [j4]Davide Palitta
Computationally enhanced projection methods for symmetric Sylvester and Lyapunov matrix equations. J. Comput. Appl. Math. 330: 648-659 (2018) - [j3]Elias Jarlebring
Krylov methods for low-rank commuting generalized Sylvester equations. Numer. Linear Algebra Appl. 25(6) (2018) - [j2]Stefano Massei
Solving Rank-Structured Sylvester and Lyapunov Equations. SIAM J. Matrix Anal. Appl. 39(4): 1564-1590 (2018) - [j1]Davide Palitta
Numerical Methods for Large-Scale Lyapunov Equations with Symmetric Banded Data. SIAM J. Sci. Comput. 40(5): A3581-A3608 (2018)
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-14 23:29 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: