Skip to main navigation
Skip to search
Skip to main content
University of Birmingham Home
Help & FAQ
Home
Research output
Profiles
Research units
Projects
Activities
Datasets
Equipment
Prizes
Press/Media
Search by expertise, name or affiliation
Efficient numerical algorithms for the generalized Langevin equation
Benedict Leimkuhler,
Matthias Sachs
Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
175
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Efficient numerical algorithms for the generalized Langevin equation'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Generalized Langevin Equation
100%
Numerical Algorithms
61%
Langevin Dynamics
59%
Efficient Algorithms
54%
Convergence in Law
18%
Numerical Integrators
18%
Memory Kernel
17%
Asymptotic Limit
15%
Exponential Convergence
14%
Superconvergence
14%
Splitting Method
14%
Bayesian inference
13%
Parameterization
12%
Phase Space
11%
Central limit theorem
11%
Robustness
10%
Markov chain
10%
Experiment
9%
Numerical Methods
9%
Numerical Experiment
9%
Formulation
8%
Design
7%
Demonstrate
7%
Generalise
6%
Family
5%
Model
4%
Engineering & Materials Science
Sampling
35%
Data storage equipment
15%
Parameterization
13%
Markov chains
12%
Numerical methods
11%
Experiments
9%