Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Sous-espace de Krylov

Publications associées (24)

Randomized flexible GMRES with deflated restarting

Laura Grigori

For a high-dimensional problem, a randomized Gram-Schmidt (RGS) algorithm is beneficial in terms of both computational cost and numerical stability. We apply this dimension reduction technique by random sketching to Krylov subspace methods, e.g., to the ge ...

Springer2024

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

Daniel Kressner, Alice Cortinovis

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

Siam Publications2024

TimeEvolver: A program for time evolution with improved error bound

Sebastian Zell

We present TimeEvolver, a program for computing time evolution in a generic quantum system. It relies on well-known Krylov subspace techniques to tackle the problem of multiplying the exponential of a large sparse matrix iH, where His the Hamiltonian, with ...

ELSEVIER2022

DIVIDE-AND-CONQUER METHODS FOR FUNCTIONS OF MATRICES WITH BANDED OR HIERARCHICAL LOW-RANK STRUCTURE\ast

Daniel Kressner, Stefano Massei, Alice Cortinovis

This work is concerned with approximating matrix functions for banded matrices, hierarchically semiseparable matrices, and related structures. We develop a new divide-and-conquer method based on (rational) Krylov subspace methods for performing low-rank up ...

SIAM PUBLICATIONS2022

Linear and nonlinear substructured Restricted Additive Schwarz iterations and preconditioning

Tommaso Vanzan

Iterative substructuring Domain Decomposition (DD) methods have been extensively studied, and they are usually associated with nonoverlapping decompositions. It is less known that classical overlapping DD methods can also be formulated in substructured for ...

2022

Arnoldi-Lindblad time evolution: Faster-than-the-clock algorithm for the spectrum of time-independent and Floquet open quantum systems

Fabrizio Minganti

The characterization of open quantum systems is a central and recurring problem for the development of quantum technologies. For time-independent systems, an (often unique) steady state describes the average physics once all the transient processes have fa ...

VEREIN FORDERUNG OPEN ACCESS PUBLIZIERENS QUANTENWISSENSCHAF2022

Many-body localization in a fragmented Hilbert space

Loïc Jean Pierre Herviou

We study many-body localization (MBL) in a pair-hopping model exhibiting strong fragmentation of the Hilbert space. We show that several Krylov subspaces have both ergodic statistics in the thermodynamic limit and a dimension that scales much slower than t ...

2021

Low-Rank Updates Of Matrix Functions Ii: Rational Krylov Methods

Daniel Kressner, Alice Cortinovis, Marcel Schweitzer

This work develops novel rational Krylov methods for updating a large-scale matrix function f(A) when A is subject to low-rank modifications. It extends our previous work in this context on polynomial Krylov methods, for which we present a simplified conve ...

SIAM PUBLICATIONS2021

Overlapping Multipatch Isogeometric Method With Minimal Stabilization

Annalisa Buffa, Pablo Antolin Sanchez, Xiaodong Wei, Riccardo Puppi

We present a novel method for isogeometric analysis (IGA) to directly work on geometries constructed by Boolean operations including difference (i.e., trimming), union, and intersection. Particularly, this work focuses on the union operation, which involve ...

SIAM PUBLICATIONS2021

Immersed boundary-conformal isogeometric method for linear elliptic problems

Annalisa Buffa, Pablo Antolin Sanchez, Xiaodong Wei

We present a novel isogeometric method, namely the Immersed Boundary-Conformal Method (IBCM), that features a layer of discretization conformal to the boundary while employing a simple background mesh for the remaining domain. In this manner, we leverage t ...

2021

Locally supported tangential vector, n-vector, and tensor fields

Christopher Brandt

We introduce a construction of subspaces of the spaces of tangential vector, n-vector, and tensor fields on surfaces. The resulting subspaces can be used as the basis of fast approximation algorithms for design and processing problems that involve tangenti ...

2020

Compress-and-restart block Krylov subspace methods for Sylvester matrix equations

Daniel Kressner, Stefano Massei, Kathryn Dianne Lund

Block Krylov subspace methods (KSMs) comprise building blocks in many state-of-the-art solvers for large-scale matrix equations as they arise, for example, from the discretization of partial differential equations. While extended and rational block Krylov ...

2020

Novel corrector problems with exponential decay of the resonance error for numerical homogenization

Edoardo Paganoni

Multiscale problems, such as modelling flows through porous media or predicting the mechanical properties of composite materials, are of great interest in many scientific areas. Analytical models describing these phenomena are rarely available, and one mus ...

EPFL2020

A hierarchical preconditioner for wave problems in quasilinear complexity

Jan Sickmann Hesthaven, Boris Bonev

The paper introduces a novel, hierarchical preconditioner based on nested dissection and hierarchical matrix compression. The preconditioner is intended for continuous and discontinuous Galerkin formulations of elliptic problems. We exploit the property th ...

2022

FRIDA: FRI-Based DOA Estimation For Arbitrary Array Layouts

Martin Vetterli, Ivan Dokmanic, Robin Scheibler, Eric Bezzam, Hanjie Pan

In this paper we present FRIDA—an algorithm for estimating directions of arrival of multiple wideband sound sources. FRIDA combines multi-band information coherently and achieves state- of-the-art resolution at extremely low signal-to-noise ratios. It work ...

IEEE2017

Projection Methods For Large-Scale T-Sylvester Equations

Daniel Kressner

The matrix Sylvester equation for congruence, or T-Sylvester equation, has recently attracted considerable attention as a consequence of its close relation to palindromic eigenvalue problems. The theory concerning T-Sylvester equations is rather well under ...

Amer Mathematical Soc2016

Semi-implicit BDF time discretization of the Navier–Stokes equations with VMS-LES modeling in a High Performance Computing framework

Luca Dede', Davide Forti

In this paper, we propose a semi-implicit approach for the time discretization of the Navier–Stokes equations with Variational Multiscale-Large Eddy Simulation turbulence modeling (VMS-LES). For the spatial approximation of the problem, we use the Finite E ...

Elsevier2015

Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis

Daniel Kressner

Novel memory-efficient Arnoldi algorithms for solving matrix polynomial eigenvalue problems are presented. More specifically, we consider the case of matrix polynomials expressed in the Chebyshev basis, which is often numerically more appropriate than the ...

Wiley-Blackwell2014

Subspace Methods For Computing The Pseudospectral Abscissa And The Stability Radius

Daniel Kressner

The pseudospectral abscissa and the stability radius are well-established tools for quantifying the stability of a matrix under unstructured perturbations. Based on first-order eigenvalue expansions, Guglielmi and Overton [SIAM J. Matrix Anal. Appl., 32 (2 ...

Siam Publications2014

Inverse Rendering of Lambertian Surfaces Using Subspace Methods

Quy Ha Nguyen, Minh Do

We propose a vector space approach for inverse rendering of a Lambertian convex object with distant light sources. In this problem, the texture of the object and arbitrary lightings are both to be recovered from multiple images of the object and its 3D mod ...

Ieee-Inst Electrical Electronics Engineers Inc2014