High-order methods for semilinear singularly perturbed boundary value problems.
High-order WENO scheme for polymerization-type equations*
Polymerization of proteins is a biochemical process involved in different diseases. Mathematically, it is generally modeled by aggregation-fragmentation-type equations. In this paper we consider a general polymerization model and propose a high-order numerical scheme to investigate the behavior of the solution. An important property of the equation is the mass conservation. The WENO scheme is built to preserve the total mass of proteins along time....
Holt-Winters method with general seasonality
The paper suggests a generalization of widely used Holt-Winters smoothing and forecasting method for seasonal time series. The general concept of seasonality modeling is introduced both for the additive and multiplicative case. Several special cases are discussed, including a linear interpolation of seasonal indices and a usage of trigonometric functions. Both methods are fully applicable for time series with irregularly observed data (just the special case of missing observations was covered up...
Homogeneous Jacobi-Davidson.
Homogenization and correctors for nonlinear elliptic equations
Homogenization for variational and quasi-variational inequalities
Homogenization of differential operators
Homogenization of the criticality spectral equation in neutron transport
Homogenization of the criticality spectral equation in neutron transport
We address the homogenization of an eigenvalue problem for the neutron transport equation in a periodic heterogeneous domain, modeling the criticality study of nuclear reactor cores. We prove that the neutron flux, corresponding to the first and unique positive eigenvector, can be factorized in the product of two terms, up to a remainder which goes strongly to zero with the period. One term is the first eigenvector of the transport equation in the periodicity cell. The other term is the...
Homotopy Algorithm for Symmetric Eigenvalue Problems.
Homotopy analysis method for nonlinear dynamical system of an electrostatically actuated microcantilever.
Homotopy method for minimum consumption orbit transfer problem
The numerical resolution of the low thrust orbital transfer problem around the Earth with the maximization of the final mass or minimization of the consumption is investigated. This problem is difficult to solve by shooting method because the optimal control is discontinuous and a homotopic method is proposed to deal with these difficulties for which convergence properties are established. For a thrust of 0.1 Newton and a final time 50% greater than the minimum one, we obtain 1786 switching times....
Homotopy method for solving fuzzy nonlinear equations.
Homotopy perturbation method for solving fourth-order boundary value problems.
HOT-pressing process modeling for medium density fiberboard (MDF).
Householder's Method for Complex Matrices and Eigensystems of Hermitian Matrices.
How many bins should be put in a regular histogram
Given an n-sample from some unknown density f on [0,1], it is easy to construct an histogram of the data based on some given partition of [0,1], but not so much is known about an optimal choice of the partition, especially when the data set is not large, even if one restricts to partitions into intervals of equal length. Existing methods are either rules of thumbs or based on asymptotic considerations and often involve some smoothness properties of f. Our purpose in this paper is to give an automatic,...
How much do approximate derivatives hurt filter methods?
In this paper, we examine the influence of approximate first and/or second derivatives on the filter-trust-region algorithm designed for solving unconstrained nonlinear optimization problems and proposed by Gould, Sainvitu and Toint in [12]. Numerical experiments carried out on small-scaled unconstrained problems from the CUTEr collection describe the effect of the use of approximate derivatives on the robustness and the efficiency of the filter-trust-region method.
How powerful are data driven score tests for uniformity
We construct a new class of data driven tests for uniformity, which have greater average power than existing ones for finite samples. Using a simulation study, we show that these tests as well as some "optimal maximum test" attain an average power close to the optimal Bayes test. Finally, we prove that, in the middle range of the power function, the loss in average power of the "optimal maximum test" with respect to the Neyman-Pearson tests, constructed separately for each alternative, in the Gaussian...
How the result of graph clustering methods depends on the construction of the graph
We study the scenario of graph-based clustering algorithms such as spectral clustering. Given a set of data points, one first has to construct a graph on the data points and then apply a graph clustering algorithm to find a suitable partition of the graph. Our main question is if and how the construction of the graph (choice of the graph, choice of parameters, choice of weights) influences the outcome of the final clustering result. To this end we study the convergence of cluster quality measures...