Related papers: How to avoid mass matrix for linear hyperbolic pro…
The solution of systems of non-autonomous linear ordinary differential equations is crucial in a variety of applications, such us nuclear magnetic resonance spectroscopy. A new method with spectral accuracy has been recently introduced in…
We introduce in this document a direct method allowing to solve numerically inverse type problems for linear hyperbolic equations. We first consider the reconstruction of the full solution of the wave equation posed in $\Omega\times (0,T)$…
This work presents a matrix-free finite element solver for finite-strain elasticity adopting an $hp$-multigrid preconditioner. Compared to classical algorithms relying on a global sparse matrix, matrix-free solution strategies significantly…
Direct solution of simultaneous linear equations is regarded to be slow for large systems of equations and requires special treatment to avoid numerical instability. A new method is proposed that addresses the numerical instability without…
The finite element method is a well-established method for the numerical solution of partial differential equations (PDEs), both linear and nonlinear. However, the repeated reassemblage of finite element matrices for nonlinear PDEs is…
The large sparse linear systems arising from the finite element or finite difference discretization of elliptic PDEs can be solved directly via, e.g., nested dissection or multifrontal methods. Such techniques reorder the nodes in the grid…
In many problems in Computational Physics and Chemistry, one finds a special kind of sparse matrices, termed "banded matrices". These matrices, which are defined as having non-zero entries only within a given distance from the main…
This contribution develops an algebraic approach to obtain a controller form for a class of linear hyperbolic MIMO systems, bidirectionally coupled with a linear ODE system at the unactuated boundary. After a short summary of established…
We consider the discontinuous Galerkin method for hyperbolic conservation laws, with some particular attention to the linear acoustic equation, using Bernstein polynomials as local bases. Adapting existing techniques leads to…
In this work we introduce the obstacle-mass constraint problem for a multidimensional scalar hyperbolic conservation law. We prove existence of an entropy solution to this problem by a penalization/viscosity method. The mass constraint…
We consider constrained partial differential equations of hyperbolic type with a small parameter $\varepsilon>0$, which turn parabolic in the limit case, i.e., for $\varepsilon=0$. The well-posedness of the resulting systems is discussed…
Although some preconditioners are available for solving dense linear systems, there are still many matrices for which preconditioners are lacking, in particular in cases where the size of the matrix $N$ becomes very large. There remains…
We propose a novel framework for model-order reduction of hyperbolic differential equations. The approach combines a relaxation formulation of the hyperbolic equations with a discretization using shifted base functions. Model-order…
Hyperbolic polynomials is a class of real-roots polynomials that has wide range of applications in theoretical computer science. Each hyperbolic polynomial also induces a hyperbolic cone that is of particular interest in optimization due to…
We propose to solve polynomial hyperbolic partial differential equations (PDEs) with convex optimization. This approach is based on a very weak notion of solution of the nonlinear equation, namely the measure-valued (mv) solution,…
This paper offers a matrix-free first-order numerical method to solve large-scale conic optimization problems. Solving systems of linear equations pose the most computationally challenging part in both first-order and second-order numerical…
We propose a high-order finite element method for linear fourth-order elliptic problems that is both nodally bound-preserving and mass-conservative, based on a variational inequality formulation. The method admits an equivalent strictly…
We consider the problem of robust matrix completion, which aims to recover a low rank matrix $L_*$ and a sparse matrix $S_*$ from incomplete observations of their sum $M=L_*+S_*\in\mathbb{R}^{m\times n}$. Algorithmically, the robust matrix…
We introduce a general framework for the construction of well-balanced finite volume methods for hyperbolic balance laws. We use the phrase well-balancing in a broader sense, since our proposed method can be applied to exactly follow any…
In this paper we study the construction of a discrete solution for a hyperbolic system of partial differentials of the strongly coupled type. In its construction, the discrete separation of matricial variable method was followed. Two…