skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: An efficient positive‐definite block‐preconditioned finite volume solver for two‐sided fractional diffusion equations on composite mesh
Abstract It is known that the solutions to space‐fractional diffusion equations exhibit singularities near the boundary. Therefore, numerical methods discretized on the composite mesh, in which the mesh size is refined near the boundary, provide more precise approximations to the solutions. However, the coefficient matrices of the corresponding linear systems usually lose the diagonal dominance and are ill‐conditioned, which in turn affect the convergence behavior of the iteration methods.In this work we study a finite volume method for two‐sided fractional diffusion equations, in which a locally refined composite mesh is applied to capture the boundary singularities of the solutions. The diagonal blocks of the resulting three‐by‐three block linear system are proved to be positive‐definite, based on which we propose an efficient block Gauss–Seidel method by decomposing the whole system into three subsystems with those diagonal blocks as the coefficient matrices. To further accelerate the convergence speed of the iteration, we use T. Chan's circulant preconditioner31as the corresponding preconditioners and analyze the preconditioned matrices' spectra. Numerical experiments are presented to demonstrate the effectiveness and the efficiency of the proposed method and its strong potential in dealing with ill‐conditioned problems. While we have not proved the convergence of the method in theory, the numerical experiments show that the proposed method is convergent.  more » « less
Award ID(s):
2012291
PAR ID:
10449557
Author(s) / Creator(s):
 ;  ;  ;  ;  
Publisher / Repository:
Wiley Blackwell (John Wiley & Sons)
Date Published:
Journal Name:
Numerical Linear Algebra with Applications
Volume:
28
Issue:
5
ISSN:
1070-5325
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. This paper develops a tree-topological local mesh refinement (TLMR) method on Cartesian grids for the simulation of bio-inspired flow with multiple moving objects. The TLMR nests refinement mesh blocks of structured grids to the target regions and arrange the blocks in a tree topology. The method solves the time-dependent incompressible flow using a fractional-step method and discretizes the Navier-Stokes equation using a finite-difference formulation with an immersed boundary method to resolve the complex boundaries. When iteratively solving the discretized equations across the coarse and fine TLMR blocks, for better accuracy and faster convergence, the momentum equation is solved on all blocks simultaneously, while the Poisson equation is solved recursively from the coarsest block to the finest ones. When the refined blocks of the same block are connected, the parallel Schwarz method is used to iteratively solve both the momentum and Poisson equations. Convergence studies show that the algorithm is second-order accurate in space for both velocity and pressure, and the developed mesh refinement technique is benchmarked and demonstrated by several canonical flow problems. The TLMR enables a fast solution to an incompressible flow problem with complex boundaries or multiple moving objects. Various bio-inspired flows of multiple moving objects show that the solver can save over 80% computational time, proportional to the grid reduction when refinement is applied. 
    more » « less
  2. null (Ed.)
    We prove well-posedness and regularity of solutions to a fractional diffusion porous media equation with a variable fractional order that may depend on the unknown solution. We present a linearly implicit time-stepping method to linearize and discretize the equation in time, and present rigorous analysis for the convergence of numerical solutions based on proved regularity results. 
    more » « less
  3. Abstract The reduction of a large‐scale symmetric linear discrete ill‐posed problem with multiple right‐hand sides to a smaller problem with a symmetric block tridiagonal matrix can easily be carried out by the application of a small number of steps of the symmetric block Lanczos method. We show that the subdiagonal blocks of the reduced problem converge to zero fairly rapidly with increasing block number. This quick convergence indicates that there is little advantage in expressing the solutions of discrete ill‐posed problems in terms of eigenvectors of the coefficient matrix when compared with using a basis of block Lanczos vectors, which are simpler and cheaper to compute. Similarly, for nonsymmetric linear discrete ill‐posed problems with multiple right‐hand sides, we show that the solution subspace defined by a few steps of the block Golub–Kahan bidiagonalization method usually can be applied instead of the solution subspace determined by the singular value decomposition of the coefficient matrix without significant, if any, reduction of the quality of the computed solution. 
    more » « less
  4. null (Ed.)
    Abstract Variable-order space-fractional diffusion equations provide very competitive modeling capabilities of challenging phenomena, including anomalously superdiffusive transport of solutes in heterogeneous porous media, long-range spatial interactions and other applications, as well as eliminating the nonphysical boundary layers of the solutions to their constant-order analogues.In this paper, we prove the uniqueness of determining the variable fractional order of the homogeneous Dirichlet boundary-value problem of the one-sided linear variable-order space-fractional diffusion equation with some observed values of the unknown solutions near the boundary of the spatial domain.We base on the analysis to develop a spectral-Galerkin Levenberg–Marquardt method and a finite difference Levenberg–Marquardt method to numerically invert the variable order.We carry out numerical experiments to investigate the numerical performance of these methods. 
    more » « less
  5. A preservative scheme is presented and analyzed for the solution of a quenching type convective-diffusion problem modeled through one-sided Riemann-Liouville space-fractional derivatives. Properly weighted Grünwald formulas are employed for the discretization of the fractional derivative. A forward difference approximation is considered in the approximation of the convective term of the nonlinear equation. Temporal steps are optimized via an asymptotic arc-length monitoring mechanism till the quenching point. Under suitable constraints on spatial-temporal discretization steps, the monotonicity, positivity preservations of the numerical solution and numerical stability of the scheme are proved. Three numerical experiments are designed to demonstrate and simulate key characteristics of the semi-adaptive scheme constructed, including critical length, quenching time and quenching location of the fractional quenching phenomena formulated through the one-sided space-fractional convective-diffusion initial-boundary value problem. Effects of the convective function to quenching are discussed. Numerical estimates of the order of convergence are obtained. Computational results obtained are carefully compared with those acquired from conventional integer order quenching convection-diffusion problems for validating anticipated accuracy. The experiments have demonstrated expected accuracy and feasibility of the new method. 
    more » « less