A Sparse Interpolation Algorithm for Dynamical Simulations in Computational Chemistry
From MaRDI portal
Publication:3196660
DOI10.1137/140965284zbMath1325.65194OpenAlexW2126329687WikidataQ57439363 ScholiaQ57439363MaRDI QIDQ3196660
Publication date: 30 October 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140965284
Chemistry (92E99) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Option pricing with a direct adaptive sparse grid approach
- Solving the multi-country real business cycle model using a Smolyak-collocation method
- Spatially adaptive sparse grids for high-dimensional data-driven problems
- Combining trust-region techniques and Rosenbrock methods to compute stationary points
- Explicit cost bounds of algorithms for multivariate tensor product problems
- Sparse finite elements for stochastic elliptic problems --- higher order moments
- Simple cubature formulas with high polynomial exactness
- High dimensional polynomial interpolation on sparse grids
- Smolyak method for solving dynamic economic models: Lagrange interpolation, anisotropic grid and adaptive domain
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
- The MATLAB ODE Suite
- Algorithm 847
- High dimensional numerical problems
- The efficient solution of fluid dynamics problems by the combination technique
- Sparse interpolatory reduced-order models for simulation of light-induced molecular transformations
- New Developments in Molecular Orbital Theory
- Variational methods for the solution of problems of equilibrium and vibrations
- Newton-X
This page was built for publication: A Sparse Interpolation Algorithm for Dynamical Simulations in Computational Chemistry
