Matrix Oriented Reduction of Space-Time Petrov-Galerkin Variational Problems
From MaRDI portal
Publication:5152908
DOI10.1007/978-3-030-55874-1_104zbMath1475.65123arXiv1912.10082OpenAlexW3164777008MaRDI QIDQ5152908
Karsten Urban, Valeria Simoncini, Julian Henning, Davide Palitta
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
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)
Related Items
Analysis of the Truncated Conjugate Gradient Method for Linear Matrix Equations ⋮ Discrete conservation laws for finite element discretisations of multisymplectic PDEs ⋮ 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 ⋮ Computation and learning in high dimensions. Abstracts from the workshop held August 1--7, 2021 (hybrid meeting) ⋮ An ultraweak space-time variational formulation for the wave equation: Analysis and efficient numerical solution ⋮ Stable and Efficient Petrov--Galerkin Methods for a Kinetic Fokker--Planck Equation
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations
- Adaptive rational Krylov subspaces for large-scale dynamical systems
- Some observations on Babuška and Brezzi theories
- An `empirical interpolation' method: Application to efficient reduced-basis discretization of partial differential equations
- An Efficient Reduced Basis Solver for Stochastic Galerkin Matrix Equations
- Tensor-Structured Galerkin Approximation of Parametric and Stochastic Elliptic PDEs
- Computational Methods for Linear Matrix Equations
- A Low-Rank in Time Approach to PDE-Constrained Optimization
- Parametric PDEs: sparse or low-rank approximations?
- (Parametrized) First Order Transport Equations: Realization of Optimally Stable Petrov--Galerkin Methods
- Two Ways to Treat Time in Reduced Basis Methods
- On the construction of sparse tensor product spaces
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- An improved error bound for reduced basis approximation of linear parabolic problems