Login / Signup
High-order time stepping for the Navier-Stokes equations with minimal computational complexity.
Jean-Luc Guermond
Peter D. Minev
Published in:
J. Comput. Appl. Math. (2017)
Keyphrases
</>
high order
computational complexity
navier stokes equations
higher order
low order
lower order
special case
bayesian logistic regression
boundary conditions
pairwise
fourth order
np complete
multi task learning
zernike moments
markov random field
decision trees
machine learning