default search action
Journal of Computational Physics, Volume 341
Volume 341, July 2017
- Juwon Jang, Changhoon Lee:
An immersed boundary method for nonuniform grids. 1-12 - Yajun An:
Uniform dispersion reduction schemes for the one dimensional wave equation in isotropic media. 13-21 - Abbas Fakhari, Diogo Bolster, Li-Shi Luo:
A weighted multiple-relaxation-time lattice Boltzmann method for multiphase flows and its application to partial coalescence cascades. 22-43 - Qing Cheng, Xiaofeng Yang, Jie Shen:
Efficient and accurate numerical schemes for a hydro-dynamically coupled phase field diblock copolymer model. 44-60 - Benjamin Peherstorfer, Boris Kramer, Karen Willcox:
Combining multiple surrogate models to accelerate failure probability estimation with expensive high-fidelity models. 61-75 - Éliane Bécache, Patrick Joly, Maryna Kachanovska:
Stable perfectly matched layers for a cold plasma in a strong background magnetic field. 76-101 - Panagiotis Tsilifis, Roger G. Ghanem:
Reduced Wiener Chaos representation of random fields via basis adaptation and projection. 102-120 - Hillary R. Fairbanks, Alireza Doostan, Christian Ketelsen, Gianluca Iaccarino:
A low-rank control variate for multilevel Monte Carlo simulation of high-dimensional uncertain systems. 121-139 - Patrick Gelß, Stefan Klus, Sebastian Matera, Christof Schütte:
Nearest-neighbor interaction systems in the tensor-train format. 140-162 - José G. Aguilar, Luca Magri, Matthew P. Juniper:
Adjoint-based sensitivity analysis of low-order thermoacoustic networks using a wave-based approach. 163-181 - Yannis Kallinderis, Eleni M. Lymperopoulou, Panagiotis Antonellis:
Flow feature detection for grid adaptation and flow visualization. 182-207 - Piotr K. Smolarkiewicz, Christian Kühnlein, Wojciech W. Grabowski:
A finite-volume module for cloud-resolving simulations of global atmospheric flows. 208-229 - Dongwook Lee, Hugues Faller, Adam Reyes:
The Piecewise Cubic Method (PCM) for computational fluid dynamics. 230-257 - Krzysztof J. Fidkowski:
Output-based space-time mesh optimization for unsteady flows using continuous-in-time adjoints. 258-277 - Oindrila Kanjilal, C. S. Manohar:
Girsanov's transformation based variance reduced Monte Carlo simulation schemes for reliability estimation in nonlinear stochastic dynamics. 278-294 - Songting Luo, Nicholas Payne:
An asymptotic method based on a Hopf-Cole transformation for a kinetic BGK equation in the hyperbolic limit. 295-312 - Keiichi Kitamura, Atsushi Hashimoto:
Simple a posteriori slope limiter (Post Limiter) for high resolution and efficient flow computations. 313-340 - Maurizio Tavelli, Michael Dumbser:
A pressure-based semi-implicit space-time discontinuous Galerkin method on staggered unstructured meshes for the solution of the compressible Navier-Stokes equations at all Mach numbers. 341-376 - Rajapandiyan Asaithambi, Krishnan Mahesh:
A note on a conservative finite volume approach to address numerical stiffness in polar meshes. 377-385 - Xueyu Zhu, Erin M. Linebarger, Dongbin Xiu:
Multi-fidelity stochastic collocation method for computation of statistical moments. 386-396 - Piotr Borowik, Jean-Luc Thobel, Leszek Adamowicz:
Modified Monte Carlo method for study of electron transport in degenerate electron gas in the presence of electron-electron interactions, application to graphene. 397-405 - Toru Takahashi, Pieter Coulier, Eric Darve:
Application of the inverse fast multipole method as a preconditioner in a 3D Helmholtz boundary element method. 406-428 - Stéphanie Chaillat, Marion Darbas, Frédérique Le Louër:
Fast iterative boundary element methods for high-frequency scattering problems in 3D elastodynamics. 429-446 - Lin Fu, Sergey Litvinov, Xiangyu Hu, Nikolaus A. Adams:
A novel partitioning method for block-structured adaptive meshes. 447-473
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.