Titlebook: Large-Scale Scientific Computing; 4th International Co Ivan Lirkov,Svetozar Margenov,Plamen Yalamov Conference proceedings 2004 Springer-Ve

Cursory

Watemelon

Computational Infrastructure for Parallel, Distributed, and Grid-Based Monte Carlo Computationshe dynamic bag-of-work model which is well suited to parallel, distributed, and grid-based architectures. This paper concentrates on providing computational infrastructure for Monte Carlo applications on such architectures. This is accomplished by analyzing the characteristics of large-scale Monte C

消散

萬(wàn)神殿

Solution of Robust Linear Regression Problems by Krylov Subspace Methodsly reweighted criterion based on weighting functions, which tend to diminish the influence of outliers. We consider a combination of Newton method (or iteratively reweighted least squares method) with a Krylov subspace method. We show that we can avoid preconditioning with ... preconditioner by mere

共同給與

Parallel Preconditioning for Sedimentary Basin Simulationsing to hydrocarbon accumulations. The kernel of this simulation is the numerical solution of a complex system of non-linear partial differential equations (PDE) of mixed parabolic-hyperbolic type in 3D. A discretisation and linearisation of this system leads to very large, ill-conditioned, non-symme

nuclear-tests

Modeling of Narrow-Width SOI Devices: The Role of Quantum Mechanical Narrow Channel Effects on Device of a two-dimensional carrier confinement(both vertical and along the width direction) gives rise to larger average displacement of the carriers from the interface and lower sheet electron density in the channel region. This, in turn, results not only in a significant increase in the threshold volt

積極詞匯

Monte Carlo Algorithm for Ballistic Object Tracking with Uncertain Drag Parameter proposed for dealing with high nonlinearity of the object dynamics. A multiple model configuration is incorporated into the algorithm for overcoming the uncertainty about the object ballistic characteristics. The performance of the suggested multiple model particle filter (PF) is evaluated by Monte

immunity

Efficient CPU-Specific Algorithm for Generating the Generalized Faure Sequencesvely used in quasi-Monte Carlo methods, especially for very high dimensional problems. The task of generating these sequences can take substantial part of the overall CPU time of a quasi-Monte Carlo computation..We present an efficient algorithm for generating these sequences, and demonstrate how it

食道

憤怒歷史

Monte Carlo Method for Multiple Knapsack Problemn and capital budgeting problems. The Ant Colony Optimization (ACO) is a MC method, created to solve Combinatorial Optimization Problems (COPs). The paper proposes a Local Search (LC) procedure which can be coupled with the ACO algorithm to improve the efficiency of the solving of the MKP. This will