skip to main content

Explore Research Products in the NSF-PAR

Title: Motion tomography via occupation kernels

The goal of motion tomography is to recover a description of a vector flow field using measurements along the trajectory of a sensing unit. In this paper, we develop a predictor corrector algorithm designed to recover vector flow fields from trajectory data with the use of occupation kernels developed by Rosenfeld et al. [9,10]. Specifically, we use the occupation kernels as an adaptive basis; that is, the trajectories defining our occupation kernels are iteratively updated to improve the estimation in the next stage. Initial estimates are established, then under mild assumptions, such as relatively straight trajectories, convergence is proven using the Contraction Mapping Theorem. We then compare the developed method with the established method by Chang et al. [5] by defining a set of error metrics. We found that for simulated data, where a ground truth is available, our method offers a marked improvement over [5]. For a real-world example, where ground truth is not available, our results are similar results to the established method.

  more » « less
Award ID(s):
2027999
NSF-PAR ID:
10332072
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
Journal of Computational Dynamics
Volume:
9
Issue:
1
ISSN:
2158-2491
Page Range / eLocation ID:
27
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ( , Discrete and Continuous Dynamical Systems)

    We consider the well-known Lieb-Liniger (LL) model for \begin{document}$ N $\end{document} bosons interacting pairwise on the line via the \begin{document}$ \delta $\end{document} potential in the mean-field scaling regime. Assuming suitable asymptotic factorization of the initial wave functions and convergence of the microscopic energy per particle, we show that the time-dependent reduced density matrices of the system converge in trace norm to the pure states given by the solution to the one-dimensional cubic nonlinear Schrödinger equation (NLS) with an explict rate of convergence. In contrast to previous work [3] relying on the formalism of second quantization and coherent states and without an explicit rate, our proof is based on the counting method of Pickl [65,66,67] and Knowles and Pickl [44]. To overcome difficulties stemming from the singularity of the \begin{document}$ \delta $\end{document} potential, we introduce a new short-range approximation argument that exploits the Hölder continuity of the \begin{document}$ N $\end{document}-body wave function in a single particle variable. By further exploiting the \begin{document}$ L^2 $\end{document}-subcritical well-posedness theory for the 1D cubic NLS, we can prove mean-field convergence when the limiting solution to the NLS has finite mass, but only for a very special class of \begin{document}$ N $\end{document}-body initial states.

     
    more » « less
  2. ; ( , Evolution Equations and Control Theory)

    We consider the linear third order (in time) PDE known as the SMGTJ-equation, defined on a bounded domain, under the action of either Dirichlet or Neumann boundary control \begin{document}$ g $\end{document}. Optimal interior and boundary regularity results were given in [1], after [41], when \begin{document}$ g \in L^2(0, T;L^2(\Gamma)) \equiv L^2(\Sigma) $\end{document}, which, moreover, in the canonical case \begin{document}$ \gamma = 0 $\end{document}, were expressed by the well-known explicit representation formulae of the wave equation in terms of cosine/sine operators [19], [17], [24,Vol Ⅱ]. The interior or boundary regularity theory is however the same, whether \begin{document}$ \gamma = 0 $\end{document} or \begin{document}$ 0 \neq \gamma \in L^{\infty}(\Omega) $\end{document}, since \begin{document}$ \gamma \neq 0 $\end{document} is responsible only for lower order terms. Here we exploit such cosine operator based-explicit representation formulae to provide optimal interior and boundary regularity results with \begin{document}$ g $\end{document} "smoother" than \begin{document}$ L^2(\Sigma) $\end{document}, qualitatively by one unit, two units, etc. in the Dirichlet boundary case. To this end, we invoke the corresponding results for wave equations, as in [17]. Similarly for the Neumann boundary case, by invoking the corresponding results for the wave equation as in [22], [23], [37] for control smoother than \begin{document}$ L^2(0, T;L^2(\Gamma)) $\end{document}, and [44] for control less regular in space than \begin{document}$ L^2(\Gamma) $\end{document}. In addition, we provide optimal interior and boundary regularity results when the SMGTJ equation is subject to interior point control, by invoking the corresponding wave equations results [42], [24,Section 9.8.2].

     
    more » « less
  3. ; ( , Discrete and Continuous Dynamical Systems)

    We study the asymptotics of the Poisson kernel and Green's functions of the fractional conformal Laplacian for conformal infinities of asymptotically hyperbolic manifolds. We derive sharp expansions of the Poisson kernel and Green's functions of the conformal Laplacian near their singularities. Our expansions of the Green's functions answer the first part of the conjecture of Kim-Musso-Wei[21] in the case of locally flat conformal infinities of Poincare-Einstein manifolds and together with the Poisson kernel asymptotic is used also in our paper [25] to show solvability of the fractional Yamabe problem in that case. Our asymptotics of the Green's functions on the general case of conformal infinities of asymptotically hyperbolic space is used also in [29] to show solvability of the fractional Yamabe problem for conformal infinities of dimension \begin{document}$ 3 $\end{document} and fractional parameter in \begin{document}$ (\frac{1}{2}, 1) $\end{document} corresponding to a global case left by previous works.

     
    more » « less
  4. ; ; ; ; ; ; ; ( , ACM Transactions on Algorithms)

    Minimum flow decomposition (MFD) is the NP-hard problem of finding a smallest decomposition of a network flow/circulationXon a directed graphGinto weighted source-to-sink paths whose weighted sum equalsX. We show that, for acyclic graphs, considering thewidthof the graph (the minimum number of paths needed to cover all of its edges) yields advances in our understanding of its approximability. For the version of the problem that uses only non-negative weights, we identify and characterise a new class ofwidth-stablegraphs, for which a popular heuristic is aO(logVal(X))-approximation (Val(X) being the total flow ofX), and strengthen its worst-case approximation ratio from\(\Omega (\sqrt {m})\)to Ω (m/logm) for sparse graphs, wheremis the number of edges in the graph. We also study a new problem on graphs with cycles, Minimum Cost Circulation Decomposition (MCCD), and show that it generalises MFD through a simple reduction. For the version allowing also negative weights, we give a (⌈ log ‖ X ‖ ⌉ +1)-approximation (‖X‖ being the maximum absolute value ofXon any edge) using a power-of-two approach, combined with parity fixing arguments and a decomposition of unitary circulations (‖X‖ ≤ 1), using a generalised notion of width for this problem. Finally, we disprove a conjecture about the linear independence of minimum (non-negative) flow decompositions posed by Kloster et al. [2018], but show that its useful implication (polynomial-time assignments of weights to a given set of paths to decompose a flow) holds for the negative version.

     
    more » « less
  5. ; ( , Kinetic and Related Models)

    Following closely the classical works [5]-[7] by Glassey, Strauss, and Schaeffer, we present a version of the Glassey-Strauss representation for the Vlasov-Maxwell systems in a 3D half space when the boundary is the perfect conductor.

     
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email