Struggling to understand research papers? Don’t panic! Get simple explanations to your questions. Learn more

scispace - formally typeset
SciSpace - Your AI assistant to discover and understand research papers | Product Hunt

Topic

Discretization

About: Discretization is a(n) research topic. Over the lifetime, 53069 publication(s) have been published within this topic receiving 1077475 citation(s).
Papers
More filters

Book
Roger Temam1
01 Jan 1979
TL;DR: This paper presents thediscretization of the Navier-Stokes Equations: General Stability and Convergence Theorems, and describes the development of the Curl Operator and its application to the Steady-State Naviers' Equations.
Abstract: I. The Steady-State Stokes Equations . 1. Some Function Spaces. 2. Existence and Uniqueness for the Stokes Equations. 3. Discretization of the Stokes Equations (I). 4. Discretization of the Stokes Equations (II). 5. Numerical Algorithms. 6. The Penalty Method. II. The Steady-State Navier-Stokes Equations . 1. Existence and Uniqueness Theorems. 2. Discrete Inequalities and Compactness Theorems. 3. Approximation of the Stationary Navier-Stokes Equations. 4. Bifurcation Theory and Non-Uniqueness Results. III. The Evolution Navier-Stokes Equations . 1. The Linear Case. 2. Compactness Theorems. 3. Existence and Uniqueness Theorems. (n < 4). 4. Alternate Proof of Existence by Semi-Discretization. 5. Discretization of the Navier-Stokes Equations: General Stability and Convergence Theorems. 6. Discretization of the Navier-Stokes Equations: Application of the General Results. 7. Approximation of the Navier-Stokes Equations by the Projection Method. 8. Approximation of the Navier-Stokes Equations by the Artificial Compressibility Method. Appendix I: Properties of the Curl Operator and Application to the Steady-State Navier-Stokes Equations. Appendix II. (by F. Thomasset): Implementation of Non-Conforming Linear Finite Elements. Comments.

4,246 citations


Journal ArticleDOI
TL;DR: This paper is concerned with the mathematical structure of the immersed boundary (IB) method, which is intended for the computer simulation of fluid–structure interaction, especially in biological fluid dynamics.
Abstract: This paper is concerned with the mathematical structure of the immersed boundary (IB) method, which is intended for the computer simulation of fluid–structure interaction, especially in biological fluid dynamics. The IB formulation of such problems, derived here from the principle of least action, involves both Eulerian and Lagrangian variables, linked by the Dirac delta function. Spatial discretization of the IB equations is based on a fixed Cartesian mesh for the Eulerian variables, and a moving curvilinear mesh for the Lagrangian variables. The two types of variables are linked by interaction equations that involve a smoothed approximation to the Dirac delta function. Eulerian/Lagrangian identities govern the transfer of data from one mesh to the other. Temporal discretization is by a second-order Runge–Kutta method. Current and future research directions are pointed out, and applications of the IB method are briefly discussed. Introduction The immersed boundary (IB) method was introduced to study flow patterns around heart valves and has evolved into a generally useful method for problems of fluid–structure interaction. The IB method is both a mathematical formulation and a numerical scheme. The mathematical formulation employs a mixture of Eulerian and Lagrangian variables. These are related by interaction equations in which the Dirac delta function plays a prominent role. In the numerical scheme motivated by the IB formulation, the Eulerian variables are defined on a fixed Cartesian mesh, and the Lagrangian variables are defined on a curvilinear mesh that moves freely through the fixed Cartesian mesh without being constrained to adapt to it in any way at all.

3,628 citations


Journal ArticleDOI
Abstract: A non-iterative method for handling the coupling of the implicitly discretised time-dependent fluid flow equations is described. The method is based on the use of pressure and velocity as dependent variables and is hence applicable to both the compressible and incompressible versions of the transport equations. The main feature of the technique is the splitting of the solution process into a series of steps whereby operations on pressure are decoupled from those on velocity at each step, with the split sets of equations being amenable to solution by standard techniques. At each time-step, the procedure yields solutions which approximate the exact solution of the difference equations. The accuracy of this splitting procedure is assessed for a linearised form of the discretised equations, and the analysis indicates that the solution yielded by it differs from the exact solution of the difference equations by terms proportional to the powers of the time-step size. By virtue of this, it is possible to dispense with iteration, thus resulting in an efficient implicit scheme while retaining simplicity of implementation relative to contemporary block simultaneous methods. This is verified in a companion paper which presents results of computations carried out using the method.

3,486 citations


Proceedings Article
01 Sep 1993
TL;DR: This paper addresses the use of the entropy minimization heuristic for discretizing the range of a continuous-valued attribute into multiple intervals.
Abstract: Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This paper addresses the use of the entropy minimization heuristic for discretizing the range of a continuous-valued attribute into multiple intervals.

3,133 citations


Journal ArticleDOI
Ted Belytschko1, Y. Krongauz1, D. Organ1, Mark Fleming1, Petr Krysl1 
TL;DR: Meshless approximations based on moving least-squares, kernels, and partitions of unity are examined and it is shown that the three methods are in most cases identical except for the important fact that partitions ofunity enable p-adaptivity to be achieved.
Abstract: Meshless approximations based on moving least-squares, kernels, and partitions of unity are examined. It is shown that the three methods are in most cases identical except for the important fact that partitions of unity enable p-adaptivity to be achieved. Methods for constructing discontinuous approximations and approximations with discontinuous derivatives are also described. Next, several issues in implementation are reviewed: discretization (collocation and Galerkin), quadrature in Galerkin and fast ways of constructing consistent moving least-square approximations. The paper concludes with some sample calculations.

2,954 citations


Network Information
Related Topics (5)
Partial differential equation

70.8K papers, 1.6M citations

92% related
Boundary value problem

145.3K papers, 2.7M citations

92% related
Differential equation

88K papers, 2M citations

90% related
Nonlinear system

208.1K papers, 4M citations

89% related
Finite element method

178.6K papers, 3M citations

87% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2022132
20212,990
20202,968
20192,842
20182,654
20172,663