Multiscale solvers and systematic upscaling in computational physics

https://doi.org/10.1016/j.cpc.2005.03.097Get rights and content

Abstract

Multiscale algorithms can overcome the scale-born bottlenecks that plague most computations in physics. These algorithms employ separate processing at each scale of the physical space, combined with interscale iterative interactions, in ways which use finer scales very sparingly. Having been developed first and well known as multigrid solvers for partial differential equations, highly efficient multiscale techniques have more recently been developed for many other types of computational tasks, including: inverse PDE problems; highly indefinite (e.g., standing wave) equations; Dirac equations in disordered gauge fields; fast computation and updating of large determinants (as needed in QCD); fast integral transforms; integral equations; astrophysics; molecular dynamics of macromolecules and fluids; many-atom electronic structures; global and discrete-state optimization; practical graph problems; image segmentation and recognition; tomography (medical imaging); fast Monte-Carlo sampling in statistical physics; and general, systematic methods of upscaling (accurate numerical derivation of large-scale equations from microscopic laws).

Section snippets

The scale gap

Despite their dizzying speed, modern supercomputers are still incapable of handling many most vital scientific problems. This is primarily due to the scale gap, which exists between the microscopic scale at which physical laws are given and the much larger scale of phenomena we wish to understand.

This gap implies, first of all, a huge number of variables (e.g., atoms or gridpoints or picture elements), and possibly even a much larger number of interactions. Moreover, computers simulate physical

Multigrid and renormalization

Past studies have demonstrated that scale-born slowness can be overcome by multiscale algorithms. Such algorithms have first been developed in the form of fast multigrid solvers for discretized PDEs [1], [2], [10], [11], [12]. These solvers are based on two processes: (1) classical relaxation schemes, which are generally slow to converge but fast to smooth the error function; (2) approximating the smooth error on a coarser grid (typically having twice the meshsize), by solving there equations

Systematic upscaling (SU): An outline

Local equations and interactions. Computationally we deal only with discrete systems; their n variables u1,u2,,un will typically be either values of discretized functions (grid values, or finite elements, etc.), or locations of particles. An equation or interaction is called local if it involves only O(1) neighboring variables. For simplicity of discussion we describe SU first for systems of local equations (including energy minimization with local interactions) or local interactions at

Acknowledgment

The research is supported by the Israel Science Foundation grant 295/01 and by the US Air Force Office of Scientific Research, contract F33615-03-D5408.

References (19)

There are more references available in the full text version of this article.

Cited by (22)

  • Multiscale model reduction for transport and flow problems in perforated domains

    2018, Journal of Computational and Applied Mathematics
    Citation Excerpt :

    Model reduction techniques usually depend on a coarse grid approximation, which can be obtained by discretizing the problem on a coarse grid and choosing a suitable coarse-grid formulation of the problem. In the literature, several approaches have been developed to obtain the coarse-grid formulation, including upscaling methods [1–10] and multiscale methods [11–18]. Among these approaches, GMsFEM (Generalized Multiscale Finite Element Method) [19–24] provides a systematic way of adding degrees of freedom for problems with high contrast and multiple scales.

  • Stochastic computation based on orthogonal expansion of random fields

    2011, Computer Methods in Applied Mechanics and Engineering
    Citation Excerpt :

    For most of complex systems that do not hold regularity of self-similarity or periodicity, analytical methods such as perturbation method, mean field theory, and self-consistent method have been attempted with successes generally limited to small fluctuations problems. Little research on computational methods has been done to upscale stochastic systems without self-similarity, which is the more prevalent situation in practical problems [8]. Uncertainty propagation in a complex system can be generally posed as a mapping of input–output probabilistic information through a system typically described as a differential equation.

  • Connection between microstructure and magnetic properties of soft magnetic materials

    2008, Journal of Magnetism and Magnetic Materials
    Citation Excerpt :

    Algebraic multigrid methods have been applied in their adaptive form to large sparse matrix equations arising in the finite-element description of stray fields in micromagnetic problems with nonuniform or unstructured grids [21]. Systematic upscaling has been applied to studies of Maxwell equations within heterogeneous magnetic materials [22,23]. Methods based on homogenisation theory [24] have been proposed in relation to the minimization of the micromagnetic energy functional [25].

  • Multiscale theorems

    2008, Advances in Chemical Engineering
View all citing articles on Scopus
View full text