Subdifferentials of Distance Functions, Approximations and Enlargements

In this work, we study some subdifferentials of the distance function to a nonempty nonconvex closed subset of a general Banach space. We relate them to the normal cone of the enlargements of the set which can be considered as regularizations of the set.     

Approximations of e and π: an exploration

ABSTRACT

Fractional approximations of e and π are discovered by searching for repetitions or partial repetitions of digit strings in their expansions in different number bases. The discovery of such fractional approximations is suggested for students and teachers as an entry point into mathematics research.     

The Existence and Local Behavior of Multivariate Algebraic Function Approximations

The existing scheme of rational polynomial approximants, defined by multivariate power series, is extended to define approximants with branch points. The existence theorem is obtained. The basic properties used to define the rational approximants can be preserved almost intactly. Especially, the local behavior of the     

Padé Approximations of and preservation of quadratic Lyapunov functions

We investigate whether or not quadratic Lyapunov functions are preserved under Padé approximations. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Sampling, Filtering and Sparse Approximations on Combinatorial Graphs

In this paper we address sampling and approximation of functions on combinatorial graphs. We develop filtering on graphs by using Schrödinger’s group of operators generated by combinatorial Laplace operator. Then we construct a sampling theory by proving Poincare and Plancherel-Polya-type inequalities for functions on graphs. These results lead to a theory of sparse approximations on graphs and have potential applications to filtering, denoising, data dimension reduction, image processing, image compression, computer graphics, visualization and learning theory.     

On Spectral Inclusions and Approximations of α-times Resolvent Families

We present some basic properties of fractional resolvent families. Moreover, spectral inclusions and approximation for fractional resolvent families are considered here.     

Approximations of ternary Jordan homomorphisms and derivations in multi-C ? ternary algebras

Using fixed point methods, we prove the generalized Hyers–Ulam stability of homomorphisms in multi-C ^? ternary algebras and of derivations on multi-C ^? ternary algebras for the additive functional equation $$\sum_{i=1}^{m}f \bigg(mx_i+\sum_{j=1,\ j\ne i}^{m}x_j\bigg)+ f\bigg(\sum_{i=1}^{m}x_i\bigg)= 2f\bigg(\sum_{i=1}^{m}mx_i\bigg) \quad (m\in {\mathbb{N}},\ m\geqq2).$$      

Approximation of Classes B p,θ r by Linear Methods and Best Approximations

We investigate problems related to the approximation by linear methods and the best approximations of the classes , 1 p in the space L .     

Error Estimates for Rayleigh–Ritz Approximations of Eigenvalues and Eigenfunctions of the Mathieu and Spheroidal Wave Equation

Error estimates are derived for the computation of eigenvalues and eigenvectors of infinite tridiagonal matrices by the Rayleigh–Ritz method. The results are applied to the Mathieu and spheroidal wave equation.     

Linear-Size Approximations to the Vietoris–Rips Filtration

The Vietoris–Rips filtration is a versatile tool in topological data analysis. It is a sequence of simplicial complexes built on a metric space to add topological structure to an otherwise disconnected set of points. It is widely used because it encodes useful information about the topology of the underlying metric space. This information is often extracted from its so-called persistence diagram. Unfortunately, this filtration is often too large to construct in full. We show how to construct an $O(n)$ O ( n ) -size filtered simplicial complex on an $n$ n -point metric space such that its persistence diagram is a good approximation to that of the Vietoris–Rips filtration. This new filtration can be constructed in $O(n\log n)$ O ( n log n ) time. The constant factors in both the size and the running time depend only on the doubling dimension of the metric space and the desired tightness of the approximation. For the first time, this makes it computationally tractable to approximate the persistence diagram of the Vietoris–Rips filtration across all scales for large data sets. We describe two different sparse filtrations. The first is a zigzag filtration that removes points as the scale increases. The second is a (non-zigzag) filtration that yields the same persistence diagram. Both methods are based on a hierarchical net-tree and yield the same guarantees.     

Trigonometric Widths and Best N-Term Approximations of the Generalized Periodic Besov Classes BΩp,θ

In this paper,we determine the estimates exact in order for the trigonometric widths and the best n-term trigonometric approximations of the generalized classes of periodic functions BΩp,θ in the space Lq for some values of parameters p,q.     

On Best Approximations from RS-sets in Complex Banach Spaces

The concept of an RS-set in a complex Banach space is introduced and the problem of best approximation from an RS-set in a complex space is investigated. Results consisting of characterizations, uniqueness and strong uniqueness are established,     

Convergence of Newton–Kantorovich Approximations to an Approximate Zero

In this paper, we prove an a posteriori and an a priori convergence theorem for Newton–Kantorovich approximations starting from an initial point x ₀. We apply these results to operators that are analytic at interior points of a closed ball centered at x ₀ and of radius R. We obtain some theorems on approximate zeros and on approximate zeros of second kind for these operators, which improve previous results.     

Regularity of Tensor Product Approximations to?Square Integrable Functions

We investigate first-order conditions for canonical and optimal subspace (Tucker format) tensor product approximations to square integrable functions. They reveal that the best approximation and all of its factors have the same smoothness as the approximated function itself. This is not obvious, since the approximation is performed in L ².     

Pseudo-spectral Approximations for a Class of the Kdv-Burgers Type Equation

In this paper, the pseudo-spectral approximations for a class of the Kdv-Burgers type equation is presented. Convergence and stability of the approximation have been proved by Sobolev‘s inequalities and the bounded extensive method of the nonlinear function. Finally, the numerical examples are proposed.     

Approximations for Solutions of Lévy-Type Stochastic Differential Equations

Abstract

The problem of the construction of strong approximations with a given order of convergence for jump-diffusion equations is studied. General approximation schemes are constructed for Lévy-type stochastic differential equation. In particular, the article generalizes the results from [2 Gardoń , A. 2004 . The order of approximations for solutions of Ito-type stochastic differential equations with jumps . Stoch. Anal. Appl. 22 ( 3 ): 679 – 699 .[Taylor & Francis Online], [Web of Science ®] , [Google Scholar], 5 Kloeden , P.E. , and Platen , E. 1995 . Numerical Solutions of Stochastic Differential Equations . Springer-Verlag , Berlin . [Google Scholar]]. The Euler and the Milstein schemes are shown for finite and infinite Lévy measure.     

Padé–Jacobi Filtering for Spectral Approximations of Discontinuous Solutions

Spectral type methods for the discretization of partial differential equations rely on the approximation of the solution by polynomials of high degree. These methods are proven, both theoretically and numerically, to be of infinite order of accuracy. This infinite order is achieved if the solution is very regular. On the other hand, the Gibbs phenomenon prevents – a priori – the good convergence if the solution is discontinuous. Nevertheless, for systems of conservation laws, the spectral vanishing viscosity method leads to numerical solutions that are spectrally close to the projection of the exact solution on the set of polynomials. The idea is then to postprocess the numerical solution in order to extract pertinent physical information. The aim of this paper is to propose and analyse such a postprocessing method based on rational approximants that allows to circumvent the Gibbs phenomenon and can be used as an acceleration device for spectral numerical solution.     

Type II Hermite�CPad�� Approximations of Generalized Hypergeometric Series

We shall present short proofs for type II (simultaneous) Hermite–Padé approximations of the generalized hypergeometric and q-hypergeometric series

Trigonometric Widths and Best N-Term Approximations of the Generalized Periodic Besov Classes B_(p,θ)~Ω

In this paper,we determine the estimates exact in order for the trigonometric widths and the best n-term trigonometric approximations of the generalized classes of periodic functions B(p,θ)Ω in the space Lq for some values of parameters p,q.     

Distributions of Poles to Painlevé Transcendents via Padé Approximations

A version of the Fair–Luke algorithm has been used to find the Padé approximate solutions to the Painlevé I, II, and IV equations. The distributions of poles in the complex plane are studied to check the dynamics of movable poles and the emergence of rational and truncated solutions, as well as various patterns formed by the poles. The high-order approximations allow us to check asymptotic expansions at infinity and estimate the range of asymptotic domains. The Coulomb gas interpretation of the pole ensembles is discussed in view of the patterns arising in Painlevé IV transcendents.