A review of minitab -- release 11.
A self-consistent numerical method for simulation of quantum transport in high electron mobility transistor. I: The Boltzmann-Poisson-Schrödinger solver.
A self-consistent numerical method for simulation of quantum transport in high electron mobility transistor. II: The full quantum transport.
A spring-dashpot system for modelling lung tumour motion in radiotherapy.
A stability analysis for finite volume schemes applied to the Maxwell system
We present in this paper a stability study concerning finite volume schemes applied to the two-dimensional Maxwell system, using rectangular or triangular meshes. A stability condition is proved for the first-order upwind scheme on a rectangular mesh. Stability comparisons between the Yee scheme and the finite volume formulation are proposed. We also compare the stability domains obtained when considering the Maxwell system and the convection equation.
A statistical variance components framework for mapping imprinted quantitative trait locus in experimental crosses.
A stochastic phase-field model determined from molecular dynamics
The dynamics of dendritic growth of a crystal in an undercooled melt is determined by macroscopic diffusion-convection of heat and by capillary forces acting on the nanometer scale of the solid-liquid interface width. Its modelling is useful for instance in processing techniques based on casting. The phase-field method is widely used to study evolution of such microstructural phase transformations on a continuum level; it couples the energy equation to a phenomenological Allen-Cahn/Ginzburg-Landau equation...
A stochastic scheme of approximation for ordinary differential equations.
A survey on models for panel count data with applications to insurance.
A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems
In this paper, we propose a method for the approximation of the solution of high-dimensional weakly coercive problems formulated in tensor spaces using low-rank approximation formats. The method can be seen as a perturbation of a minimal residual method with a measure of the residual corresponding to the error in a specified solution norm. The residual norm can be designed such that the resulting low-rank approximations are optimal with respect to particular norms of interest, thus allowing to take...
A weighted empirical interpolation method: a priori convergence analysis and applications
We extend the classical empirical interpolation method [M. Barrault, Y. Maday, N.C. Nguyen and A.T. Patera, An empirical interpolation method: application to efficient reduced-basis discretization of partial differential equations. Compt. Rend. Math. Anal. Num. 339 (2004) 667–672] to a weighted empirical interpolation method in order to approximate nonlinear parametric functions with weighted parameters, e.g. random variables obeying various probability distributions. A priori convergence analysis...
Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints
The problem of estimating the probability is considered when represents a multivariate stochastic input of a monotonic function . First, a heuristic method to bound , originally proposed by de Rocquigny (2009), is formally described, involving a specialized design of numerical experiments. Then a statistical estimation of is considered based on a sequential stochastic exploration of the input space. A maximum likelihood estimator of build from successive dependent Bernoulli data is defined...
Accurate calculations of Stationary Distributions and Mean First Passage Times in Markov Renewal Processes and Markov Chains
This article describes an accurate procedure for computing the mean first passage times of a finite irreducible Markov chain and a Markov renewal process. The method is a refinement to the Kohlas, Zeit fur Oper Res, 30, 197–207, (1986) procedure. The technique is numerically stable in that it doesn’t involve subtractions. Algebraic expressions for the special cases of one, two, three and four states are derived.Aconsequence of the procedure is that the stationary distribution of the embedded Markov...
Accurate Test Limits Under Nonnormal Measurement Error.
Adaptive algorithm for stochastic Galerkin method
We introduce a new tool for obtaining efficient a posteriori estimates of errors of approximate solutions of differential equations the data of which depend linearly on random parameters. The solution method is the stochastic Galerkin method. Polynomial chaos expansion of the solution is considered and the approximation spaces are tensor products of univariate polynomials in random variables and of finite element basis functions. We derive a uniform upper bound to the strengthened Cauchy-Bunyakowski-Schwarz...
Adaptive Dantzig density estimation
The aim of this paper is to build an estimate of an unknown density as a linear combination of functions of a dictionary. Inspired by Candès and Tao’s approach, we propose a minimization of the ℓ1-norm of the coefficients in the linear combination under an adaptive Dantzig constraint coming from sharp concentration inequalities. This allows to consider a wide class of dictionaries. Under local or global structure assumptions, oracle inequalities are derived. These theoretical results are transposed...
Adaptive density estimation under weak dependence
Assume that (Xt)t∈Z is a real valued time series admitting a common marginal density f with respect to Lebesgue's measure. [Donoho et al. Ann. Stat.24 (1996) 508–539] propose near-minimax estimators based on thresholding wavelets to estimate f on a compact set in an independent and identically distributed setting. The aim of the present work is to extend these results to general weak dependent contexts. Weak dependence assumptions are expressed as decreasing bounds of covariance terms and are...
Adaptive hard-thresholding for linear inverse problems
A number of regularization methods for discrete inverse problems consist in considering weighted versions of the usual least square solution. These filter methods are generally restricted to monotonic transformations, e.g. the Tikhonov regularization or the spectral cut-off. However, in several cases, non-monotonic sequences of filters may appear more appropriate. In this paper, we study a hard-thresholding regularization method that extends the spectral cut-off procedure to non-monotonic sequences....
Adaptive rank tests
Adaptive tests of homogeneity for a Poisson process
We propose to test the homogeneity of a Poisson process observed on a finite interval. In this framework, we first provide lower bounds for the uniform separation rates in -norm over classical Besov bodies and weak Besov bodies. Surprisingly, the obtained lower bounds over weak Besov bodies coincide with the minimax estimation rates over such classes. Then we construct non-asymptotic and non-parametric testing procedures that are adaptive in the sense that they achieve, up to a possible logarithmic...