Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 171

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Building a Framework for Predictive Science

Open access
McKerns, Michael, Strand, Leif, Sullivan, Tim, Fang, Alta, Aivazis, Michael · 2011 · Proceedings of the Python in Science Conference

Abstract

Key questions that scientists and engineers typically want to address can be formulated in terms of predictive science.Questions such as: "How well does my computational model represent reality?", "What are the most important parameters in the problem?", and "What is the best next experiment to perform?" are fundamental in solving scientific problems.mystic is a framework for massively-parallel optimization and rigorous sensitivity analysis that enables these motivating questions to be addressed quantitatively as global optimization problems.Often realistic physics, engineering, and materials models may have hundreds of input parameters, hundreds of constraints, and may require execution times of seconds or longer.In more extreme cases, realistic models may be multi-scale, and require the use of high-performance computing clusters for their evaluation.Predictive calculations, formulated as a global optimization over a potential surface in design parameter space, may require an already prohibitively large simulation to be performed hundreds, if not thousands, of times.The need to prepare, schedule, and monitor thousands of model evaluations, and dynamically explore and analyze results, is a challenging problem that requires a software infrastructure capable of distributing and managing computations on large-scale heterogeneous resources.In this paper, we present the design behind an optimization framework, and also a framework for heterogeneous computing, that when utilized together, can make computationally intractable sensitivity and optimization problems much more tractable.The optimization framework provides global search algorithms that have been extended to parallel, where evaluations of the model can be distributed to appropriate large-scale resources, while the optimizer centrally manages their interactions and navigates the objective function.New methods have been developed for imposing and solving constraints that aid in reducing the size and complexity of the optimization problem.Additionally, new algorithms have been developed that launch multiple optimizers in parallel, thus allowing highly efficient local search algorithms to provide fast global optimization.In this way, parallelism in optimization also can allow us to not only find global minima, but to simultaneously find all local minima and transition points --thus providing a much more efficient means of mapping out a potential energy surface.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.25080/majora-ebaa42b7-00d

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 171

Metadata

Authors
McKerns, M., Strand, L., Sullivan, T., Fang, A., & Aivazis, M.
Venue
Proceedings of the Python in Science Conference
Publisher
SciPy
Published
2011
Pages
76-86
ISSN
2575-9752 (ISSN-L)
OpenAlex
W2146452962
Cited by
171
References
1
FWCI
5.69
Type
conference paper
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Building a Framework for Predictive Science. https://app.cochat.ai/papers/10.25080/majora-ebaa42b7-00d
The paper
McKerns, M., Strand, L., Sullivan, T., Fang, A., & Aivazis, M. (2011). Building a Framework for Predictive Science. Proceedings of the Python in Science Conference. https://doi.org/10.25080/majora-ebaa42b7-00d

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.