Multi-dimensional scalar balance laws with discontinuous flux

We consider scalar balance laws with a dissipative source term. The flux function may be discontinuous with respect to both the space variable x and the unknown quantity u. We formulate the definition of entropy weak solutions and provide existence and uniqueness to the considered problem. The problem is formulated in the framework of multi-valued mappings. The notion of entropy measure-valued solutions is used to prove the so-called contraction principle and comparison principle.     

A metric characterization of the irrationals via a group operation

Let S be a separable metric space with a compatible metric d that satisfies: For each point x ? S and each nonnegative real number r there exists a unique point y ? S such that d(x,y) = r.In this paper spaces that meet the above criterion are investigated. It is shown that, under the assumption of completeness, this metric property characterizes the space of irrationals.     

Radar ambiguity function inL p frame

In modern radar techniques, pulse signal can be replaced by the chirps, which is taken to be signals inL _p space. Wigner’s function and ambiguity functions are constructed in anL _p frame and a partial generalization of the uncertainty principle is given by means of the notion of coherent dual.     

On A-invariant mean and A-almost convergence

The idea of A-invariant mean and A-almost convergence is due to J. P. Duran [8], which is a generalization of the usual notion of Banach limit and almost convergence. In this paper, we discuss some important properties of this method and prove that the space F(A) of A-almost convergent sequences is a BK space with ?? · ??_??, and also show that it is a nonseparable closed subspace of the space l _?? of bounded sequences.     

Real dicompactifications of ditopological texture spaces

Real dicompactifications and dicompactifications of a ditopological texture space are defined and studied.Section 2 considers nearly plain extensions of a ditopological texture space (S,S,τ,κ). Spaces that possess a nearly plain extension are shown to have a property, called here almost plainness, that is weaker than that of near plainness, but which shares with near plainness the existence of an associated plain space (Sp,Sp,τp,κp). Some properties of the class of almost plain ditopological texture spaces are established, a notion of canonical nearly plain extension of an almost plain ditopological texture space, projective and injective pre-orderings and the concept of isomorphism on such canonical nearly plain extensions are defined.In Section 3 the notion of nearly plain extension is specialized to that of real dicompactification and dicompactification, and the spaces that have such extensions are characterized. Working in terms of a specific representation of the canonical real dicompactifications and dicompactifications of a completely biregular bi-T₂ almost plain ditopological space, the interrelation between sub-T-lattices of the T-lattice of ω-preserving bicontinuous real mappings on the associated plain space and the real dicompactifications and dicompactifications are investigated. In particular generalizations of the Hewitt realcompactification and Stone-?ech compactification are obtained, and shown to be reflectors for the appropriate categories.     

On a new notion of the solution to an ill-posed problem

A new understanding of the notion of the stable solution to ill-posed problems is proposed. The new notion is more realistic than the old one and better fits the practical computational needs. A method for constructing stable solutions in the new sense is proposed and justified. The basic point is: in the traditional definition of the stable solution to an ill-posed problem Au=f, where A is a linear or nonlinear operator in a Hilbert space H, it is assumed that the noisy data {f_δ,δ} are given, ‖f−f_δ‖≤δ, and a stable solution u_δ:=R_δf_δ is defined by the relation lim_δ→0‖R_δf_δ−y‖=0, where y solves the equation Au=f, i.e., Ay=f. In this definition y and f are unknown. Any f∈B(f_δ,δ) can be the exact data, where B(f_δ,δ):={f:‖f−f_δ‖≤δ}.The new notion of the stable solution excludes the unknown y and f from the definition of the solution. The solution is defined only in terms of the noisy data, noise level, and an a priori information about a compactum to which the solution belongs.     

Doubly quasi-consistent parallel explicit peer methods with built-in global error estimation

Recently, Kulikov presented the idea of double quasi-consistency, which facilitates global error estimation and control, considerably. More precisely, a local error control implemented in such methods plays a part of global error control at the same time. However, Kulikov studied only Nordsieck formulas and proved that there exists no doubly quasi-consistent scheme among those methods.Here, we prove that the class of doubly quasi-consistent formulas is not empty and present the first example of such sort. This scheme belongs to the family of superconvergent explicit two-step peer methods constructed by Weiner, Schmitt, Podhaisky and Jebens. We present a sample of s-stage doubly quasi-consistent parallel explicit peer methods of order s−1 when s=3. The notion of embedded formulas is utilized to evaluate efficiently the local error of the constructed doubly quasi-consistent peer method and, hence, its global error at the same time. Numerical examples of this paper confirm clearly that the usual local error control implemented in doubly quasi-consistent numerical integration techniques is capable of producing numerical solutions for user-supplied accuracy conditions in automatic mode.     

Generalized contraction mapping principles in probabilistic metric spaces

We give an improvement of Theorem 1 from [2] with a quite different approach, which enable us to prove that the fixed point is also globally attractive. In Theorem 2.11 a further generalization is obtained for a complete Menger space (S,F,T), where T belongs to a more general class of continuous t-norms than in the previous case where T=T _M (=min). Theorem 3.2 is a generalization of Theorem 2 from [2]. Thereafter the notion of a generalized C-contraction of Krasnoselski's type is introduced and a fixed point theorem for such mappings is proved. An application in the space S(Ω, K, P) is given.     

Error growth analysis via stability regions for discretizations of initial value problems

This paper deals with numerical methods for the solution of linear initial value problems. Two main theorems are presented on the stability of these methods. Both theorems give conditions guaranteeing a mild error growth, for one-step methods characterized by a rational function ϕ(z). The conditions are related to the stability regionS={z:z∈ℂ with |ϕ(z)|≤1}, and can be viewed as variants to the resolvent condition occurring in the reputed Kreiss matrix theorem. Stability estimates are presented in terms of the number of time stepsn and the dimensions of the space. The first theorem gives a stability estimate which implies that errors in the numerical process cannot grow faster than linearly withs orn. It improves previous results in the literature where various restrictions were imposed onS and ϕ(z), including ϕ′(z)≠0 forz∈σS andS be bounded. The new theorem is not subject to any of these restrictions. The second theorem gives a sharper stability result under additional assumptions regarding the differential equation. This result implies that errors cannot grow faster thann ^β, with fixed β<1. The theory is illustrated in the numerical solution of an initial-boundary value problem for a partial differential equation, where the error growth is measured in the maximum norm.     

On character amenability of semigroup algebras

Let S be a foundation locally compact topological semigroup, and let M _a (S) be the space of all measures μ∈M(S) for which the maps x?|μ|?δ _x and x?|μ|?δ _x from S into M(S) are weakly continuous. The purpose of this article is to develop a notion of character amenability for semigroup algebras. The main results concern the χ-amenability of M _a (S). We give necessary and sufficient conditions for the existence of a left χ-mean on M _a (S)^?.     

Random matrices and subexponential operator spaces

We introduce and study a generalization of the notion of exact operator space that we call subexponential. Using Random Matrices we show that the factorization results of Grothendieck type that are known in the exact case all extend to the subexponential case, but we exhibit (a continuum of distinct) examples of non-exact subexponential operator spaces, as well as a C*-algebra that is subexponential with constant 1 but not exact. We also show that OH, R + C and max(?₂) (or any other maximal operator space) are not subexponential.     

On the h-triangles of sequentially (S r ) simplicial complexes via algebraic shifting

Recently, Haghighi, Terai, Yassemi, and Zaare-Nahandi introduced the notion of a sequentially (S _r ) simplicial complex. This notion gives a generalization of two properties for simplicial complexes: being sequentially Cohen–Macaulay and satisfying Serre’s condition (S _r ). Let Δ be a (d?1)-dimensional simplicial complex with Γ(Δ) as its algebraic shifting. Also let (h _i,j (Δ))_{0≤j≤i≤d} be the h-triangle of Δ and (h _i,j (Γ(Δ)))_{0≤j≤i≤d} be the h-triangle of Γ(Δ). In this paper, it is shown that for a Δ being sequentially (S _r ) and for every i and j with 0≤j≤i≤r?1, the equality h _i,j (Δ)=h _i,j (Γ(Δ)) holds true.     

Target set reachability criteria for dynamical systems described by inaccurate models

S is taken to be a dynamical system (described by Banach space operators) whose outputy we wish to regulate. The structural complexity ofS (nonlinearities, distributed parameters, etc.) forces us to design a controller forS using an approximate modelM ofS. A convex error bound ? describes the accuracy of the approximation ofS byM. For a prescribed target setY _t , we considered the problem of driving the output ofS toY _t subject to worst possible error excursions betweenM andS. The notion of areconstructed support function is instrumental to the derivation of the main result, Theorem 6.1, which we can paraphrase as follows. IfM is linear (S need not be), then we can describe a finite-dimensional convex programming Problem (P), whose solution tells us whether or notY _t is reachable. Theorem 6.1 is then specialized to differential systems approximated in the norm. The computation of numerical solutions is also discussed.     

A 0-stable linear multistep formulas of theα-type

The-type linear multistep formulas are a generalization of the Adams-type formulas. This paper is concerned with completely characterizing theA ₀-stability of thek-step, orderk -type formulas. Specifically, all such formulas of orders 4 or less are identified and it is shown that no-type formulas of order 5 or more exist. These theorems generalize some previous results.     

The method of external excitation for solving generalized Sturm-Liouville problems

A new numerical technique for solving the generalized Sturm-Liouville problem , b_l[w(0),λ]=b_r[w(1),λ]=0 is presented. In particular, we consider the problems when the coefficient q(x,λ) or the boundary conditions depend on the spectral parameter λ in an arbitrary nonlinear manner. The method presented is based on mathematically modelling the physical response of a system to excitation over a range of frequencies. The response amplitudes are then used to determine the eigenvalues.The results of the numerical experiments justifying the method are presented.     

Solving polynomial optimization problems via the truncated tangency variety and sums of squares

Let f,g_i,i=1,…,l,h_j,j=1,…,m, be polynomials on Rⁿ and S?{x∈Rⁿ∣g_i(x)=0,i=1,…,l,h_j(x)≥0,j=1,…,m}. This paper proposes a method for finding the global infimum of the polynomial f on the semialgebraic set S via sum of squares relaxation over its truncated tangency variety, even in the case where the polynomial f does not attain its infimum on S. Under a constraint qualification condition, it is demonstrated that: (i) The infimum of f on S and on its truncated tangency variety coincide; and (ii) A sums of squares certificate for nonnegativity of f on its truncated tangency variety. These facts imply that we can find a natural sequence of semidefinite programs whose optimal values converge, monotonically increasing to the infimum of f on S.     

Spacelike surfaces in anti de Sitter four-space from a contact viewpoint

We define the notions of (S _t ¹ × S _s ²)-nullcone Legendrian Gauss maps and S ₊²-nullcone Lagrangian Gauss maps on spacelike surfaces in anti de Sitter 4-space. We investigate the relationships between singularities of these maps and geometric properties of surfaces as an application of the theory of Legendrian/Lagrangian singularities. By using S ₊²-nullcone Lagrangian Gauss maps, we define the notion of S ₊²-nullcone Gauss-Kronecker curvatures and show a Gauss-Bonnet type theorem as a global property. We also introduce the notion of horospherical Gauss maps which have geometric properties different from those of the above Gauss maps. As a consequence, we can say that anti de Sitter space has much richer geometric properties than the other space forms such as Euclidean space, hyperbolic space, Lorentz-Minkowski space and de Sitter space.     

Reflexivity defect of spaces of linear operators

For a finite-dimensional linear subspace S⊆L(V,W) and a positive integer k, the k-reflexivity defect of S is defined by rd_k(S)=dim(Ref_k(S)/S), where Ref_k(S) is the k-reflexive closure of S. We study this quantity for two-dimensional spaces of operators and for single generated algebras and their commutants.