scholarly journals Canonical Sets of BestL1-Approximation

2012 ◽  
Vol 2012 ◽  
pp. 1-38
Author(s):  
Dimiter Dryanov ◽  
Petar Petrov
Keyword(s):  
Multivariate Interpolation ◽  
Chebyshev System ◽  
Interpolation Spaces ◽  
Large Classes ◽  
Chebyshev Systems ◽  
Blending Functions ◽  
Point Set ◽  
Univariate Functions ◽  
New Inequalities

In mathematics, the termapproximationusually means either interpolation on a point set or approximation with respect to a given distance. There is a concept, which joins the two approaches together, and this is the concept of characterization of the best approximants via interpolation. It turns out that for some large classes of functions the best approximants with respect to a certain distance can be constructed by interpolation on a point set that does not depend on the choice of the function to be approximated. Such point sets are calledcanonical sets of best approximation. The present paper summarizes results on canonical sets of bestL1-approximation with emphasis on multivariate interpolation and bestL1-approximation by blending functions. The bestL1-approximants are characterized as transfinite interpolants on canonical sets. The notion of a Haar-Chebyshev system in the multivariate case is discussed also. In this context, it is shown that some multivariate interpolation spaces share properties of univariate Haar-Chebyshev systems. We study also the problem of best one-sided multivariateL1-approximation by sums of univariate functions. Explicit constructions of best one-sidedL1-approximants give rise to well-known and new inequalities.

scholarly journals Topological Approach to Mathematical Programs with Switching Constraints

2021 ◽  
Author(s):  
Vladimir Shikhman
Keyword(s):  
Stationary Point ◽  
Mountain Pass Theorem ◽  
Strong Stability ◽  
Complete Characterization ◽  
Stationary Points ◽  
Mathematical Programs ◽  
Linear Independence Constraint Qualification ◽  
Point Set ◽  
Stationary Level

AbstractWe study mathematical programs with switching constraints (for short, MPSC) from the topological perspective. Two basic theorems from Morse theory are proved. Outside the W-stationary point set, continuous deformation of lower level sets can be performed. However, when passing a W-stationary level, the topology of the lower level set changes via the attachment of a w-dimensional cell. The dimension w equals the W-index of the nondegenerate W-stationary point. The W-index depends on both the number of negative eigenvalues of the restricted Lagrangian’s Hessian and the number of bi-active switching constraints. As a consequence, we show the mountain pass theorem for MPSC. Additionally, we address the question if the assumption on the nondegeneracy of W-stationary points is too restrictive in the context of MPSC. It turns out that all W-stationary points are generically nondegenerate. Besides, we examine the gap between nondegeneracy and strong stability of W-stationary points. A complete characterization of strong stability for W-stationary points by means of first and second order information of the MPSC defining functions under linear independence constraint qualification is provided. In particular, no bi-active Lagrange multipliers of a strongly stable W-stationary point can vanish.

scholarly journals Hyperstability of the Fréchet Equation and a Characterization of Inner Product Spaces

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Anna Bahyrycz ◽  
Janusz Brzdęk ◽  
Magdalena Piszczek ◽  
Justyna Sikorska
Keyword(s):  
Fixed Point ◽  
Fixed Point Theorem ◽  
Point Theorem ◽  
Main Tool ◽  
Inner Product ◽  
Product Spaces ◽  
Inner Product Spaces ◽  
Fréchet Equation ◽  
New Inequalities

We prove some stability and hyperstability results for the well-known Fréchet equation stemming from one of the characterizations of the inner product spaces. As the main tool, we use a fixed point theorem for the function spaces. We finish the paper with some new inequalities characterizing the inner product spaces.

scholarly journals Semiarcs with Long Secants

10.37236/3771 ◽  
2014 ◽  
Vol 21 (1) ◽  
Author(s):  
Bence Csajbók
Keyword(s):  
Lower Bound ◽  
Projective Plane ◽  
Complete Characterization ◽  
Symmetric Difference ◽  
Blocking Set ◽  
Point Set

In a projective plane $\Pi_q$ of order $q$, a non-empty point set $\mathcal{S}_t$ is a $t$-semiarc if the number of tangent lines to $\mathcal{S}_t$ at each of its points is $t$. If $\mathcal{S}_t$ is a $t$-semiarc in $\Pi_q$, $t<q$, then each line intersects $\mathcal{S}_t$ in at most $q+1-t$ points. Dover proved that semiovals (semiarcs with $t=1$) containing $q$ collinear points exist in $\Pi_q$ only if $q\leq 3$. We show that if $t>1$, then $t$-semiarcs with $q+1-t$ collinear points exist only if $t\geq \sqrt{q-1}$. In $\mathrm{PG}(2,q)$ we prove the lower bound $t\geq(q-1)/2$, with equality only if $\mathcal{S}_t$ is a blocking set of Rédei type of size $3(q+1)/2$.We call the symmetric difference of two lines, with $t$ further points removed from each line, a $V_t$-configuration. We give conditions ensuring a $t$-semiarc to contain a $V_t$-configuration and give the complete characterization of such $t$-semiarcs in $\mathrm{PG}(2,q)$.

Symbolic computation and the diffusion of shapes of triads

1988 ◽  
Vol 20 (04) ◽  
pp. 775-797 ◽  
Author(s):  
Wilfrid S. Kendall
Keyword(s):  
Brownian Motion ◽  
Symbolic Computation ◽  
Joint Distribution ◽  
Dimensional Space ◽  
Uhlenbeck Process ◽  
Higher Dimensional ◽  
Itô Calculus ◽  
Exponential Random Variables ◽  
Point Set

This paper introduces the use of symbolic computation (also known as computer algebra) in stochastic analysis and particularly in the Itô calculus. Two related examples are considered: the Clifford-Green theorem on random Gaussian triangles, and a generalization of the D. G. Kendall theorem on the kinematics of shape. The Clifford–Green theorem gives a remarkable characterization of the joint distribution of the squared-side-lengths of n independent Gaussian points in n-space, namely that this distribution is that of n independent exponential random variables conditioned to satisfy all the inequalities requisite if they are to arise as squared-side-lengths from a point-set in n-space. The D. G. Kendall theorem on the diffusion of shape identifies the statistics of the diffusion arising (under a time-change) as the shape of a triangle whose vertices diffuse by Brownian motion in 2-space or 3-space. Symbolic Itô calculus is used to give a new proof of the Clifford-Green theorem, and to generalize the D. G. Kendall theorem to the case of triangles in higher-dimensional space whose vertices diffuse either according to Brownian motion or according to an Ornstein–Uhlenbeck process.

Sign in / Sign up

Export Citation Format

Share Document