The algebro-geometric study of range maps

Localizing a radiant source is a widespread problem to many scientific and technological research areas. E.g. localization based on range measurements stays at the core of technologies like radar, sonar and wireless sensors networks. In this manuscript we study in depth the model for source localization based on range measurements obtained from the source signal, from the point of view of algebraic geometry. In the case of three receivers, we find unexpected connections between this problem and the geometry of Kummer's and Cayley's surfaces. Our work gives new insights also on the localization based on range differences.Comment: 38 pages, 18 figure

Eigenvalue analysis and convergence acceleration techniques for summation-by-parts approximations

Many physical phenomena can be described mathematically by means of partial differential equations. These mathematical formulations are said to be well-posed if a unique solution, bounded by the given data, exists. The boundedness of the solution can be established through the so-called energy-method, which leads to an estimate of the solution by means of integration-by-parts. Numerical approximations mimicking integration-by-parts discretely are said to fulfill the Summation-By-Parts (SBP) property. These formulations naturally yield bounded approximate solutions if the boundary conditions are weakly imposed through Simultaneous-Approximation-Terms (SAT). Discrete problems with bounded solutions are said to be energy-stable. Energy-stable and high-order accurate SBP-SAT discretizations for well-posed linear problems were first introduced for centered finite-difference methods. These mathematical formulations, based on boundary conforming grids, allow for an exact mimicking of integration-by-parts. However, other discretizations techniques that do not include one or both boundary nodes, such as pseudo-spectral collocation methods, only fulfill a generalized SBP (GSBP) property but still lead to energy-stable solutions. This thesis consists of two main topics. The first part, which is mostly devoted to theoretical investigations, treats discretizations based on SBP and GSBP operators. A numerical approximation of a conservation law is said to be conservative if the approximate solution mimics the physical conservation property. It is shown that conservative and energy-stable spatial discretizations of variable coefficient problems require an exact numerical mimicking of integration-by-parts. We also discuss the invertibility of the algebraic problems arising from (G)SBP-SAT discretizations in time of energy-stable spatial approximations. We prove that pseudo-spectral collocation methods for the time derivative lead to invertible fully-discrete problems. The same result is proved for second-, fourth- and sixth-order accurate finite-difference based time integration methods. Once the invertibility of (G)SBP-SAT discrete formulations is established, we are interested in efficient algorithms for the unique solution of such problems. To this end, the second part of the thesis has a stronger experimental flavour and deals with convergence acceleration techniques for SBP-SAT approximations. First, we consider a modified Dual Time-Stepping (DTS) technique which makes use of two derivatives in pseudo-time. The new DTS formulation, compared to the classical one, accelerates the convergence to steady-state and reduces the stiffness of the problem. Next, we investigate multi-grid methods. For parabolic problems, highly oscillating error modes are optimally damped by iterative methods, while smooth residuals are transferred to coarser grids. In this case, we show that the Galerkin condition in combination with the SBP-preserving interpolation operators leads to fast convergence. For hyperbolic problems, low frequency error modes are rapidly expelled by grid coarsening, since coarser grids have milder stability restrictions on time steps. For such problems, Total Variation Dimishing Multi-Grid (TVD-MG) allows for faster wave propagation of first order upwind discretizations. In this thesis, we extend low order TVD-MG schemes to high-order SBP-SAT upwind discretizations

On conservation and stability properties for summation-by-parts schemes

We discuss conservative and stable numerical approximations in summation-by-parts form for linear hyperbolic problems with variable coefficients. An extended setting, where the boundary or interface may or may not be included in the grid, is considered. We prove that conservative and stable formulations for variable coefficient problems require a boundary and interface conforming grid and exact numerical mimicking of integration-by-parts. Finally, we comment on how the conclusions from the linear analysis carry over to the nonlinear setting.Funding agencies: VINNOVA [2013-01209]</p

Eigenvalue analysis for summation-by-parts finite difference time discretizations

Diagonal norm finite-difference based time integration methods in summation-by-parts form are investigated. The second, fourth and sixth order accurate discretizations are proven to have eigenvalues with strictly positive real parts. This leads to provably invertible fully-discrete approximations of initial boundary value problems. Our findings also allow us to conclude that the second, fourth and sixth order time discretizations are stiffly accurate, strongly S-stable and dissipatively stable Runge-Kutta methods. The procedure outlined in this article can be extended to even higher order summation-by-parts approximations with repeating stencil

Multigrid Schemes for High Order Discretizations of Hyperbolic Problems

Total variation diminishing multigrid methods have been developed for first order accurate discretizations of hyperbolic conservation laws. This technique is based on a so-called upwind biased residual interpolation and allows for algorithms devoid of spurious numerical oscillations in the transient phase. In this paper, we justify the introduction of such prolongation and restriction operators by rewriting the algorithm in a matrix-vector notation. This perspective sheds new light on multigrid procedures for hyperbolic problems and provides a direct extension for high order accurate difference approximations. The new multigrid procedure is presented, advantages and disadvantages are discussed and numerical experiments are performed.Funding agencies: Linkoping University; VINNOVA, the Swedish Governmental Agency for Innovation SystemsVinnova [2013-01209]</p

Eigenvalue analysis for summation-by-parts finite difference time discretizations

Diagonal norm finite difference based time integration methods in summation-by-parts form are investigated. The second, fourth, and sixth order accurate discretizations are proven to have eigenvalues with strictly positive real parts. This leads to provably invertible fully discrete approximations of initial boundary value problems. Our findings also allow us to conclude that the Runge--Kutta methods based on second, fourth, and sixth order summation-by-parts finite difference time discretizations automatically satisfy previously unreported stability properties. The procedure outlined in this article can be extended to even higher order summation-by-parts approximations with repeating stencil.Funding agencies:  VINNOVA, the Swedish Governmental Agency for Innovation SystemsVinnova [2013-01209]</p

Dual Time-Stepping Using Second Derivatives

We present a modified formulation of the dual time-stepping technique which makes use of two derivatives in pseudo-time. This new technique retains and improves the convergence properties to the stationary solution. When compared with the conventional dual time-stepping, the method with two derivatives reduces the stiffness of the problem and requires fewer iterations for full convergence to steady-state. In the current formulation, these positive effects require that an approximation of the square root of the spatial operator is available and inexpensive.Funding agencies:  Linkoping University; Swedish Governmental Agency for Innovation SystemsVinnova [2013-01209]; VINNOVAVinnova</p

On pseudo-spectral time discretizations in summation-by-parts form

Fully-implicit discrete formulations in summation-by-parts form for initial-boundary value problems must be invertible in order to provide well functioning procedures. We prove that, under mild assumptions, pseudo-spectral collocation methods for the time derivative lead to invertible discrete systems when energy-stable spatial discretizations are used

Eigenvalue analysis for summation-by-parts finite difference time discretizations

Diagonal norm finite-difference based time integration methods in summation-by-parts form are investigated. The second, fourth and sixth order accurate discretizations are proven to have eigenvalues with strictly positive real parts. This leads to provably invertible fully-discrete approximations of initial boundary value problems. Our findings also allow us to conclude that the second, fourth and sixth order time discretizations are stiffly accurate, strongly S-stable and dissipatively stable Runge-Kutta methods. The procedure outlined in this article can be extended to even higher order summation-by-parts approximations with repeating stencil