A General Approach to Gibbs Phenomenon

Gibbs phenomenon occurs for most approximations based on standard orthogonal expansions, as well as for those based on integral operators. It also occurs in interpolations and other types of approximations. We consider a general approach to approximation based on delta sequences in an attempt to better understand the concept.     

A General Approach to Equivariant Biharmonic Maps

In this paper we describe a 1-dimensional variational approach to the analytical construction of equivariant biharmonic maps. Our goal is to provide a direct method which enables analysts to compute directly the analytical conditions which guarantee biharmonicity in the presence of suitable symmetries. In the second part of our work, we illustrate and discuss some examples. In particular, we obtain a 1-dimensional stability result, and also show that biharmonic maps do not satisfy the classical maximum principle proved by Sampson for harmonic maps.     

A General Approach to Robust Web Metering

We consider the problem of metering access to web sites. Many services, such as web advertising, have a need for accurate counts of the number of visits to a web site. We consider the robust approach to web metering by looking at techniques that provide secure proofs of visit. We refine a number of previous models for metering schemes and provide a general construction for secure and efficient schemes that meter the interaction of a web site with a targeted audience. We generalise a technique for determining the minimum information that clients in the web site audience need to secure in order to supply proofs of visit. We also show how our metering schemes can be made robust against corrupt clients who attempt to prevent web servers constructing legitimate proofs of visit.Communicated by : P. WildAMS Classification: 94A60     

A General Stochastic Calculus Approach to Insider Trading

The purpose of this paper is to present a general stochastic calculus approach to insider trading. We consider a market driven by a standard Brownian motion $B(t)$ on a filtered probability space $\displaystyle (\Omega,\F,\left\{\F\right\}_{t\geq 0},P)$ where the coefficients are adapted to a filtration ${\Bbb G}=\left\{\G_t\right\}_{0\leq t\leq T}$, with $\F_t\subset\G_t$ for all $t\in [0,T]$, $T>0$ being a fixed terminal time. By an {\it insider} in this market we mean a person who has access to a filtration (information) $\displaystyle{\Bbb H}=\left\{\H_t\right\}_{0\leq t\leq T}$ which is strictly bigger than the filtration $\displaystyle{\Bbb G}=\left\{\G_t\right\}_{0\leq t\leq T}$. In this context an insider strategy is represented by an $\H_t$-adapted process $\phi(t)$ and we interpret all anticipating integrals as the forward integral defined in [23] and [25]. We consider an optimal portfolio problem with general utility for an insider with access to a general information $\H_t \supset\G_t$ and show that if an optimal insider portfolio $\pi^*(t)$ of this problem exists, then $B(t)$ is an $\H_t$-semimartingale, i.e. the enlargement of filtration property holds. This is a converse of previously known results in this field. Moreover, if $\pi^*$ exists we obtain an explicit expression in terms of $\pi^*$ for the semimartingale decomposition of $B(t)$ with respect to $\H_t$. This is a generalization of results in [16], [20] and [2].     

A General Approach to the Physician Rostering Problem

This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (GA). The context is the physician rostering problem, whose instances can vary greatly and for which almost no general tool has been developed. It is hoped that the combination of the three techniques will lead to an algorithm that has sufficient flexibility to solve most instances with a small amount of customization. To achieve this goal we also introduce Generic constraints: these constraints are used to model several types of ergonomic constraints that are found amongst physician rostering problems.     

一类分部积分公式的一种证明

通过引入Lebesgue-Stieltjes测度,利用Fubini定理给出右连续增函数的分部积分公式的证明.     

A General Approach to Isolating Roots of a Bitstream Polynomial

We describe a new approach to isolate the roots (either real or complex) of a square-free polynomial F with real coefficients. It is assumed that each coefficient of F can be approximated to any specified error bound and refer to such coefficients as bitstream coefficients. The presented method is exact, complete and deterministic. Compared to previous approaches (Eigenwillig in Real root isolation for exact and approximate polynomials using Descartes’ rule of signs, PhD thesis, Universität des Saarlandes, 2008; Eigenwillig et al. in CASC, LNCS, 2005; Mehlhorn and Sagraloff in J. Symb. Comput. 46(1):70–90, 2011) we improve in two aspects. Firstly, our approach can be combined with any existing subdivision method for isolating the roots of a polynomial with rational coefficients. Secondly, the approximation demand on the coefficients and the bit complexity of our approach is considerably smaller. In particular, we can replace the worst-case quantity σ(F) by the average-case quantity \({\prod_{i=1}^n\sqrt[n] {\sigma_i}}\) , where σ _i denotes the minimal distance of the i -th root ξ _i of F to any other root of F, σ(F) := min _i σ _i , and n = deg F. For polynomials with integer coefficients, our method matches the best bounds known for existing practical algorithms that perform exact operations on the input coefficients.     

Using Quality Control Activities to Develop Scientific and Mathematical Literacy

The daily activities of business and industry provide many fascinating opportunities to study basic concepts of mathematics and science. These activities often lend themselves to an activity-based, manipulative-enhanced learning environment. This article focuses upon a quality control activity used in the manufacturing of camera film. It suggests how this activity can be adapted to science and mathematics classrooms, and discusses some basic concepts of scientific methodology, probability, and statistics.     

A General Approach to Obtain Series Solutions of Nonlinear Differential Equations

Based on homotopy, which is a basic concept in topology, a general analytic method (namely the homotopy analysis method) is proposed to obtain series solutions of nonlinear differential equations. Different from perturbation techniques, this approach is independent of small/large physical parameters. Besides, different from all previous analytic methods, it provides us with a simple way to adjust and control the convergence of solution series. Especially, it provides us with great freedom to replace a nonlinear differential equation of order n into an infinite number of linear differential equations of order k , where the order k is even unnecessary to be equal to the order n . In this paper, a nonlinear oscillation problem is used as example to describe the basic ideas of the homotopy analysis method. We illustrate that the second-order nonlinear oscillation equation can be replaced by an infinite number of (2κ)th-order linear differential equations, where κ≥ 1 can be any a positive integer. Then, the homotopy analysis method is further applied to solve a high-dimensional nonlinear differential equation with strong nonlinearity, i.e., the Gelfand equation. We illustrate that the second-order two or three-dimensional nonlinear Gelfand equation can be replaced by an infinite number of the fourth or sixth-order linear differential equations, respectively. In this way, it might be greatly simplified to solve some nonlinear problems, as illustrated in this paper. All of our series solutions agree well with numerical results. This paper illustrates that we might have much larger freedom and flexibility to solve nonlinear problems than we thought traditionally. It may keep us an open mind when solving nonlinear problems, and might bring forward some new and interesting mathematical problems to study.     

A New Approach to Source Conditions in Regularization with General Residual Term

This article addresses Tikhonov-like regularization methods with convex penalty functionals for solving nonlinear ill-posed operator equations formulated in Banach or, more general, topological spaces. We present an approach for proving convergence rates that combines advantages of approximate source conditions and variational inequalities. Precisely, our technique provides both a wide range of convergence rates and the capability to handle general and not necessarily convex residual terms as well as nonsmooth operators. Initially formulated for topological spaces, the approach is extensively discussed for Banach and Hilbert space situations, showing that it generalizes some well-known convergence rates results.     

A General Approach to Dyadic Periodic Interpolation Based on Discrete Sigma-Pi Orthogonality

Starting with some well known formulas of discrete sigma-pi orthogonality of bipolar vectors we introduce a quite general and easy strategy to obtain periodic interpolation schemes on dyadic grids including fast algorithms for explicit calculation. As special cases of our presented approach we mention dyadic trigonometric and Walsh-type interpolation.     

A General Approach to Convergence Properties of Some Methods for Nonsmooth Convex Optimization

Based on the notion of the ε -subgradient, we present a unified technique to establish convergence properties of several methods for nonsmooth convex minimization problems. Starting from the technical results, we obtain the global convergence of: (i) the variable metric proximal methods presented by Bonnans, Gilbert, Lemaréchal, and Sagastizábal, (ii) some algorithms proposed by Correa and Lemaréchal, and (iii) the proximal point algorithm given by Rockafellar. In particular, we prove that the Rockafellar—Todd phenomenon does not occur for each of the above mentioned methods. Moreover, we explore the convergence rate of {||x _k || } and {f(x _k ) } when {x _k } is unbounded and {f(x _k ) } is bounded for the non\-smooth minimization methods (i), (ii), and (iii). Accepted 15 October 1996