986 research outputs found
GPU-accelerated discontinuous Galerkin methods on hybrid meshes
We present a time-explicit discontinuous Galerkin (DG) solver for the
time-domain acoustic wave equation on hybrid meshes containing vertex-mapped
hexahedral, wedge, pyramidal and tetrahedral elements. Discretely energy-stable
formulations are presented for both Gauss-Legendre and Gauss-Legendre-Lobatto
(Spectral Element) nodal bases for the hexahedron. Stable timestep restrictions
for hybrid meshes are derived by bounding the spectral radius of the DG
operator using order-dependent constants in trace and Markov inequalities.
Computational efficiency is achieved under a combination of element-specific
kernels (including new quadrature-free operators for the pyramid), multi-rate
timestepping, and acceleration using Graphics Processing Units.Comment: Submitted to CMAM
Solving rank structured Sylvester and Lyapunov equations
We consider the problem of efficiently solving Sylvester and Lyapunov
equations of medium and large scale, in case of rank-structured data, i.e.,
when the coefficient matrices and the right-hand side have low-rank
off-diagonal blocks. This comprises problems with banded data, recently studied
by Haber and Verhaegen in "Sparse solution of the Lyapunov equation for
large-scale interconnected systems", Automatica, 2016, and by Palitta and
Simoncini in "Numerical methods for large-scale Lyapunov equations with
symmetric banded data", SISC, 2018, which often arise in the discretization of
elliptic PDEs.
We show that, under suitable assumptions, the quasiseparable structure is
guaranteed to be numerically present in the solution, and explicit novel
estimates of the numerical rank of the off-diagonal blocks are provided.
Efficient solution schemes that rely on the technology of hierarchical
matrices are described, and several numerical experiments confirm the
applicability and efficiency of the approaches. We develop a MATLAB toolbox
that allows easy replication of the experiments and a ready-to-use interface
for the solvers. The performances of the different approaches are compared, and
we show that the new methods described are efficient on several classes of
relevant problems
Matrices, moments and rational quadrature
15 pages, no figures.-- MSC2000 code: 65D15.MR#: MR2456794 (2009h:65035)Zbl#: Zbl pre05362059^aMany problems in science and engineering require the evaluation of functionals of the form F_u(A)=u^\ssf Tf(A)u , where A is a large symmetric matrix, u a vector, and f a nonlinear function. A popular and fairly inexpensive approach to determining upper and lower bounds for such functionals is based on first carrying out a few steps of the Lanczos procedure applied to A with initial vector u, and then evaluating pairs of Gauss and Gauss–Radau quadrature rules associated with the tridiagonal matrix determined by the Lanczos procedure. The present paper extends this approach to allow the use of rational Gauss quadrature rules.Publicad
- …