[1] When conducting model averaging for assessing groundwater conceptual model uncertainty, the averaging weights are often evaluated using model selection criteria such as AIC, AICc, BIC, and KIC (Akaike Information Criterion, Corrected Akaike Information Criterion, Bayesian Information Criterion, and Kashyap Information Criterion, respectively). However, this method often leads to an unrealis...

We construct an analog of Steffensen’s method for solving nonlinear operator equations. Proposed method is a kind of two stage iterative process. We study the order of convergence of the method. It is shown that the proposed analog of Stefensen’s method, which does not use derivatives, has higher order of convergency then Newton method, other generalizations of chord method or other known modif...

In this paper, we study the non-stationary parallel multisplitting two-stage iterative methods with selfadaptive weighting matrices for solving a linear system whose coefficient matrix is symmetric positive definite. Two choices of Self-adaptive weighting matrices are given, especially, the nonnegativity is eliminated. Moreover, we prove the convergence of the non-stationary parallel multisplit...

In protein engineering, useful information may be gained from systematically generating and screening all single-point mutants of a given protein. We model and analyze an iterative two-stage procedure to generate all these mutants. At each position, L variants are generated in the first stage via saturation mutagenesis and are sequenced. In the second stage, the missing variants (out of the 19 ...

The nested partitions method is a flexible and effective framework of optimizing large-scale problems with combinatorial structure. In this paper we consider the nested partitions method for simulation optimization and propose a new variant that uses inheritance to speed convergence. The new nested partitions method with inheritance algorithm performs well for when applied to test problems but ...

A two-stage method for the computational prediction of the structure of protein-ligand complexes is proposed. Given an experimentally determined structure of the protein, in the first stage a large number of plausible ligand conformations is generated using the fast docking algorithm FlexX. In the second stage these conformations are minimized and reranked using a method based on a classical fo...

Iterative twofold convolution is proposed as an efficient high-quality two-stage filtering method for dense texture-based vector field visualization. The first stage employs a compact filter, evaluated via Lagrangian particle tracing. This stage facilitates a flexible design of filters and is a means of avoiding numerical diffusion. The second stage uses semi-Lagrangian texture advection with i...