We propose a new two-level nonlinear additive Schwarz preconditioned inexact Newton algorithm (ASPIN). The two-level nonlinear preconditioner combines a local nonlinear additive Schwarz preconditioner and a global linear coarse preconditioner. Our parallel numerical results based on a lid-driven cavity incompressible flow problem show that the new two-level ASPIN is nearly scalable with respect...

In this paper, we generalize Hironaka’s invariants, the ridge and the directrix, of homogeneous ideals, to multihomogeneous ideals. These invariants are the minimal number of additive polynomials or linear forms to write a given ideal. We design algorithms to compute both these invariants which make use of the multihomogeneous structure of the ideal and study their complexities depending on the...

We explain the choice of parameter values for the REM implementation in ns-2.1b9 network simulator, and how it can be simplified when the TCP algorithm is Reno-like, i.e., employs additive-increase-multiplicative-decrease strategy.

The additive clustering (ADCL US) model (Shepard & Arabie, 1979) treats the similarity of two stimuli as a weighted additive measure of their common features. Inspired by recent work in unsupervised learning with multiple cause models, we propose anew, statistically well-motivated algorithm for discovering the structure of natural stimulus classes using the ADCLUS model, which promises substant...

We propose a new sparsity-smoothness penalty for high-dimensional generalized additive models. The combination of sparsity and smoothness is crucial for mathematical theory as well as performance for finite-sample data. We present a computationally efficient algorithm, with provable numerical convergence properties, for optimizing the penalized likelihood. Furthermore, we provide oracle results...

The class of neighbour games is the intersection of the class of assignment games (cf. Shapley and Shubik (1972)) and the class of component additive games (cf. Curiel et al. (1994)). For assignment games and component additive games there exist polynomially bounded algorithms of order p for calculating the nucleolus, where p is the number of players. In this paper we present a polynomially bou...

We construct and study a scalable overlapping Additive Schwarz-Richardson (ASR) algorithm for monotone nonlinear parabolic problems discretized implicitly in time. At each time step, the Additive Schwarz preconditioner is built using the linear part of the nonlinear operator, partitioning the domain of the problem into overlapping subdomains, solving local problems on these subdomains and solvi...

In this study we propose an algorithm for enhancement of speech degraded by additive broad-band noise. The algorithm represents speech using a sinusoidal model, where model parameters are estimated iteratively. In order to ensure speech-like characteristics observed in clean speech, the model parameters are restricted to satisfy certain smoothness constraints. The algorithm is evaluated using s...