Results 1 - 10 of 38,777

Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes

by P. L. Roe - J. COMP. PHYS , 1981
"... Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution ..."
Abstract - Cited by 1010 (2 self) - Add to MetaCart
Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution

Bayes Finite Difference Schemes

by Alex Solomonoff , 1993
"... Bayes finite difference schemes are an alternative version of nite difference schemes. They are derived by constructing an expression for the average error of a scheme, and then minimizing the error over all possible versions of finite difference schemes. Optimum schemes are constructed for several ..."
Abstract - Add to MetaCart
Bayes finite difference schemes are an alternative version of nite difference schemes. They are derived by constructing an expression for the average error of a scheme, and then minimizing the error over all possible versions of finite difference schemes. Optimum schemes are constructed for several

The Askey-scheme of hypergeometric orthogonal polynomials and its q-analogue

by Roelof Koekoek, René F. Swarttouw , 1998
"... We list the so-called Askey-scheme of hypergeometric orthogonal polynomials and we give a q-analogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order differenti ..."
Abstract - Cited by 578 (6 self) - Add to MetaCart
differential or difference equation, the forward and backward shift operator, the Rodrigues-type formula and generating functions of all classes of orthogonal polynomials in this scheme. In chapter 2 we give the limit relations between different classes of orthogonal polynomials listed in the Askey-scheme

A comparative analysis of selection schemes used in genetic algorithms

by David E. Goldberg, Kalyanmoy Deb - Foundations of Genetic Algorithms , 1991
"... This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference or d ..."
Abstract - Cited by 531 (31 self) - Add to MetaCart
This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference

On the Stability of Certain Difference Schemes* By

by Thomas I. Seidman
"... The von Neumann stability criterion is employed in analyzing the stability of a class of difference schemes for initial-value problems involving linear parabolic partial differential equations, u t = A u. It is shown that, contrary to the usual rule of thumb, there exist completely implicit differen ..."
Abstract - Add to MetaCart
The von Neumann stability criterion is employed in analyzing the stability of a class of difference schemes for initial-value problems involving linear parabolic partial differential equations, u t = A u. It is shown that, contrary to the usual rule of thumb, there exist completely implicit

Numerical Solutions of the Euler Equations by Finite Volume Methods Using Runge-Kutta Time-Stepping Schemes

by Antony Jameson, Wolfgang Schmidt, Eli Turkel , 1981
"... A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used to deter ..."
Abstract - Cited by 517 (78 self) - Add to MetaCart
A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used

A modular three-dimensional finite-difference ground-water flow model

by Model (michael Mcdonald, Arlen Harbaugh - U.S. Geological Survey Techniques of WaterResources Investigations Book 6, Chapter A1 , 1988
"... The primary objective of this course is to discuss the principals of finite difference methods and their applications in groundwater modeling. The emphasis of the class lectures is on the theoretical aspects of numerical modeling (finite difference method). Steps involved in simulation of groundwate ..."
Abstract - Cited by 508 (5 self) - Add to MetaCart
of groundwater systems under various initial/boundary conditions and management schemes will be practiced. The emphasis of the student presentations will be based on published papers concerning the applied aspects of groundwater computer modeling utilizing finite difference and analytical computer models

A Transmission Control Scheme for Media Access in Sensor Networks

by Alec Woo, David E. Culler , 2001
"... We study the problem of media access control in the novel regime of sensor networks, where unique application behavior and tight constraints in computation power, storage, energy resources, and radio technology have shaped this design space to be very different from that found in traditional mobile ..."
Abstract - Cited by 481 (11 self) - Add to MetaCart
We study the problem of media access control in the novel regime of sensor networks, where unique application behavior and tight constraints in computation power, storage, energy resources, and radio technology have shaped this design space to be very different from that found in traditional mobile

Shape modeling with front propagation: A level set approach

by Ravikanth Malladi, James A. Sethian, Baba C. Vemuri - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1995
"... Shape modeling is an important constituent of computer vision as well as computer graphics research. Shape models aid the tasks of object representation and recognition. This paper presents a new approach to shape modeling which retains some of the attractive features of existing methods and over- ..."
Abstract - Cited by 808 (20 self) - Add to MetaCart
of object boundaries. The resulting equation of motion is solved by employing entropy-satisfying upwind finite difference schemes. We present a variety of ways of computing evolving front, including narrow bands, reinitializations, and different stopping criteria. The efficacy of the scheme is demonstrated

Efficient Implementation of Weighted ENO Schemes

by Guang-shan Jiang, Chi-wang Shu , 1995
"... In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially non-oscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order accur ..."
Abstract - Cited by 412 (38 self) - Add to MetaCart
In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially non-oscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order
Results 1 - 10 of 38,777