Improved customer choice predictions using ensemble methods

In this paper various ensemble learning methods from machine learning and statistics are considered and applied to the customer choice modeling problem. The application of ensemble learning usually improves the prediction quality of flexible models like decision trees and thus leads to improved predictions. We give experimental results for two real-life marketing datasets using decision trees, ensemble versions of decision trees and the logistic regression model, which is a standard approach for this problem. The ensemble models are found to improve upon individual decision trees and outperform logistic regression.     

Assessment of some iterative methods for non-symmetric linear systems arising in computational fluid dynamics

Various tests have been carried out in order to compare the performances of several methods used to solve the non-symmetric linear systems of equations arising from implicit discretizations of CFD problems, namely the scalar advection-diffusion equation and the compressible Euler equations. The iterative schemes under consideration belong to three families of algorithms: relaxation (Jacobi and Gauss-Seidel), gradient and Newton methods. Two gradient methods have been selected: a Krylov subspace iteration method (GMRES) and a non-symmetric extension of the conjugate gradient method (CGS). Finally, a quasi-Newton method has also been considered (Broyden). The aim of this paper is to provide indications of which appears to be the most adequate method according to the particular circumstances as well as to discuss the implementation aspects of each scheme.     

带W权Drazin逆的一种新算法

利用矩阵A的带W权Drazin逆的一个性质特征,对任意的矩阵A∈Cm×n,W∈Cn×m,建立了带W权的Drazin逆Ad,w的一种新的表示式,给出了具体的算法步骤,并且在文末给出了算例.     

Implementation of some higher-order convection schemes on non-uniform grids

A generalized formulation is applied to implement the quadratic upstream interpolation (QUICK) scheme, the second-order upwind (SOU) scheme and the second-order hybrid scheme (SHYBRID) on non-uniform grids. The implementation method is simple. The accuracy and efficiency of these higher-order schemes on non-uniform grids are assessed. Three well-known bench mark convection-diffusion problems and a fluid flow problem are revisited using non-uniform grids. These are: (1) transport of a scalar tracer by a uniform velocity field; (2) heat transport in a recirculating flow; (3) two-dimensional non-linear Burgers equations; and (4) a two-dimensional incompressible Navier-Stokes flow which is similar to the classical lid-driven cavity flow. The known exact solutions of the last three problems make it possible to thoroughly evaluate accuracies of various uniform and non-uniform grids. Higher accuracy is obtained for fewer grid points on non-uniform grids. The order of accuracy of the examined schemes is maintained for some tested problems if the distribution of non-uniform grid points is properly chosen.     

An algorithm for decomposing a polynomial system into normal ascending sets

We present an algorithm to decompose a polynomial system into a finite set of normal ascending sets such that the set of the zeros of the polynomial system is the union of the sets of the regular zeros of the normal ascending sets.If the polynomial system is zero dimensional,the set of the zeros of the polynomials is the union of the sets of the zeros of the normal ascending sets.     

一类拟线性大系统的稳定性

本文应用大系统的分解方法和一个推广的不等式,研究了一类拟线性大系统的稳定性问题,所得结果简洁、易于验证,且推导过程不复杂,最后给出了应用实例。     

Case of a Boltzmann gas leading to the Smoluchowski coagulation equation

A special model of a rarefied hard-sphere gas is considered. The hard-sphere particles undergo absolutely elastic collisions. It is assumed that particles can collide only if their nonzero velocities are orthogonal to each other. The model makes it possible to proceed from the Boltzmann equation to the Smoluchowski coagulation equation, where coagulation means that the kinetic energies of the colliding particles are added. A Monte Carlo scheme for simulation of the phenomenon is described, and the convergence of the simulation algorithm is proved. The convergence of numerical results to exact solutions of the Smoluchowski equation and to finite-difference solutions is tested.     

A Relaxation Scheme for Solving the Boltzmann Equation Based on the Chapman-Enskog Expansion

Abstract In [16] a visco-elastic relaxation system, called the relaxed Burnett system, was proposed by Jinand Slemrod as a moment approximation to the Boltzmann equation. The relaxed Burnett system is weaklyparabolic, has a linearly hyperbolic convection part, and is endowed with a generalized eotropy inequality. Itagrees with the solution of the Boltzmann equation up to the Burnett order via the Chapman-Enskog expansion. We develop a one-dimensional non-oscillatory numerical scheme based on the relaxed Burnett system forthe Boltzmann equation. We compare numerical results for stationary shocks based on this relaxation scheme,and those obtained by the DSMC (Direct Simulation Monte Carlo), by the Navier-Stokes equations and bythe extended thermodynamics with thirteen moments (the Grad equations). Our numerical experiments showthat the relaxed Burnett gives more accurate approximations to the shock profiles of the Boltzmann equationobtained by the DSMC, for a range of Mach numbers for hypersonic flows, th     

The Generalized West Decomposition of Operators and Other Compact Perturbation Problems

This paper introduces the concept of the generalized Riesz operators and the concept of the generalized West decomposition of a general operator which generalizes the definition of the West decomposition of Riesz operators, and proves that the following three statements are equivalent on a general Banach space： （a） Every generalized Riesz operator has the generalized West decomposition; （b） Every operator makes strong Stampfli theorem true; Every operator has Apostol＇s compact correction.     

Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank approximants. Properties of Gander methods are investigated in details. AMS subject classification (2000) 65F30, 15A18