Piecewise affine functions and polyhedral sets ∗

In this paper we present a number of characterizations of piecewise affine and piecewise linear functions defined on finite dimesional normed vector spaces. In particular we prove that a real-valued function is piecewise affine [resp. piecewise linear] if both its epigraph and its hypograph are (nonconvex) polyhedral sets[resp..Polyhedral cones]. Also,We show that the collection of all piecewise affine[resp.piecewise linear] functions. Furthermore, we prove that a function is piecewise affine[resp.piecewise linear] if it can be represented as a difference of two convex [resp.,sublinear] polyhedral fucntions.     

Orthonormal bases associated with multi-knot piecewise linear function sequences on [0, 1)<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

We investigate two classes of orthonormal bases for L^2（[0, 1）^n）. The exponential parts of those bases are multi-knot piecewise linear functions which are called spectral sequences. We characterize the multi-knot piecewise linear spectral sequences and give an application of the first class of piecewise linear spectral sequences.     

Expansion over a system of shifts of pyramidal functions with a square base

A method for approximation of functions of two variables by a linear combination of non-negative piecewise linear functions with a compact support is presented. Two quadratic pyramids are used as generating functions for the system of shifts. The accuracy of this local method is proved to have the same order as the best approximation by piecewise linear functions.     

Suppressing grazing chaos in impacting system by structural nonlinearity

In this note we investigate the influence of structural nonlinearity of a simple cantilever beam impacting system on its dynamic responses close to grazing incidence by a means of numerical simulation. To obtain a clear picture of this effect we considered two systems exhibiting impacting motion, where the primary stiffness is either linear (piecewise linear system) or nonlinear (piecewise nonlinear system). Two systems were studied by constructing bifurcation diagrams, basins of attractions, Lyapunov exponents and parameter plots. In our analysis we focused on the grazing transitions from no impact to impact motion. We observed that the dynamic responses of these two similar systems are qualitatively different around the grazing transitions. For the piecewise linear system, we identified on the parameter space a considerable region with chaotic behaviour, while for the piecewise nonlinear system we found just periodic attractors. We postulate that the structural nonlinearity of the cantilever impacting beam suppresses chaos near grazing.     

Expansion over a system of shifts of pyramidal functions

A method for approximation of functions of two variables by a linear combination of nonnegative piecewise linear functions with a compact support is presented. The crucial idea of this method consists in an “integral” calculation method for the coefficients. The accuracy of the approximation in the spaces of continuous and integrable functions is proved to have the same order as the best approximation by piecewise linear functions.     

A Petrov－Galerkin Method with Linear Trial and Quadratic Test Spaces for Parabolic Convection－Diffusion Problems

ＡＰｅｔｒｏｖ－ＧａｌｅｒｋｉｎＭｅｔｈｏｄｗｉｔｈＬｉｎｅａｒＴｒｉａｌａｎｄＱｕａｄｒａｔｉｃＴｅｓｔＳｐａｃｅｓｆｏｒＰａｒａｂｏｌｉｃＣｏｎｖｅｃｔｉｏｎ－ＤｉｆｆｕｓｉｏｎＰｒｏｂｌｅｍｓＺｏｕＹｏｎｇｋｕｉ（邹永魁）；ＷｕＷｅｉ（吴微）；...     

Piecewise linear finite element methods are not localized

Recent results of Schatz show that standard Galerkin finite element methods employing piecewise polynomial elements of degree two and higher to approximate solutions to elliptic boundary value problems are localized in the sense that the global dependence of pointwise errors is of higher order than the overall order of the error. These results do not indicate that such localization occurs when piecewise linear elements are used. We show via simple one-dimensional examples that Schatz's estimates are sharp in that localization indeed does not occur when piecewise linear elements are used.

     

Estimation of the Bezout number for piecewise algebraic curve

A piecewise algebraic curve is a curve determined by the zero set of a bivariate spline function.In this paper.a coniecture on trianguation is confirmed The relation between the piecewise linear algebraiccurve and four-color conjecture is also presented.By Morgan-Scott triangulation, we will show the instabilityof Bezout number of piecewise algebraic curves. By using the combinatorial optimization method,an upper     

Defect correction from a Galerkin viewpoint

Summary We consider the numerical solution of systems of nonlinear two point boundary value problems by Galerkin's method. An initial solution is computed with piecewise linear approximating functions and this is then improved by using higher-order piecewise polynomials to compute defect corrections. This technique, including numerical integration, is justified by typical Galerkin arguments and properties of piecewise polynomials rather than the traditional asymptotic error expansions of finite difference methods.     

Filtrage linéaire par morceaux avec petit bruit d'observation

We consider a piecewise linear filtering problem with small observation noise. In two different situations we construct an approximate finite-dimensional filter based on several Kalman-Bucy filters running in parallel and a procedure of tests. In the first case our work generalizes some results of Fleminget al. to more general piecewise linear dynamics.

     

A GENERATOR AND A SIMPLEX SOLVER FOR NETWORK PIECEWISE LINEAR PROGRAMS

ＡＧＥＮＥＲＡＴＯＲＡＮＤＡＳＩＭＰＬＥＸＳＯＬＶＥＲＦＯＲＮＥＴＷＯＲＫＰＩＥＣＥＷＩＳＥＬＩＮＥＡＲＰＲＯＧＲＡＭＳＳＵＮＪＩＥ（孙捷）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍｅｍａｔｉｃｓ，ｔｈｅＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉ...     

A simplex algorithm for piecewise-linear fractional programming problems

Generalizations of the well-known simplex method for linear programming are available to solve the piecewise linear programming problem and the linear fractional programming problem. In this paper we consider a further generalization of the simplex method to solve piecewise linear fractional programming problems unifying the simplex method for linear programs, piecewise linear programs, and the linear fractional programs. Computational results are presented to obtain further insights into the behavior of the algorithm on random test problems.     

Modified piecewise linear DEA model

Recently, Cook and Zhu have proposed the Piecewise Linear Data Envelopment Analysis (PL-DEA) model, a situation in which a generalization of the DEA methodology which incorporates piecewise linear functions of factors is considered. Standard DEA models provide an efficiency score and targets for an inefficient unit, but the PL-DEA model fails to produce acceptable targets. Thus, this issue has been considered in the piecewise linear CCR model, in which a non-increasing set of multipliers describe the weight function. Also, the piecewise linear CCR model has been enhanced by introducing two MIP models for a two-stage procedure in order to set targets precisely. Furthermore as it follows, the above-mentioned models are compared with each other and an example is provided for the sake of lucidity.     

离散系统Lyapunov第二方法的一些问题

本文讨论线性时不变离散系统Lyapunov方程解集的几何性质以及分段线性离散系统的稳定性,得出每个子系统都是稳定的分段线性离散系统渐近稳定的一些充分条件,并把这些结果应用于二阶分段线性系统.     

二维热传导型半导体器件的特征有限体积元方法和H1模分析

将特征线方法与有限体积元方法相结合,采用分片线性函数和分片常数函数分别作为有限体积元方法的试探函数和检验函数空间,构造了热传导型半导体器件的全离散特征有限体积元格式.并进行收敛性分析,在一般的条件下得到了最优阶H1模误差估计结果.     

Periodic orbits for perturbations of piecewise linear systems

We consider the existence of periodic orbits in a class of three-dimensional piecewise linear systems. Firstly, we describe the dynamical behavior of a non-generic piecewise linear system which has two equilibria and one two-dimensional invariant manifold foliated by periodic orbits. The aim of this work is to study the periodic orbits of the continuum that persist under a piecewise linear perturbation of the system. In order to analyze this situation, we build a real function of real variable whose zeros are related to the limit cycles that remain after the perturbation. By using this function, we state some results of existence and stability of limit cycles in the perturbed system, as well as results of bifurcations of limit cycles. The techniques presented are similar to the Melnikov theory for smooth systems and the method of averaging.     

A separable integer programming problem equivalent to its continual version

The separable integer programming problem with so called nested constraints is shown to be equivalent to its continual version obtained by piecewise linear continuation of the cost functions. A new approach to solution of the latter based on its successive reduction in size is suggested. When applied to the problem with piecewise linear convex functions it leads to two algorithms for its solution applicable also to the similar integer problem. These algorithms turn out more efficient than those obtained by dynamic programming approach.     

Solution of Complementarity Problems via Piecewise Linearization

My master thesis concerns the solution linear complementarity problems (LCP). The Lemke algorithm, the most commonly used algorithm for solving a LCP until this day, was compared with the piecewise Newton method (PLN algorithm). The piecewise Newton method is an algorithm to solve a piecewise linear system on the basis of damped Newton methods. The linear complementarity problem is formulated as a piecewise linear system for the applicability of the PLN algorithm. Then, different application examples will be presented, solved with the PLN algorithm. As a result of the findings (of my master thesis) it can be assumed that – under the condition of coherent orientation – the PLN-algorithm requires fewer iterations to solve a linear complementarity problem than the Lemke algorithm. The coherent orientation for piecewise linear problems corresponds for linear complementarity problems to the P-matrix-property. (© 2013 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Exact Penalty and Optimality Condition for Nonseparable Continuous Piecewise Linear Programming

Utilizing compact representations for continuous piecewise linear functions, this paper discusses some theoretical properties for nonseparable continuous piecewise linear programming. The existence of exact penalty for continuous piecewise linear programming is proved, which allows us to concentrate on unconstrained problems. For unconstrained problems, we give a sufficient and necessary local optimality condition, which is based on a model with universal representation capability and hence applicable to arbitrary continuous piecewise linear programming. From the gained optimality condition, an algorithm is proposed and evaluated by numerical experiments, where the theoretical properties are illustrated as well.     

Discretized Energy Minimization in a Wave Guuide with point Sources

An anti-noise problem on a finite time interval is solved by minimization of a quadratic functional on the Hilbert space of square integrable controls. To this end, the one-dimensional wave equation with point sources and pointwise reflecting boundary conditions is decomposed into a system for the two propagating components of waves. Wellposedness of this system is proved for a class of data that includes piecewise linear initial conditions and piecewise constant forcing functions. It is shown that for such data the optimal piecewise constant control is the solution of a sparse linear system. Methods for its computational treatment are presented as well as examples of their applicability. The convergence of discrete approximations to the general optimization problem is demonstrated by finite element methods.