Multi-Step Knowledge-Aided Iterative ESPRIT for Direction Finding

In this work, we propose a subspace-based algorithm for DOA estimation which iteratively reduces the disturbance factors of the estimated data covariance matrix and incorporates prior knowledge which is gradually obtained on line. An analysis of the MSE of the reshaped data covariance matrix is carried out along with comparisons between computational complexities of the proposed and existing algorithms. Simulations focusing on closely-spaced sources, where they are uncorrelated and correlated, illustrate the improvements achieved.Comment: 7 figures. arXiv admin note: text overlap with arXiv:1703.1052

Adaptive mesh refinement approach to construction of initial data for black hole collisions

The initial data for black hole collisions is constructed using a conformal-imaging approach and a new adaptive mesh refinement technique, a fully threaded tree (FTT). We developed a second-order accurate approach to the solution of the constraint equations on a non-uniformly refined high resolution Cartesian mesh including second-order accurate treatment of boundary conditions at the black hole throats. Results of test computations show convergence of the solution as the numerical resolution is increased. FTT-based mesh refinement reduces the required memory and computer time by several orders of magnitude compared to a uniform grid. This opens up the possibility of using Cartesian meshes for very high resolution simulations of black hole collisions.Comment: 13 pages, 11 figure

Efficient Resolution of Anisotropic Structures

We highlight some recent new delevelopments concerning the sparse representation of possibly high-dimensional functions exhibiting strong anisotropic features and low regularity in isotropic Sobolev or Besov scales. Specifically, we focus on the solution of transport equations which exhibit propagation of singularities where, additionally, high-dimensionality enters when the convection field, and hence the solutions, depend on parameters varying over some compact set. Important constituents of our approach are directionally adaptive discretization concepts motivated by compactly supported shearlet systems, and well-conditioned stable variational formulations that support trial spaces with anisotropic refinements with arbitrary directionalities. We prove that they provide tight error-residual relations which are used to contrive rigorously founded adaptive refinement schemes which converge in $L_2$. Moreover, in the context of parameter dependent problems we discuss two approaches serving different purposes and working under different regularity assumptions. For frequent query problems, making essential use of the novel well-conditioned variational formulations, a new Reduced Basis Method is outlined which exhibits a certain rate-optimal performance for indefinite, unsymmetric or singularly perturbed problems. For the radiative transfer problem with scattering a sparse tensor method is presented which mitigates or even overcomes the curse of dimensionality under suitable (so far still isotropic) regularity assumptions. Numerical examples for both methods illustrate the theoretical findings

Segregated Runge–Kutta time integration of convection-stabilized mixed finite element schemes for wall-unresolved LES of incompressible flows

In this work, we develop a high-performance numerical framework for the large eddy simulation (LES) of incompressible flows. The spatial discretization of the nonlinear system is carried out using mixed finite element (FE) schemes supplemented with symmetric projection stabilization of the convective term and a penalty term for the divergence constraint. These additional terms introduced at the discrete level have been proved to act as implicit LES models. In order to perform meaningful wall-unresolved simulations, we consider a weak imposition of the boundary conditions using a Nitsche’s-type scheme, where the tangential component penalty term is designed to act as a wall law. Next, segregated Runge–Kutta (SRK) schemes (recently proposed by the authors for laminar flow problems) are applied to the LES simulation of turbulent flows. By the introduction of a penalty term on the trace of the acceleration, these methods exhibit excellent stability properties for both implicit and explicit treatment of the convective terms. SRK schemes are excellent for large-scale simulations, since they reduce the computational cost of the linear system solves by splitting velocity and pressure computations at the time integration level, leading to two uncoupled systems. The pressure system is a Darcy-type problem that can easily be preconditioned using a traditional block-preconditioning scheme that only requires a Poisson solver. At the end, only coercive systems have to be solved, which can be effectively preconditioned by multilevel domain decomposition schemes, which are both optimal and scalable. The framework is applied to the Taylor–Green and turbulent channel flow benchmarks in order to prove the accuracy of the convection-stabilized mixed FEs as LES models and SRK time integrators. The scalability of the preconditioning techniques (in space only) has also been proven for one step of the SRK scheme for the Taylor–Green flow using uniform meshes. Moreover, a turbulent flow around a NACA profile is solved to show the applicability of the proposed algorithms for a realistic problem.Peer ReviewedPostprint (author's final draft

TRAPHIC - Radiative Transfer for Smoothed Particle Hydrodynamics Simulations

We present TRAPHIC, a novel radiative transfer scheme for Smoothed Particle Hydrodynamics (SPH) simulations. TRAPHIC is designed for use in simulations exhibiting a wide dynamic range in physical length scales and containing a large number of light sources. It is adaptive both in space and in angle and can be employed for application on distributed memory machines. The commonly encountered computationally expensive scaling with the number of light sources in the simulation is avoided by introducing a source merging procedure. The (time-dependent) radiative transfer equation is solved by tracing individual photon packets in an explicitly photon-conserving manner directly on the unstructured grid traced out by the set of SPH particles. To accomplish directed transport of radiation despite the irregular spatial distribution of the SPH particles, photons are guided inside cones. We present and test a parallel numerical implementation of TRAPHIC in the SPH code GADGET-2, specified for the transport of mono-chromatic hydrogen-ionizing radiation. The results of the tests are in excellent agreement with both analytic solutions and results obtained with other state-of-the-art radiative transfer codes.Comment: 31 pages, 20 figures. Accepted for publication in MNRAS. Revised version includes many clarifications and a new time-dependent radiative transfer calculation (fig. 19