Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions

We establish a near-cubic upper bound on the complexity of the space of line transversals of a collection of n balls in three dimensions, and show that the bound is almost tight, in the worst case. We apply this bound to obtain a near-cubic algorithm for computing a smallest infinite cylinder enclosing a given set of points or balls in 3-space. We also present an approximation algorithm for computing a smallest enclosing cylinder. Received May 23, 1997, and in revised form October 20, 1997.     

On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids

Given A?{a¹,…,a^m}⊂R^d whose affine hull is R^d, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum-volume enclosing ellipsoid of A. In the case of centrally symmetric sets, we first establish that Khachiyan's barycentric coordinate descent (BCD) method is exactly the polar of the deepest cut ellipsoid method using two-sided symmetric cuts. This observation gives further insight into the efficient implementation of the BCD method. We then propose a variant algorithm which computes an approximate rounding of the convex hull of A, and which can also be used to compute an approximation to the minimum-volume enclosing ellipsoid of A. Our algorithm is a modification of the algorithm of Kumar and Y?ld?r?m, which combines Khachiyan's BCD method with a simple initialization scheme to achieve a slightly improved polynomial complexity result, and which returns a small “core set.” We establish that our algorithm computes an approximate solution to the dual optimization formulation of the minimum-volume enclosing ellipsoid problem that satisfies a more complete set of approximate optimality conditions than either of the two previous algorithms. Furthermore, this added benefit is achieved without any increase in the improved asymptotic complexity bound of the algorithm of Kumar and Y?ld?r?m or any increase in the bound on the size of the computed core set. In addition, the “dropping idea” used in our algorithm has the potential of computing smaller core sets in practice. We also discuss several possible variants of this dropping technique.     

Complexity Analysis via Approach Spaces

Complexity of a recursive algorithm typically is related to the solution to a recurrence equation based on its recursive structure. For a broad class of recursive algorithms we model their complexity in what we call the complexity approach space, the space of all functions in X?=? ]0,?∞?] ^Y , where Y can be a more dimensional input space. The set X, which is a dcpo for the pointwise order, moreover carries the complexity approach structure. There is an associated selfmap Φ on the complexity approach space X such that the problem of solving the recurrence equation is reduced to finding a fixed point for Φ. We will prove a general fixed point theorem that relies on the presence of the limit operator of the complexity approach space X and on a given well founded relation on Y. Our fixed point theorem deals with monotone selfmaps Φ that need not be contractive. We formulate conditions describing a class of recursive algorithms that can be treated in this way.     

Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem

Consider the problem of computing a (1+?)-approximation to the minimum volume axis-aligned ellipsoid (MVAE) enclosing a set of m points in Rⁿ. We first provide an extension and improvement to algorithm proposed in Kumar and Y?ld?r?m (2008) [5] (the KY algorithm) for the MVAE problem. The main challenge of the MVAE problem is that there is no closed form solution in the line search step (beta). Therefore, the KY algorithm proposed a certain choice of beta that leads to their complexity and core set results in solving the MVAE problem. We further analyze the line search step to derive a new beta, relying on an analysis of up to the fourth order derivative. This choice of beta leads to the improved complexity and core set results. The second modification is given by incorporating “away steps” into the first one at each iteration, which obtains the same complexity and core set results as the first one. In addition, since the second modification uses the idea of “dropping points”, it has the potential to compute smaller core sets in practice. Some numerical results are given to show the efficiency of the modified algorithms.     

Solution of industrial CFD problems with structured Boltzmann approach

A new algorithm and acorresponding software package are developed that contain a fast tensor algorithm for the deterministic solution of the Boltzmann equation. The domain space discretisation performed with the Delaunay grid and the velocity space discretisation is performed with the tensor grid, and benefits with multilinear decomposition. This algorithm is also implemented for GPGPU processors, which allows to reach very high computational performance. The memory and complexity requirements are comparable with most Navier-Stockes solvers, however we solve the Boltzmann equation with chemical reactions. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Tropical differential equations

Tropical differential equations are introduced and an algorithm is designed which tests solvability of a system of tropical linear differential equations within the complexity polynomial in the size of the system and in the absolute values of its coefficients. Moreover, we show that there exists a minimal solution, and the algorithm constructs it (in case of solvability). This extends a similar complexity bound established for tropical linear systems. In case of tropical linear differential systems in one variable a polynomial complexity algorithm for testing its solvability is designed.We prove also that the problem of solvability of a system of tropical non-linear differential equations in one variable is NP-hard, and this problem for arbitrary number of variables belongs to NP. Similar to tropical algebraic equations, a tropical differential equation expresses the (necessary) condition on the dominant term in the issue of solvability of a differential equation in power series.     

A general method for enclosing solutions of interval linear equations

We describe a general method for enclosing the solution set of a system of interval linear equations. We present a general theorem and an algorithm in a MATLAB-style code.     

A cubic time algorithm for finding the principal solution to Sylvester matrix equations over (max, +)

We propose an algorithm for finding the so-called principal solution of the Sylvester matrix equation over max-plus algebra. The derivation of our algorithm is based on the concept of tropical tensor product introduced by Butkovi? and Fiedler. Our algorithm reduces the computational cost of finding the principal solution from quartic to cubic. It also reduces the space complexity from quartic to quadratic. Since matrix–matrix multiplication is the most important ingredient of our proposed technique, we show how to use column-oriented matrix multiplications in order to speed-up MATLAB implementation of our algorithm. Finally, we illustrate our results and discuss the connection with the residuation theory.     

A modified method for constructing efficient solutions structure of MOLP

This paper deals with a recently proposed algorithm for obtaining all weak efficient and efficient solutions in a multi objective linear programming (MOLP) problem. The algorithm is based on solving some weighted sum problems, and presents an easy and clear solution structure. We first present an example to show that the algorithm may fail when at least one of these weighted sum problems has not a finite optimal solution. Then, the algorithm is modified to overcome this problem. The modified algorithm determines whether an efficient solution exists for a given MOLP and generates the solution set correctly (if exists) without any change in the complexity.     

逆热传导方程的一个正则化方法

考虑了标准的一维逆热传导方程.问题是不适定的,即解不连续地依赖于数据.通过Fourier逼近的方法进行正则化处理,提出了一个新的算法,理论分析和数值实验均表明该算法是稳定的;该算法不仅保留了测量数据的部分高频成份,同时还具有相同的精度和计算复杂性.     

美式看跌期权定价中的小波方法

本文采用有限差分格式和 Daubechies正交小波 ,提出了一种求解 Black- Scholes方程数值解新算法 .为美式看跌期定价提供了一条新的途径 .利用小波基的自适应性和消失矩特性 ,使偏微分算子矩阵和小波级数稀疏化 ,大大减少了计算量 .     

A predictor-corrector algorithm for linear optimization based on a modified Newton direction

We present a predictor-corrector algorithm for linear optimization based on a modified Newton direction. In each main iteration, the algorithm operates two kinds of steps: a modified Newton step and a damped predictor step. The modified Newton step is generated from an equivalent reformulation of the centering equation from the system, which defines the central path, and move in the direction of a small neighborhood of the central path. While the damped predictor step is used to move in the direction of optimal solution and reduce the duality gap. The procedure is repeated until an ?-approximate solution is found. We derive the complexity for the algorithm, and obtain the best-known result for linear optimization.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

A method for globally minimizing concave functions over convex sets

A method is described for globally minimizing concave functions over convex sets whose defining constraints may be nonlinear. The algorithm generates linear programs whose solutions minimize the convex envelope of the original function over successively tighter polytopes enclosing the feasible region. The algorithm does not involve cuts of the feasible region, requires only simplex pivot operations and univariate search computations to be performed, allows the objective function to be lower semicontinuous and nonseparable, and is guaranteed to converge to the global solution. Computational aspects of the algorithm are discussed.     

匹配问题实例空间和解空间结构

本文通过研究匹配问题的实例空间，匈牙利算法和解空间三者之间的关系，指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的，而如何对问题的解空间进行合理的分解才能是问题的关键。     

A new bound on Hrushovski’s algorithm for computing the Galois group of a linear differential equation

The complexity of computing the Galois group of a linear differential equation is of general interest. In a recent work, Feng gave the first degree bound on Hrushovski’s algorithm for computing the Galois group of a linear differential equation. This bound is the degree bound of the polynomials used in the first step of the algorithm for finding a proto-Galois group (see Definition 2.7) and is sextuply exponential in the order of the differential equation. In this paper, we use Szántó’s algorithm of triangular representation for algebraic sets to analyze the complexity of computing the Galois group of a linear differential equation and we give a new bound which is triple exponential in the order of the given differential equation.     

Adaptive-Additive Multilevel Methods for Hypersingular Integral Equation

In this article we present the combined adaptive-additive multilevel methods for the Galerkin approximation of hypersingular integral equation on the interval o = ( m 1,1). We also derive an efficient and reliable a posteriori error estimate for the error between the exact solution u and the approximated multilevel solution $ \tilde u_ {\cal M} $ , measuring locally the quality of $ \tilde u_ {\cal M} $ . The algorithm is carefully designed to obtain minimal complexity. A limitation of our analysis approach is that the meshes must be assumed to be quasi-uniform.     

Minimal enclosing parallelepiped in 3D

We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n three-dimensional points. We give two mathematical properties of these parallelepipeds, from which we derive two algorithms of theoretical complexity O(n⁶). Experiments show that in practice our quickest algorithm runs in O(n²) (at least for n10⁵). We also present our application in structural biology.     

Painlev\'{e} Analysis and Auto-B\"{a}cklund Transformation for a General Variable Coefficient Burgers Equation with Linear Damping Term

This paper investigates a general variable coefficient (gVC) Burgers equation with linear damping term. We derive the Painlev\''{e} property of the equation under certain constraint condition of the coefficients. Then we obtain an auto-B\"{a}cklund transformation of this equation in terms of the Painlev\''{e} property. Finally, we find a large number of new explicit exact solutions of the equation. Especially, infinite explicit exact singular wave solutions are obtained for the first time. It is worth noting that these singular wave solutions will blow up on some lines or curves in the $(x,t)$ plane. These facts reflect the complexity of the structure of the solution of the gVC Burgers equation with linear damping term. It also reflects the complexity of nonlinear wave propagation in fluid from one aspect.     

Fitting enclosing cylinders to data in R n

A simple iterative algorithm is given for finding a stationary point of the (non-convex) problem of finding the smallest enclosing (n–d)-cylinder to discrete data in R ⁿ , that is a cylinder whose axis is a d-dimensional linear manifold. An important special case is the problem of finding the smallest enclosing (usual) cylinder, when n=3 and d=1. The method is based on the solution of a sequence of second order cone programming problems, which can be efficiently solved by interior point methods and for which good software packages are available.