The minimal disturbance invariant set: Outer approximations via its partial sums

Automatica ◽  
2006 ◽  
Vol 42 (9) ◽  
pp. 1563-1568 ◽  
Author(s):  
Chong-Jin Ong ◽  
Elmer G. Gilbert
Keyword(s):  
Invariant Set ◽  
Partial Sums ◽  
Outer Approximations

Robust Motion Planning for Uncertain Systems With Disturbances Using the Invariant-Set Motion Planner

2020 ◽  
Vol 65 (10) ◽  
pp. 4456-4463
Author(s):  
Claus Danielson ◽  
Karl Berntorp ◽  
Avishai Weiss ◽  
Stefano Di Cairano
Keyword(s):  
Motion Planning ◽  
Uncertain Systems ◽  
Invariant Set

scholarly journals Metric Fourier Approximation of Set-Valued Functions of Bounded Variation

2021 ◽  
Vol 27 (2) ◽  
Author(s):  
Elena E. Berdysheva ◽  
Nira Dyn ◽  
Elza Farkhi ◽  
Alona Mokhov
Keyword(s):  
Fourier Series ◽  
Bounded Variation ◽  
Error Bounds ◽  
Metric Spaces ◽  
Hausdorff Metric ◽  
Dirichlet Kernel ◽  
Partial Sums ◽  
Functions Of Bounded Variation ◽  
Moduli Of Continuity ◽  
Fourier Approximation

AbstractWe introduce and investigate an adaptation of Fourier series to set-valued functions (multifunctions, SVFs) of bounded variation. In our approach we define an analogue of the partial sums of the Fourier series with the help of the Dirichlet kernel using the newly defined weighted metric integral. We derive error bounds for these approximants. As a consequence, we prove that the sequence of the partial sums converges pointwisely in the Hausdorff metric to the values of the approximated set-valued function at its points of continuity, or to a certain set described in terms of the metric selections of the approximated multifunction at a point of discontinuity. Our error bounds are obtained with the help of the new notions of one-sided local moduli and quasi-moduli of continuity which we discuss more generally for functions with values in metric spaces.

Using Butterfly-patterned Partial Sums to Draw from Discrete Distributions

2019 ◽  
Vol 6 (4) ◽  
pp. 1-30
Author(s):  
Guy L. Steele Jr. ◽  
Jean-Baptiste Tristan
Keyword(s):  
Discrete Distributions ◽  
Partial Sums

Fast Bilinear Algorithms for Symmetric Tensor Contractions

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Edgar Solomonik ◽  
James Demmel
Keyword(s):  
Symmetric Matrix ◽  
Matrix Multiplication ◽  
Computational Cost ◽  
Symmetric Tensor ◽  
Partial Sums ◽  
Symmetric Tensors ◽  
Outer Product ◽  
Bilinear Complexity ◽  
Special Cases ◽  
Tensor Contractions

AbstractIn matrix-vector multiplication, matrix symmetry does not permit a straightforward reduction in computational cost. More generally, in contractions of symmetric tensors, the symmetries are not preserved in the usual algebraic form of contraction algorithms. We introduce an algorithm that reduces the bilinear complexity (number of computed elementwise products) for most types of symmetric tensor contractions. In particular, it lowers the bilinear complexity of symmetrized contractions of symmetric tensors of order {s+v} and {v+t} by a factor of {\frac{(s+t+v)!}{s!t!v!}} to leading order. The algorithm computes a symmetric tensor of bilinear products, then subtracts unwanted parts of its partial sums. Special cases of this algorithm provide improvements to the bilinear complexity of the multiplication of a symmetric matrix and a vector, the symmetrized vector outer product, and the symmetrized product of symmetric matrices. While the algorithm requires more additions for each elementwise product, the total number of operations is in some cases less than classical algorithms, for tensors of any size. We provide a round-off error analysis of the algorithm and demonstrate that the error is not too large in practice. Finally, we provide an optimized implementation for one variant of the symmetry-preserving algorithm, which achieves speedups of up to 4.58\times for a particular tensor contraction, relative to a classical approach that casts the problem as a matrix-matrix multiplication.

scholarly journals Partial sums and inclusion relations for analytic functions involving (p, q)-differential operator

2021 ◽  
Vol 19 (1) ◽  
pp. 329-337
Author(s):  
Huo Tang ◽  
Kaliappan Vijaya ◽  
Gangadharan Murugusundaramoorthy ◽  
Srikandan Sivasubramanian
Keyword(s):  
Analytic Function ◽  
Differential Operator ◽  
Lower Bounds ◽  
Analytic Functions ◽  
Function Class ◽  
Partial Sums ◽  
Generalized Function ◽  
Inclusion Relations ◽  
Alpha Beta

Abstract Let f k ( z ) = z + ∑ n = 2 k a n z n {f}_{k}\left(z)=z+{\sum }_{n=2}^{k}{a}_{n}{z}^{n} be the sequence of partial sums of the analytic function f ( z ) = z + ∑ n = 2 ∞ a n z n f\left(z)=z+{\sum }_{n=2}^{\infty }{a}_{n}{z}^{n} . In this paper, we determine sharp lower bounds for Re { f ( z ) / f k ( z ) } {\rm{Re}}\{f\left(z)\hspace{-0.08em}\text{/}\hspace{-0.08em}{f}_{k}\left(z)\} , Re { f k ( z ) / f ( z ) } {\rm{Re}}\{{f}_{k}\left(z)\hspace{-0.08em}\text{/}\hspace{-0.08em}f\left(z)\} , Re { f ′ ( z ) / f k ′ ( z ) } {\rm{Re}}\{{f}^{^{\prime} }\left(z)\hspace{-0.08em}\text{/}\hspace{-0.08em}{f}_{k}^{^{\prime} }\left(z)\} and Re { f k ′ ( z ) / f ′ ( z ) } {\rm{Re}}\{{f}_{k}^{^{\prime} }\left(z)\hspace{-0.08em}\text{/}\hspace{-0.08em}{f}^{^{\prime} }\left(z)\} , where f ( z ) f\left(z) belongs to the subclass J p , q m ( μ , α , β ) {{\mathcal{J}}}_{p,q}^{m}\left(\mu ,\alpha ,\beta ) of analytic functions, defined by Sălăgean ( p , q ) \left(p,q) -differential operator. In addition, the inclusion relations involving N δ ( e ) {N}_{\delta }\left(e) of this generalized function class are considered.

scholarly journals On The Tails of the Exponential Series

1994 ◽  
Vol 37 (2) ◽  
pp. 278-286 ◽  
Author(s):  
C. Yalçin Yildirim
Keyword(s):  
Zeta Function ◽  
Riemann Zeta Function ◽  
Partial Sums ◽  
Maclaurin Series ◽  
Exponential Series ◽  
Asymptotic Estimation ◽  
The Riemann Zeta Function ◽  
Riemann Zeta

AbstractA relation between the zeros of the partial sums and the zeros of the corresponding tails of the Maclaurin series for ez is established. This allows an asymptotic estimation of a quantity which came up in the theory of the Riemann zeta-function. Some new properties of the tails of ez are also provided.

Sign in / Sign up

Export Citation Format

Share Document