A new discretization method for calculating a sampled-data representation of a nonlinear continuous-time system is proposed. The proposed method is based on the wellknown Taylor series expansion and zero-order hold (ZOH) assumption. The mathematical structure of the new discretization method is analyzed. On the basis of this structure, a sampled-data representation of a nonlinear system with a ...

r. ewing, o. liev, r. lazarov and a. naumovich in [1] proposed a finite volume discretization for one dimensional biot poroelasticity system in multilayer domains. their discretization and exact solution are invalid. we derive valid discretization and exact solution. finally, our numerical solution is compared with known exact solution in discrete l2 norm.

In this paper we present an efficient discretization method for the solution of the unsteady incompressible Navier-Stokes equations based on a high order (Hybrid) Discontinuous Galerkin formulation. The crucial component for the efficiency of the discretization method is the disctinction between stiff linear parts and less stiff non-linear parts with respect to their temporal and spatial treatm...

In this paper we discuss the numerical solution of initial-boundary value problem for the fourth order parabolic partial integro-differential equation. We use the forward Euler scheme for time discretization and the quasi-wavelet method for space discretization. Sometimes, we give a new method about the treatment of boundary condition. Numerical experiment is included to demonstrate the validit...

In this talk we consider the finite element discretization of the Immersed Boundary Method (IBM) introduced by Peskin [6] for fluid-structure interaction problems. With respect to the original finite differences discretization the finite element approach can take advantage from the variational formulation in handling the Dirac delta function which takes into account the presence of the structur...

In this paper, we describe a comparison of two spatial discretization schemes for the advection equation, namely the first finite difference method and the method of lines. The stability of the methods has been studied by Von Neumann method and with the matrix analysis. The methods are applied to a number of test problems to compare the accuracy and computational efficiency. We show that both d...

Discretization is used in click-based graphical passwords so that approximately correct entries can be accepted by the system. We show that the existing discretization scheme of Birget et al.(2006) allows for false accepts and false rejects because the tolerance region is not guaranteed to be centered on the original click-point, causing usability and security concerns. Using empirical data fro...

The performance of many machine learning algorithms can be substantially improved with a proper discretization scheme. In this paper we describe a theoretically rigorous approach to discretization of continuous attribute values, based on a Bayesian clustering framework. The method produces a probabilistic scoring metric for diierent discretizations, and it can be combined with various types of ...

Spectral discretization methods are well established methods for the computation of characteristic roots of time-delay systems. In this paper a method is presented for computing all characteristic roots in a given right half plane. In particular, a procedure for the automatic selection of the number of discretization points is described. This procedure is grounded in the connection between a sp...

This paper describes a state space discretization scheme based on statistical experimental designs generated from orthogonal arrays of strength three with index unity. Chen et al. (1999) employed this eecient discretization scheme in a numerical solution method for high-dimensional continuous-state stochastic dynamic programming (SDP). These OAs are instrumental in reducing the dimensionality o...