【摘 要】
：
Numerical linear algebra is at the heart of scientific and industrial discoveries.The forthcoming arrival of the exascale era provides tremendous opportunit
【机 构】
：
Lawrence Berkeley National Laboratory
论文部分内容阅读
Numerical linear algebra is at the heart of scientific and industrial discoveries.The forthcoming arrival of the exascale era provides tremendous opportunities and challenges for further development of algorithms and software extreme-scale computing.This minisymposium emphasizes problem reformulations,algorithm redesigns and code refactorings for the efficient use of high performance computers.
其他文献
We present numerical approximations of phase-field vesicle membrane models.We first reformulate the model derived from an energetic variational formulation
We prove that for initial data of the form u∈0(x)=(vh 0(x∈),∈-1v3 0(x∈)T,x∈=(xh,∈x3)T,the Cauchy problem of the incompressible Navier-Stokes equations
The minisymposium presents the state of art of rigorous analysis and numerical simulations of interfacial motions.We have in mind problems,where diffusion o
Some recent results on the existence,regularity and large time behavior for the Boltzmann equation with measure valued initial data will be presented.
We investigate the simulation of the acoustic near and far field of a turbulent flow through a thin porous medium.Within the porous medium and the turbulenc
Nonlinear acoustic waves caused by an infinitely wide plate oscillating in its normal direction and propagating into a semi-infinite expanse of a rarefied g
In this work in collaboration with F.Filbet,we construct a hierarchy of hybrid numerical methods for the Boltzmann equation,based on moment realizability.We
The fractional arboricity Arb(G)is the maximum of |E(H)|/|V(H)|-1 over all subgraphs H with at least two vertices.Generalizing the Nash-Williams Arboricity
We prove that for all positive integers t,every n-vertex graph with no Kt-subdivision has at most 294tn cliques.We also prove that asymptotically,such graph
Linial and Wilf asked for the graphs with fixed numbers of vertices and edges which maximize the number of proper q-colorings.We characterize the asymptotic