Cyclic reduction and FACR methods for piecewise hermite bicubic orthogonal spline collocation

Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N ²log₂ N) andO(N ²log₂log₂ N) arithmetic operations, respectively.     

The method of concentrating a substance from a solution in a stationary sorbent layer and its theoretical basis

The principle of concentrating a substance from a mixture flow in a stationary sorbent layer of infinite length that was previously developed for gas chromatography is extended to liquid chromatography. Translated fromIzevestiya Akademii Nauk. Seriya Khimicheskaya, No. 5, pp. 1063–1065, May, 1997.     

Derived Brackets

We survey the many instances of derived bracket construction in differential geometry, Lie algebroid and Courant algebroid theories, and their properties. We recall and compare the constructions of Buttin and of Vinogradov, and we prove that the Vinogradov bracket is the skew-symmetrization of a derived bracket. Odd (resp., even) Poisson brackets on supermanifolds are derived brackets of canonical even (resp., odd) Poisson brackets on their cotangent bundle (resp., parity-reversed cotangent bundle). Lie algebras have analogous properties, and the theory of Lie algebroids unifies the results valid for manifolds on the one hand, and for Lie algebras on the other. We outline the role of derived brackets in the theory of Poisson structures with background'.     

A convection/reaction/switching system

We consider a spatially distributed hybrid system consisting of a convection/reaction system in which the reaction switches discontinuously in time between modes, independently at each spatial point on reaching “switching thresholds”. The model involves a novel formulation for evolution of the free boundary between the modal regions.     

Some Recent Progress and Applications in Graph Minor Theory

In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the ``rough' structure of graphs excluding a fixed minor. This result was used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered under the graph minor relation. Recently, a number of beautiful results that use this structural result have appeared. Some of these along with some other recent advances on graph minors are surveyed. Research partly supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research, Grant number 16740044, by Sumitomo Foundation, by C & C Foundation and by Inoue Research Award for Young Scientists Supported in part by the Research Grant P1–0297 and by the CRC program On leave from: IMFM & FMF, Department of Mathematics, University of Ljubljana, Ljubljana, Slovenia     

Problems, Models and Complexity. Part II: Application to the DLSP

In Part I of this study, we suggest to identify an operations research (OR) problem with the equivalence class of models describing the problem and enhance the standard computer-science theory of computational complexity to be applicable to this situation of an often model-based OR context. The Discrete Lot-sizing and Scheduling Problem (DLSP) is analysed here in detail to demonstrate the difficulties which can arise if these aspects are neglected and to illustrate the new theoretical concept. In addition, a new minimal model is introduced for the DLSP which makes this problem eventually amenable to a rigorous analysis of its computational complexity.     

Bivariate Free Knot Splines

We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature.     

Some remarks on the Jensen-Hadamard inequalities and applications

We provide some inequalities and integral inequalities connected to the Jensen-Hadamard inequalities for convex functions. In particular, we give some refinements to these inequalities. Some natural applications and further extensions are given.

---

Sunto Forniamo alcune diseguaglianze e diseguaglianze integrali connesse alle dise-gueglianze di Jensen-Hadamard per funzioni convesse. In particolare, diamo qualche miglioramento di queste diseguaglianze. Alcune applicazioni naturali ed ulteriori estensioni sono date.

     

2+1维SU(2)格点规范场胶球质量的七阶RPA近似

采用无规相近似(RPA)方法,用空心图作为试探波函数,利用Feymann?Hellman定理计算七阶2?+?1维SU(2?)格点规范场的胶球质量,在弱耦合区1/g2?=1.0?–?1.8胶球质量表现出良好的标度行为,基本趋于常数(m/e2?≈1.2?0±0?.0?1)?.