Matrix oriented reduction of space-time Petrov-Galerkin variational problems

DOI10.1007/978-3-030-55874-1_104MaRDI QIDQ5152908zbMATH OpenOpenAlexFDO

Authors Julian Henning, Davide Palitta, Valeria Simoncini, Karsten Urban

Publication date 27 September 2021

Published in Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1912.10082

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) Numerical methods for partial differential equations, initial value and time-dependent initial-boundary value problems (65M99)

Abstract: Variational formulations of time-dependent PDEs in space and time yield $(d+1)$-dimensional problems to be solved numerically. This increases the number of unknowns as well as the storage amount. On the other hand, this approach enables adaptivity in space and time as well as model reduction w.r.t. both type of variables. In this paper, we show that matrix oriented techniques can significantly reduce the computational timings for solving the arising linear systems outperforming both time-stepping schemes and other solvers.

Recommendations

• Variational space-time elements for large-scale systems
• Petrov–Galerkin space-time hp-approximation of parabolic equations in H1/2
• Space-time least-squares Petrov-Galerkin projection for nonlinear model reduction
• A priori model reduction through proper generalized decomposition for solving time-dependent partial differential equations
• A Variational Formulation for LTI-Systems and Model Reduction

Cites work

• (Parametrized) First Order Transport Equations: Realization of Optimally Stable Petrov--Galerkin Methods
• A low-rank in time approach to PDE-constrained optimization
• Adaptive rational Krylov subspaces for large-scale dynamical systems
• Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
• An `empirical interpolation' method: Application to efficient reduced-basis discretization of partial differential equations
• An efficient reduced basis solver for stochastic Galerkin matrix equations
• An improved error bound for reduced basis approximation of linear parabolic problems
• Computational Methods for Linear Matrix Equations
• scientific article; zbMATH DE number 42084 (Why is no real title available?)
• scientific article; zbMATH DE number 3264298 (Why is no real title available?)
• On the construction of sparse tensor product spaces
• Parametric PDEs: sparse or low-rank approximations?
• Some observations on Babuška and Brezzi theories
• Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations
• Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs
• Two ways to treat time in reduced basis methods

Cited in

(9)

• Discrete conservation laws for finite element discretisations of multisymplectic PDEs
• Computation and learning in high dimensions. Abstracts from the workshop held August 1--7, 2021 (hybrid meeting)
• Stable and efficient Petrov-Galerkin methods for a kinetic Fokker-Planck equation
• An ultraweak space-time variational formulation for the wave equation: analysis and efficient numerical solution
• Analysis of the Truncated Conjugate Gradient Method for Linear Matrix Equations
• A space-time variational method for optimal control problems: well-posedness, stability and numerical solution
• Optimization problems for PDEs in weak space-time form. Abstracts from the workshop held March 5--10, 2023
• The reduced basis method in space and time: challenges, limits and perspectives
• Sketched and truncated polynomial Krylov subspace methods: matrix Sylvester equations

This page was built for publication: Matrix oriented reduction of space-time Petrov-Galerkin variational problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5152908)