Publications

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

A differential system that models the circadian rhythm in Drosophila is analyzed with the computational singular perturbation (CSP) algorithm. Reduced nonstiff models of prespecified accuracy are constructed, the form and size of which are time-dependent. When compared with conventional asymptotic analysis, CSP exhibits superior performance in constructing reduced models, since it can algorithmically identify and apply all the required order of magnitude estimates and algebraic manipulations. A similar performance is demonstrated by CSP in generating data that allow for the acquisition of physical understanding. It is shown that the processes driving the circadian cycle are (i) mRNA translation into monomer protein, and monomer protein destruction by phosphorylation and degradation (along the largest portion of the cycle); and (ii) mRNA synthesis (along a short portion of the cycle). These are slow processes. Their action in driving the cycle is allowed by the equilibration of the fastest processes; (1) the monomer dimerization with the dimer dissociation (along the largest portion of the cycle); and (2) the net production of monomer+dimmer proteins with that of mRNA (along the short portion of the cycle). Additional results (regarding the time scales of the established equilibria, their origin, the rate limiting steps, the couplings among the variables, etc.) highlight the utility of CSP for automated identification of the important underlying dynamical features, otherwise accessible only for simple systems whose various suitable simplifications can easily be recognized. © 2006 Society for Industrial and Applied Mathematics.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Block-structured adaptively refined meshes (SAMR) strive for efficient resolution of partial differential equations (PDEs) solved on large computational domains by clustering mesh points only where required by large gradients. Previous work has indicated that fourth-order convergence can be achieved on such meshes by using a suitable combination of high-order discretizations, interpolations, and filters and can deliver significant computational savings over conventional second-order methods at engineering error tolerances. In this paper, we explore the interactions between the errors introduced by discretizations, interpolations and filters. We develop general expressions for high-order discretizations, interpolations, and filters, in multiple dimensions, using a Fourier approach, facilitating the high-order SAMR implementation. We derive a formulation for the necessary interpolation order for given discretization and derivative orders. We also illustrate this order relationship empirically using one and two-dimensional model problems on refined meshes. We study the observed increase in accuracy with increasing interpolation order. We also examine the empirically observed order of convergence, as the effective resolution of the mesh is increased by successively adding levels of refinement, with different orders of discretization, interpolation, or filtering.

The role of chain branching in a chemical kinetic system was investigated by analyzing the eigenvalues of the system. We found that in the homogeneous ignition of the hydrogen/air and methane/air mixtures, the branching mechanism gives rise to explosive modes (eigenvalues with positive real parts) in the induction period as expected; however, in their respective premixed flames, we found none. Thus, their existence is not a necessary condition for the propagation of a premixed flame. © 2005 Elsevier Ltd.

Abstract not provided.

The Bayesian setting for inverse problems provides a rigorous foundation for inference from noisy data and uncertain forward models, a natural mechanism for incorporating prior information, and a quantitative assessment of uncertainty in the inferred results. Obtaining useful information from the posterior density - e.g., computing expectations via Markov Chain Monte Carlo (MCMC) - may be a computationally expensive undertaking, however. For complex and high-dimensional forward models, such as those that arise in inverting systems of PDEs, the cost of likelihood evaluations may render MCMC simulation prohibitive. We explore the use of polynomial chaos (PC) expansions for spectral representation of stochastic model parameters in the Bayesian context. The PC construction employs orthogonal polynomials in i.i.d. random variables as a basis for the space of square-integrable random variables. We use a Galerkin projection of the forward operator onto this basis to obtain a PC expansion for the outputs of the forward problem. Evaluation of integrals over the parameter space is recast as Monte Carlo sampling of the random variables underlying the PC expansion. We evaluate the utility of this technique on a transient diffusion problem arising in contaminant source inversion. The accuracy of posterior estimates is examined with respect to the order of the PC representation and the decomposition of the support of the prior. We contrast the computational cost of the new scheme with that of direct sampling. © 2005 American Institute of Physics.

This study compares two techniques for uncertainty quantification in chemistry computations, one based on sensitivity analysis and error propagation, and the other on stochastic analysis using polynomial chaos techniques. The two constructions are studied in the context of H 2-O 2 ignition under supercritical-water conditions. They are compared in terms of their prediction of uncertainty in species concentrations and the sensitivity of selected species concentrations to given parameters. The formulation is extended to one-dimensional reacting-flow simulations. The computations are used to study sensitivities to both reaction rate pre-exponentials and enthalpies, and to examine how this information must be evaluated in light of known, inherent parametric uncertainties in simulation parameters. The results indicate that polynomial chaos methods provide similar first-order information to conventional sensitivity analysis, while preserving higher-order information that is needed for accurate uncertainty quantification and for assigning confidence intervals on sensitivity coefficients. These higher-order effects can be significant, as the analysis reveals substantial uncertainties in the sensitivity coefficients themselves. © 2005 Wiley Periodicals, Inc.

Abstract not provided.