Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Discipline
      Discipline
      Clear All
      Discipline
  • Is Peer Reviewed
      Is Peer Reviewed
      Clear All
      Is Peer Reviewed
  • Item Type
      Item Type
      Clear All
      Item Type
  • Subject
      Subject
      Clear All
      Subject
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
      More Filters
      Clear All
      More Filters
      Source
    • Language
21,851 result(s) for "diffusion equation"
Sort by:
Asymptotic Spreading for General Heterogeneous Fisher-KPP Type Equations
In this monograph, we review the theory and establish new and general results regarding spreading properties for heterogeneous reaction-diffusion equations: The characterizations of these sets involve two new notions of generalized principal eigenvalues for linear parabolic operators in unbounded domains. In particular, it allows us to show that
DISCONTINUOUS GALERKIN METHOD FOR FRACTIONAL CONVECTION-DIFFUSION EQUATIONS
We propose a discontinuous Galerkin method for fractional convection-diffusion equations with a superdiffusion operator of order α(1 < α < 2) defined through the fractional Laplacian. The fractional operator of order α is expressed as a composite of first order derivatives and a fractional integral of order 2 – α. The fractional convection-diffusion problem is expressed as a system of low order differential/integral equations, and a local discontinuous Galerkin method scheme is proposed for the equations. We prove stability and optimal order of convergence 𝓞(hk+1) for the fractional diffusion problem, and an order of convergence of 𝓞(hk+½) is established for the general fractional convection-diffusion problem. The analysis is confirmed by numerical examples.
A CRANK–NICOLSON ADI SPECTRAL METHOD FOR A TWO-DIMENSIONAL RIESZ SPACE FRACTIONAL NONLINEAR REACTION-DIFFUSION EQUATION
In this paper, a new alternating direction implicit Galerkin–Legendre spectral method for the two-dimensional Riesz space fractional nonlinear reaction-diffusion equation is developed. The temporal component is discretized by the Crank–Nicolson method. The detailed implementation of the method is presented. The stability and convergence analysis is strictly proven, which shows that the derived method is stable and convergent of order 2 in time. An optimal error estimate in space is also obtained by introducing a new orthogonal projector. The present method is extended to solve the fractional FitzHugh–Nagumo model. Numerical results are provided to verify the theoretical analysis.
Climate modeling with neural advection–diffusion equation
Owing to the remarkable development of deep learning technology, there have been a series of efforts to build deep learning-based climate models. Whereas most of them utilize recurrent neural networks and/or graph neural networks, we design a novel climate model based on two concepts, the neural ordinary differential equation (NODE) and the advection–diffusion equation. The advection–diffusion equation is widely used for climate modeling because it describes many physical processes involving Brownian and bulk motions in climate systems. On the other hand, NODEs are to learn a latent governing equation of ODE from data. In our presented method, we combine them into a single framework and propose a concept, called neural advection–diffusion equation (NADE). Our NADE, equipped with the advection–diffusion equation and one more additional neural network to model inherent uncertainty, can learn an appropriate latent governing equation that best describes a given climate dataset. In our experiments with three real-world and two synthetic datasets and fourteen baselines, our method consistently outperforms existing baselines by non-trivial margins.
Matlab code for a level set-based topology optimization method using a reaction diffusion equation
This paper presents a simple Matlab implementation for a level set-based topology optimization method in which the level set function is updated using a reaction diffusion equation, which is different from conventional level set-based approaches (Allaire et al. 2002 , 2004 ; Wang et al. 2003 ) that use the Hamilton-Jacobi equation to update the level set function. With this method, the geometrical complexity of optimized configurations can be easily controlled by appropriately setting a regularization parameter. We explain the code in detail, and also the derivation of the topological derivative that is used in the level set-based topology optimization. Numerical results for stiffness maximization problems are provided to facilitate the reader’s understanding. The presented code is intended for educational purposes only. This paper was inspired by previously published papers presenting Matlab code for a SIMP method (Sigmund 2001 ; Andreassen et al. 2011 ), a level set-based method (Challis 2010 ), and FreeFem ++ code for a structural optimization method (Allaire and Pantz 2006 ). Readers can investigate results provided by these different methods and discover the prominent aspects of each particular method. The code presented here can be downloaded from http://www.osdel.me.kyoto-u.ac.jp/members/yamada/codes.html .
A high-order numerical scheme for multidimensional convection-diffusion-reaction equation with time-fractional derivative
This paper considers a high-order numerical method for a computed solution of multidimensional convection-diffusion-reaction equation with time-fractional derivative subjected to appropriate initial and boundary conditions. The stability and error estimates of the proposed numerical approach are analyzed using the L ∞ ( 0 , T ; L 2 ) -norm. The theoretical study suggests that the new technique is unconditionally stable and temporal accurate with order O ( τ 2+ α ), where τ denotes the time step and 0 < α < 1. This result shows that the developed algorithm is faster and more efficient than a broad range of numerical techniques widely studied in the literature for the considered problem. Numerical experiments confirm the theory and they indicate that the proposed numerical scheme converges with accuracy O ( τ 2+ α + h 4 ), where h represents the space step.
A modified analytical approach with existence and uniqueness for fractional Cauchy reaction–diffusion equations
This article mainly explores and applies a modified form of the analytical method, namely the homotopy analysis transform method (HATM) for solving time-fractional Cauchy reaction–diffusion equations (TFCRDEs). Then mainly we address the error norms L2 and L∞ for a convergence study of the proposed method. We also find existence, uniqueness and convergence in the analysis for TFCRDEs. The projected method is illustrated by solving some numerical examples. The obtained numerical solutions by the HATM method show that it is simple to employ. An excellent conformity obtained between the solution got by the HATM method and the various well-known results available in the current literature. Also the existence and uniqueness of the solution have been demonstrated.
Fast Iterative Method with a Second-Order Implicit Difference Scheme for Time-Space Fractional Convection–Diffusion Equation
In this paper we intend to establish fast numerical approaches to solve a class of initial-boundary problem of time-space fractional convection–diffusion equations. We present a new unconditionally stable implicit difference method, which is derived from the weighted and shifted Grünwald formula, and converges with the second-order accuracy in both time and space variables. Then, we show that the discretizations lead to Toeplitz-like systems of linear equations that can be efficiently solved by Krylov subspace solvers with suitable circulant preconditioners. Each time level of these methods reduces the memory requirement of the proposed implicit difference scheme from O ( N 2 ) to O ( N ) and the computational complexity from O ( N 3 ) to O ( N log N ) in each iterative step, where N is the number of grid nodes. Extensive numerical examples are reported to support our theoretical findings and show the utility of these methods over traditional direct solvers of the implicit difference method, in terms of computational cost and memory requirements.