Home  

Random  

Nearby  



Log in  



Settings  



Donate  



About Wikipedia  

Disclaimers  



Wikipedia





Finite volume method





Article  

Talk  



Language  

Watch  

Edit  





The finite volume method (FVM) is a method for representing and evaluating partial differential equations in the form of algebraic equations.[1] In the finite volume method, volume integrals in a partial differential equation that contain a divergence term are converted to surface integrals, using the divergence theorem. These terms are then evaluated as fluxes at the surfaces of each finite volume. Because the flux entering a given volume is identical to that leaving the adjacent volume, these methods are conservative. Another advantage of the finite volume method is that it is easily formulated to allow for unstructured meshes. The method is used in many computational fluid dynamics packages. "Finite volume" refers to the small volume surrounding each node point on a mesh.[2]

Finite volume methods can be compared and contrasted with the finite difference methods, which approximate derivatives using nodal values, or finite element methods, which create local approximations of a solution using local data, and construct a global approximation by stitching them together. In contrast a finite volume method evaluates exact expressions for the average value of the solution over some volume, and uses this data to construct approximations of the solution within cells.[3][4]

Example

edit

Consider a simple 1D advection problem:

  (1)

Here,   represents the state variable and   represents the flux or flow of  . Conventionally, positive   represents flow to the right while negative   represents flow to the left. If we assume that equation (1) represents a flowing medium of constant area, we can sub-divide the spatial domain,  , into finite volumesorcells with cell centers indexed as  . For a particular cell,  , we can define the volume average value of   at time   and  , as

  (2)

and at time   as,

  (3)

where   and   represent locations of the upstream and downstream faces or edges respectively of the   cell.

Integrating equation (1) in time, we have:

  (4)

where  .

To obtain the volume average of   at time  , we integrate   over the cell volume,   and divide the result by  , i.e.

  (5)

We assume that   is well behaved and that we can reverse the order of integration. Also, recall that flow is normal to the unit area of the cell. Now, since in one dimension  , we can apply the divergence theorem, i.e.  , and substitute for the volume integral of the divergence with the values of   evaluated at the cell surface (edges   and  ) of the finite volume as follows:

  (6)

where  .

We can therefore derive a semi-discrete numerical scheme for the above problem with cell centers indexed as  , and with cell edge fluxes indexed as  , by differentiating (6) with respect to time to obtain:

  (7)

where values for the edge fluxes,  , can be reconstructed by interpolationorextrapolation of the cell averages. Equation (7) is exact for the volume averages; i.e., no approximations have been made during its derivation.

This method can also be applied to a 2D situation by considering the north and south faces along with the east and west faces around a node.

General conservation law

edit

We can also consider the general conservation law problem, represented by the following PDE,

  (8)

Here,   represents a vector of states and   represents the corresponding flux tensor. Again we can sub-divide the spatial domain into finite volumes or cells. For a particular cell,  , we take the volume integral over the total volume of the cell,  , which gives,

  (9)

On integrating the first term to get the volume average and applying the divergence theorem to the second, this yields

  (10)

where   represents the total surface area of the cell and   is a unit vector normal to the surface and pointing outward. So, finally, we are able to present the general result equivalent to (8), i.e.

  (11)

Again, values for the edge fluxes can be reconstructed by interpolation or extrapolation of the cell averages. The actual numerical scheme will depend upon problem geometry and mesh construction. MUSCL reconstruction is often used in high resolution schemes where shocks or discontinuities are present in the solution.

Finite volume schemes are conservative as cell averages change through the edge fluxes. In other words, one cell's loss is always another cell's gain!

See also

edit

References

edit
  1. ^ LeVeque, Randall (2002). Finite Volume Methods for Hyperbolic Problems. ISBN 9780511791253.
  • ^ Wanta, D.; Smolik, W. T.; Kryszyn, J.; Wróblewski, P.; Midura, M. (October 2021). "A Finite Volume Method using a Quadtree Non-Uniform Structured Mesh for Modeling in Electrical Capacitance Tomography". Proceedings of the National Academy of Sciences, India Section A: Physical Sciences. 92 (3): 443–452. doi:10.1007/s40010-021-00748-7.
  • ^ Fallah, N. A.; Bailey, C.; Cross, M.; Taylor, G. A. (2000-06-01). "Comparison of finite element and finite volume methods application in geometrically nonlinear stress analysis". Applied Mathematical Modelling. 24 (7): 439–455. doi:10.1016/S0307-904X(99)00047-5. ISSN 0307-904X.
  • ^ Ranganayakulu, C. (Chennu) (2 February 2018). "Chapter 3, Section 3.1". Compact heat exchangers : analysis, design and optimization using FEM and CFD approach. Seetharamu, K. N. Hoboken, NJ. ISBN 978-1-119-42435-2. OCLC 1006524487.{{cite book}}: CS1 maint: location missing publisher (link)
  • Further reading

    edit
    edit

    Retrieved from "https://en.wikipedia.org/w/index.php?title=Finite_volume_method&oldid=1225913166"
     



    Last edited on 27 May 2024, at 13:43  





    Languages

     


    Català
    Deutsch
    Español
    فارسی
    Français

    Italiano
    Magyar

    Português
    Русский
    Türkçe
    Українська

     

    Wikipedia


    This page was last edited on 27 May 2024, at 13:43 (UTC).

    Content is available under CC BY-SA 4.0 unless otherwise noted.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Terms of Use

    Desktop