Search

In this work, we review the connection between the subjects of homogenization and nonlocal modeling and discuss the relevant computational issues. By further exploring this connection, we hope to promote the cross fertilization of ideas from the different research fronts. We illustrate how homogenization may help characterizing the nature and the form of nonlocal interactions hypothesized in nonlocal models. We also offer some perspective on how studies of nonlocality may help the development of more effective numerical methods for homogenization.

Developments of nonlocal operators for modeling processes that traditionally have been described by local differential operators have been increasingly active during the last few years. One example is peridynamics for brittle materials and another is nonstandard diffusion including the use of fractional derivatives. A major obstacle for application of these methods is the high computational cost from the numerical implementation of the nonlocal operators. It is natural to consider fast methods of fast multipole or hierarchical matrix type to overcome this challenge. Unfortunately the relevant kernels do not satisfy the standard necessary conditions. In this work a new class of fast algorithms is developed and analyzed, which is some cases reduces the computational complexity of applying nonlocal operators to essentially the same order of magnitude as the complexity of standard local numerical methods.

We propose a seamless multiscale method which approximates the macroscopic behavior of the passive advection-diffusion equations with steady incompressible velocity fields with multi-spatial scales. The method uses decompositions of the velocity fields in the Fourier space, which are similar to the decomposition in large eddy simulations. It also uses a hierarchy of local domains with different resolutions as in multigrid methods. The effective diffusivity from finer scale is used for the next coarser level computation and this process is repeated up to the coarsest scale of interest. The grids are only in local domains whose sizes decrease depending on the resolution level so that the overall computational complexity increases linearly as the number of different resolution grids increases. The method captures interactions between finer and coarser scales but has to sacrifice some of the interaction between the fine scales. The proposed method is numerically tested with 2D examples including a successful approximation to a continuous spectrum flow., 20 pages, 8 figures, submitted to Journal of Computational Physics

We present a parallel preconditioning method for the iterative solution of the time-harmonic elastic wave equation which makes use of higher-order spectral elements to reduce pollution error. In particular, the method leverages perfectly matched layer boundary conditions to efficiently approximate the Schur complement matrices of a block LD L T factorization. Both sequential and parallel versions of the algorithm are discussed and results for large-scale problems from exploration geophysics are presented.

Fast sweeping methods have become a useful tool for computing the solutions of static Hamilton-Jacobi equations. By adapting the main idea behind these methods, we describe a new approach for computing steady state solutions to systems of conservation laws. By exploiting the flow of information along characteristics, these fast sweeping methods can compute solutions very efficiently. Furthermore, the methods capture shocks sharply by directly imposing the Rankine-Hugoniot shock conditions. We present convergence analysis and numerics for several one- and two-dimensional examples to illustrate the use and advantages of this approach.

We present a multiscale approach for identifying features in ocean beds by solving inverse problems in high frequency seafloor acoustics. The setting is based on Sound Navigation And Ranging (SONAR) imaging used in scientific, commercial, and military applications. The forward model incorporates multiscale simulations, by coupling Helmholtz equations and geometrical optics for a wide range of spatial scales in the seafloor geometry. This allows for detailed recovery of seafloor parameters including material type. Simulated backscattered data is generated using numerical microlocal analysis techniques. In order to lower the computational cost of the large-scale simulations in the inversion process, we take advantage of a pre-computed library of representative acoustic responses from various seafloor parameterizations.

We propose a new heterogeneous multiscale method (HMM) for computing the effective behavior of a class of highly oscillatory ordinary differential equations (ODEs). Without the need for identifying hidden slow variables, the proposed method is constructed based on the following ideas: a nonstandard splitting of the vector field (the right hand side of the ODEs); comparison of the solutions of the split equations; construction of effective paths in the state space whose projection onto the slow subspace has the correct dynamics; and a novel on-the-fly filtering technique for achieving a high order accuracy. Numerical examples are given.

This paper is concerned with preconditioning the stiffness matrix resulting from finite element discretizations of Maxwell's equations in the high frequency regime. The moving PML sweeping preconditioner, first introduced for the Helmholtz equation on a Cartesian finite difference grid, is generalized to an unstructured mesh with finite elements. The method dramatically reduces the number of GMRES iterations necessary for convergence, resulting in an almost linear complexity solver. Numerical examples including electromagnetic cloaking simulations are presented to demonstrate the efficiency of the proposed method.

The heterogeneous multiscale method (HMM), a general framework for designing multiscale algorithms, is reviewed. Emphasis is given to the error analysis that comes naturally with the framework. Examples of finite element and finite difference HMM are presented. Applications to dynamical systems and stochastic simulation algorithms with multiple time scales, spall fracture and heat conduction in microprocessors are discussed.

A new numerical method for approximating highly oscillatory wave fields as a superposition of Gaussian beams is presented. The method estimates the number of beams and their parameters automatically. This is achieved by an expectation-maximization algorithm that fits real, positive Gaussians to the energy of the highly oscillatory wave fields and its Fourier transform. Beam parameters are further refined by an optimization procedure that minimizes the difference between the Gaussian beam superposition and the highly oscillatory wave field in the energy norm.

In this paper, we present a method of decomposing a highly oscillatory wave field into a sparse superposition of Gaussian beams. The goal is to extract the necessary parameters for a Gaussian beam superposition from this wave field, so that further evolution of the high frequency waves can be computed by the method of Gaussian beams. The methodology is described for R^d with numerical examples for d=2. In the first example, a field generated by an interface reflection of Gaussian beams is decomposed into a superposition of Gaussian beams. The beam parameters are reconstructed to a very high accuracy. The data in the second example is not a superposition of a finite number of Gaussian beams. The wave field to be approximated is generated by a finite difference method for a geometry with two slits. The accuracy in the decomposition increases monotonically with the number of beams.

In this paper, we develop and analyze a new class of discontinuous Galerkin (DG) methods for the acoustic wave equation in mixed form. Traditional mixed finite element (FE) methods produce energy conserving schemes, but these schemes are implicit, making the time-stepping inefficient. Standard DG methods give explicit schemes, but these approaches are typically dissipative or suboptimally convergent, depending on the choice of numerical fluxes. Our new method can be seen as a compromise between these two kinds of techniques, in the way that it is both explicit and energy conserving, locally and globally. Moreover, it can be seen as a generalized version of the Raviart-Thomas FE method and the finite volume method. Stability and convergence of the new method are rigorously analyzed, and we have shown that the method is optimally convergent. Furthermore, in order to apply the new method for unbounded domains, we apply our new method with the first order absorbing boundary condition. The stability of the resulting numerical scheme is analyzed.

A multiscale method for computing the effective behavior of a class of stiff and highly oscillatory ordinary differential equations (ODEs) is presented. The oscillations may be in resonance with on ...

A new set of consistent boundary conditions for Yee scheme approximations of wave equations in two space dimensions are developed and analyzed. We show how the classical staircase boundary conditions for hard reflections or, in the electromagnetic case, conducting surfaces in certain cases give O(1) errors. The proposed conditions keep the structure of the Yee scheme and are thus well suited for high performance computing. The higher accuracy is achieved by modifying the coefficients in the difference stencils near the boundary. This generalizes our earlier results with Gustafsson and Wahlund in one space dimension. We study stability and convergence and we present numerical examples.

Homogenization is an important mathematical framework for developing effective models of differential equations with oscillations. We include in the presentation techniques for deriving effective equations, a brief discussion on analysis of related limit processes and numerical methods that are based on homogenization principles. We concentrate on first- and second-order partial differential equations and present results concerning both periodic and random media for linear as well as nonlinear problems. In the numerical sections, we comment on computations of multi-scale problems in general and then focus on projection-based numerical homogenization and the heterogeneous multi-scale method.

Discretization of singular functions is an important component in many problems to which level set methods have been applied. We present two methods for constructing consistent approximations to Dirac delta measures concentrated on piecewise smooth curves or surfaces. Both methods are designed to be convenient for level set simulations and are introduced to replace the commonly used but inconsistent regularization technique that is solely based on a regularization parameter proportional to the mesh size. The first algorithm is based on a tensor product of regularized one-dimensional delta functions. It is independent of the irregularity relative to the grid. In the second method, the regularization is constructed from a one-dimensional regularization that is extended to multi-dimensions with a variable support depending on the orientation of the singularity relative to the computational grid. Convergence analysis and numerical results are given.

The heterogeneous multiscale methods (HMM) is a general framework for the numerical approximation of multiscale problems. It is here developed for ordinary differential equations containing differe ...

We will consider both explicit and implicit fully discrete finite volume schemes for solving three-dimensional Maxwell's equations with discontinuous physical coefficients on general polyhedral domains. Stability and convergence for both schemes are analyzed. We prove that the schemes are second order accurate in time. Both schemes are proved to be first order accurate in space for the Voronoi--Delaunay grids and second order accurate for nonuniform rectangular grids. We also derive explicit expressions for the dependence on the physical parameters in all estimates.

Singular terms in differential equations pose severe challenges for numerical approximations on regular grids. Regularization of the singularities is a very useful technique for their representation on the grid. We analyze such techniques for the practically preferred case of narrow support of the regularizations, extending our earlier results for wider support. The analysis also generalizes existing theory for one dimensional problems to multi-dimensions. New high order multi-dimensional techniques for differential equations and numerical quadrature are introduced based on the analysis and numerical results are presented. We also show that the common use of distance functions in level-set methods to extend one dimensional regularization to higher dimensions may produce O(1) errors.

Numerical simulation of high frequency acoustic, elastic or electro-magnetic wave propagation is important in many applications. Recently the traditional techniques of ray tracing based on geometrical optics have been augmented by numerical procedures based on partial differential equations. Direct simulations of solutions to the eikonal equation have been used in seismology, and lately approximations of the Liouville or Vlasov equation formulations of geometrical optics have generated impressive results. There are basically two techniques that follow from this latter approach: one is wave front methods and the other moment methods. We shall develop these methods in some detail after a brief review of more traditional algorithms for simulating high frequency wave propagation.

The rate of convergence for numerical methods approximating differential equations are often drastically reduced from lack of regularity in the solution. Typical examples are problems with singular source terms or discontinuous material coefficients. We shall discuss the technique of local regularization for handling these problems. New numerical methods are presented and analyzed and numerical examples are given. Some serious deficiencies in existing regularization methods are also pointed out.

Geometrical optics is a standard technique used for the approximation of high-frequency wave propagation. Computational methods based on partial differential equations instead of the traditional ray tracing have recently been applied to geometrical optics. These new methods have a number of advantages but typically exhibit difficulties with linear superposition of waves. In this paper we introduce a new partial differential technique based on the segment projection method in phase space. The superposition problem is perfectly resolved and so is the problem of computing amplitudes in the neighborhood of caustics. The computational complexity is of the same order as that of ray tracing. The new algorithm is described and a number of computational examples are given, including a simulation of waveguides.

We consider the inverse problem of determining the highly oscillatory coefficient $a^\epsilon$ in partial differential equations of the form $-\nabla\cdot (a^\epsilon\nabla u^\epsilon)+bu^\epsilon = f$ from given measurements of the solutions. Here, $\epsilon$ indicates the smallest characteristic wavelength in the problem ($0 0$, and exploration seismology, $b < 0$.

A numerical method for simulating incompressible two-dimensional multiphase flow is presented. The method is based on a level-set formulation discretized by a finite-element technique. The treatment of the specific features of this problem, such as surface tension forces acting at the interfaces separating two immiscible fluids, as well as the density and viscosity jumps that in general occur across such interfaces, have been integrated into the finite-element framework. Using a method based on the weak formulation of the Navier-Stokes equations has its advantages. In this formulation, the singular surface tension forces are included through line integrals along the interfaces, which are easily approximated quantities. In addition, differentiation of the discontinuous viscosity is avoided. The discontinuous density and viscosity are included in the finite element integrals. A strategy for the evaluation of integrals with discontinuous integrands has been developed based on a rigorous analysis of the errors associated with the evaluation of such integrals. Numerical tests have been performed. For the case of a rising buoyant bubble the results are in good agreement with results from a front-tracking method. The run presented here is a run including topology changes, where initially separated areas of one fluid merge in different stages due to buoyancy effects.

A systematic technique for the derivation of subgrid scale models in the numerical solution of partial differential equations is described. The technique is based on Haar wavelet projections of the discrete operator followed by a sparse approximation. As numerical testing suggests, the resulting numerical method will accurately represent subgrid scale phenomena on a coarse grid. Applications to numerical homogenization and wave propagation in materials with subgrid inhomogeneities are presented.

Finite difference approximations generically have ${\cal O}(1)$ pointwise errors close to a shock. We show that this local error may effect the smooth part of the solution such that only first order is achieved even for formally higher-order methods. Analytic and numerical examples of this form of accuracy are given. We also show that a converging method will have the formal order of accuracy in domains where no characteristics have passed through a shock.

In this paper we would like to point out some similarities between two artificial boundary conditions. One is the far field or absorbing boundary conditions for computations over unbounded domain. The other is the boundary conditions used at the boundary between subdomains in domain decomposition. We show some convergence result for the generalized Schwarz alternating method (GSAM), in which a convex combination of Dirichlet data and Neumann data is exchanged at the artificial boundary. We can see clearly how the mixed boundary condition and the relative size of overlap will affect the convergence rate. These results can be extended to more general coercive elliptic partial differential equations using the equivalence of elliptic operators. Numerically first- and second-order approximations of the Dirichlet-to-Neumann operator are constructed using local operators, where information tangential to the boundary is included. Some other possible extensions and applications are pointed out. Finally numerical results are presented.

A numerical homogenization procedure for elliptic differential equations is presented. It is based on wavelet decompositions of discrete operators in fine and coarse scale components followed by the elimination of the fine scale contributions. If the operator is in divergence form, this is preserved by the homogenization procedure. For periodic problems, results similar to classical effective coefficient theory are proved. The procedure can be applied to problems that are not cell-periodic.

Standard multigrid methods are not so effective for equations with highly oscillatory coefficients. New coarse grid operators based on homogenized operators are introduced to restore the fast convergence rate of multigrid methods. Finite difference approximations are used for the discretization of the equations. Convergence analysis is based on the homogenization theory. Proofs are given for a two-level multigrid method with the homogenized coarse grid operator for two classes of two-dimensional elliptic equations with Dirichlet boundary conditions.

Seismic signals are typically compared using travel time difference or $L_2$ difference. We propose the Wasserstein metric as an alternative measure of fidelity or misfit in seismology. It exhibits properties from both of the traditional measures mentioned above. The numerical computation is based on the recent development of fast numerical methods for the Monge-Ampere equation and optimal transport. Applications to waveform inversion and registration are discussed and simple numerical examples are presented.

New coarse grid operators are developed for elliptic problems with highly oscillatory coefficients. The new coarse grid operators are constructed directly based on the homogenized differential operators or hierarchically computed from the finest grid. A detailed description of this construction is provided. Numerical calculations for a two-dimensional elliptic model problem show that the homogenized form of the equations is very useful in the design of coarse grid operators for the multigrid method. A more realistic problem of heat conduction in a composite structure is also considered.

New numerical methods are derived for calculation of high frequency asymptotic expansion of the scalar wave equation. The nonlinear partial differential equations defining the terms in the expansio ...

Multiscale wave propagation problems are computationally costly to solve by traditional techniques because the smallest scales must be represented over a domain determined by the largest scales of the problem. We have developed and analyzed new numerical methods for multiscale wave propagation in the framework of the heterogeneous multiscale method (HMM). The numerical methods couple simulations on macro- and microscales for problems with rapidly oscillating coefficients. The complexity of the new method is significantly lower than that of traditional techniques with a computational cost that is essentially independent of the smallest scale, when computing solutions at a fixed time and accuracy. We show numerical examples of the HMM applied to long time integration of wave propagation problems in both periodic and non-periodic medium. In both cases our HMM accurately captures the dispersive effects that occur. We also give a stability proof for the HMM, when it is applied to long time wave propagation problems. QC 20111116

A class was devised of fast wavelet based algorithms for linear evolution equations whose coefficients are time independent. The method draws on the work of Beylkin, Coifman, and Rokhlin which they applied to general Calderon-Zygmund type integral operators. A modification of their idea is applied to linear hyperbolic and parabolic equations, with spatially varying coefficients. A significant speedup over standard methods is obtained when applied to hyperbolic equations in one space dimension and parabolic equations in multidimensions.

Difference approximations of hyperbolic partial differential equations with highly oscillatory coefficients and initial values are studied. Analysis of strong and weak convergence is carried out in the practically interesting case when the discretization step sizes are essentially independent of the oscillatory wave lengths. 01993 John Wiley & Sons, Inc.

A triangle based total variation diminishing (TVD) scheme for the numerical approximation of hyperbolic conservation laws in two space dimensions is constructed. The novelty of the scheme lies in the nature of the preprocessing of the cell averaged data, which is accomplished via a nearest neighbor linear interpolation followed by a slope limiting procedures. Two such limiting procedures are suggested. The resulting method is considerably more simple than other triangle based non-oscillatory approximations which, like this scheme, approximate the flux up to second order accuracy. Numerical results for linear advection and Burgers' equation are presented.

This paper deals with numerical methods for high frequency wave scattering. It introduces a new hybrid technique that couples a directional fast multipole method for a subsection of a scattering surface to an asymptotic formulation over the rest of the scattering domain. The directional fast multipole method is new and highly efficient for the solution of the boundary integral formulation of a general scattering problem but it requires at least a few unknowns per wavelength on the boundary. The asymptotic method that was introduced by Bruno and collaborators requires much fewer unknowns. On the other hand the scattered field must have a simple structure. Hybridization of these two methods retains their best properties for the solution of the full problem. Numerical examples are given for the solution of the Helmholtz equation in two space dimensions.

In this article, we study a class of numerical ODE schemes that use a time filtering strategy and operate in two time scales. The algorithms follow the framework of the heterogeneous multiscale methods (HMM) [1]. We apply the methods to compute the averaged path of the inverted pendulum under a highly oscillatory vertical forcing on the pivot. The averaged equation for related problems has been studied analytically in [9]. We prove and show numerically that the proposed methods approximate the averaged equation and thus compute the average path of the inverted pendulum.

Multiscale Discontinuous Galerkin Methods for Elliptic Problems with Multiple Scales.- Discrete Network Approximation for Highly-Packed Composites with Irregular Geometry in Three Dimensions.- Adaptive Monte Carlo Algorithms for Stopped Diffusion.- The Heterogeneous Multi-Scale Method for Homogenization Problems.- A Coarsening Multigrid Method for Flow in Heterogeneous Porous Media.- On the Modeling of Small Geometric Features in Computational Electromagnetics.- Coupling PDEs and SDEs: The Illustrative Example of the Multiscale Simulation of Viscoelastic Flows.- Adaptive Submodeling for Linear Elasticity Problems with Multiscale Geometric Features.- Adaptive Variational Multiscale Methods Based on A Posteriori Error Estimation: Duality Techniques for Elliptic Problems.- Multipole Solution of Electromagnetic Scattering Problems with Many, Parameter Dependent Incident Waves.- to Normal Multiresolution Approximation.- Combining the Gap-Tooth Scheme with Projective Integration: Patch Dynamics.- Multiple Time Scale Numerical Methods for the Inverted Pendulum Problem.- Multiscale Homogenization of the Navier-Stokes Equation.- Numerical Simulations of the Dynamics of Fiber Suspensions.

The modern development of numerical computing is driven by the rapid increase in computer performance. The present exponential growth approximately follows Moore’s law, doubling in capacity every eighteen months. Numerical computing has, of course, been part of mathematics for a very long time. Algorithms by the names of Euclid, Newton and Gauss, originally designed for computation ‘by hand’, are still used today in computer simulations.

the complexity decreases tremendously, e.g. for one dimensional parabolicequation it becomes O(log4N) as opposed to O(N(log3N)).We expect to do multidimension hyperbolic problems using the new ideaand get a significant speed-up.For a general multidimensional parabolic equation, the complexity is O(log4 N)).For a d dimensional hyperbolic system the complexity is O(N'22 log3 N). Thisis advantageous for dimension d =

Numerical approximations are studied for a large hyperbolic system coupled to a parabolic equation and a system of algebraic equations. The equations, which all are nonlinear, describe nonviscous compressible one-dimensional gas flow in a catalytic converter. Chemical reactions within the gas are included in the model. Well-posedness of the partial differential equations is analyzed together with stability of the numerical models. In particular an investigation is made of the effect of numerical dissipation and different boundary conditions. Numerical results are presented.

Computational fluid dynamics (CFD) is a large branch of scientific computing that lately has undergone explosive growth. It draws upon elements from related disciplines: fluid mechanics, numerical ...

We continue the construction and the analysis of essentially nonoscillatory shock capturing methods for the approximation of hyperbolic conservation laws. These schemes share many desirable properties with total variation diminishing schemes, but TVD schemes have at most first-order accuracy in the sense of truncation error, at extrema of the solution. In this paper we construct an hierarchy of uniformly high-order accurate approximations of any desired order of accuracy which are tailored to be essentially nonoscillatory. This means that, for piecewise smooth solutions, the variation of the numerical approximation is bounded by that of the true solution up to O(h^R^ ^-^ ^1), for 0

A new class of computational far field boundary conditions for hyperbolic partial differential equations is developed. These boundary conditions combine properties of absorbing boundary conditions for transient solutions and properties of far field boundary conditions for steady-state problems. The conditions can be used to limit the computational domain when both traveling waves and evanescent waves are present. Boundary conditions for scalar wave equations are derived and analyzed. Extensions to systems of equations are discussed and results from numerical experiments are presented.

Particle methods approximating hyperbolic partial diferential equations with oscillatory solutions are studied. Convergence is proved for approximations for which the continuous solution is not well resolved on the computational grid. Highly oscillatory solutions to the Broadwell and variable coefficient Carleman models are considered. Homogenization results are given and the approximations of more general systems are discussed. Numerical examples are presented.