skip to main content

Title: Approximating Continuous Functions on Persistence Diagrams Using Template Functions
Award ID(s):
2006661 1943758
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Foundations of Computational Mathematics
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract Accurate tracking of nonminimum phase (NMP) systems is well known to require large amounts of control effort. It is, therefore, of practical value to minimize the effort needed to achieve a desired level of tracking accuracy for NMP systems. There is growing interest in the use of the filtered basis functions (FBF) approach for tracking the control of linear NMP systems because of distinct performance advantages it has over other methods. The FBF approach expresses the control input as a linear combination of user-defined basis functions. The basis functions are forward filtered through the dynamics of the plant, and the coefficients are selected such that the tracking error is minimized. There is a wide variety of basis functions that can be used with the FBF approach, but there has been no work to date on how to select the best set of basis functions. Toward selecting the best basis functions, the Frobenius norm of the lifted system representation (LSR) of dynamics is proposed as an excellent metric for evaluating the performance of linear time varying (LTV) discrete-time tracking controllers, like FBF, independent of the desired trajectory to be tracked. Using the metric, an optimal set of basis functions that minimize the control effort without sacrificing tracking accuracy is proposed. The optimal set of basis functions is shown in simulations and experiments to significantly reduce control effort while maintaining or improving tracking accuracy compared to popular basis functions, like B-splines. 
    more » « less
  2. null (Ed.)
  3. For a fairly general family of L L -functions, we survey the known consequences of the existence of asymptotic formulas with power-saving error term for the (twisted) first and second moments of the central values in the family. We then consider in detail the important special case of the family of twists of a fixed cusp form by primitive Dirichlet characters modulo a prime q q , and prove that it satisfies such formulas. We derive arithmetic consequences: a positive proportion of central values L ( f ⊗ χ , 1 / 2 ) L(f\otimes \chi ,1/2) are non-zero, and indeed bounded from below; there exist many characters χ \chi for which the central L L -value is very large; the probability of a large analytic rank decays exponentially fast. We finally show how the second moment estimate establishes a special case of a conjecture of Mazur and Rubin concerning the distribution of modular symbols. 
    more » « less
  4. null ; null ; Shoikhet, D. ; Vajiac, E. (Ed.)
    We consider the existence and structure properties of Parseval frames of kernel functions in vector valued de Branges spaces. We develop some sufficient conditions for Parseval sequences by identifying the main construction with Naimark dilation of frames. The dilation occurs by embedding the de Branges space of vector valued functions into a dilated de Branges space of vector valued functions. The embedding also maps the kernel functions associated with a frame sequence of the original space into a Riesz basis for the embedding space. We also develop some sufficient conditions for a dilated de Branges space to have the Kramer sampling property. 
    more » « less