3 edition of An adaptive grid algorithm for one-dimensional nonlinear equations found in the catalog.
An adaptive grid algorithm for one-dimensional nonlinear equations
by National Aeronautics and Space Administration, National Technical Information Service, distributor in [Washington, DC, Springfield, Va
Written in English
|Other titles||Adaptive grid algorithm for one dimensional nonlinear equations.|
|Statement||submitted by William E. Gutierrez and Richard G. Hills.|
|Series||[NASA contractor report] -- NASA CR-190890.|
|Contributions||Hills, Richard G., United States. National Aeronautics and Space Administration.|
|The Physical Object|
An Adaptive WENO Collocation Method for Differential Equations with Random Coefficients Since the singular curve is `dense’ in the one-dimensional space, the sparse grid algorithm will generate a `local’ tensor product grid around the curve in order to resolve such a singularity of the solution. we developed an adaptive high-order Author: Wei Guo, Guang Lin, Andrew J. Christlieb, Jingmei Qiu. This is a survey on the theory of adaptive finite element methods (AFEM), which are fundamental in modern computational science and engineering. We present a self-contained and up-to-date discussion of AFEM for linear second order elliptic partial differential equations (PDEs) and dimension d >1, with emphasis on the differences and advantages Cited by:
A Generalized Feed-Forward Dynamic Adaptive Mesh Refinement and Derefinement Finite-Element Framework for Metal Laser Sintering—Part II: Nonlinear Thermal Simulations and Validations J. Manuf. Sci. Eng (June, )Cited by: Uniform convergence of a Monotone iterative method for a nonlinear reaction-diffusion problem An adaptive-grid least squares finite element solution for flow in layered soils p. Sensitivity analysis of generalized Lyapunov equations p. An algorithm to find values of minors of skew Hadamard and conference matrices p.
dijkstra_openmp, a program which uses OpenMP to parallelize a simple example of Dijkstra's minimum distance algorithm for graphs. disk_grid, a library which computes grid points within the interior of a disk of user specified radius and center in 2D, using GNUPLOT to create an image of the grid. A Fast Algorithm to Solve Non-Homogeneous Cauchy-Riemann Equations in the Complex Plane, Book of Abstracts, SIAM Annual Meeting, Washington D.C., Adaptive Computation of Porous Media Flow, Book of Abstracts, SIAM Annual Meeting, Chicago, Illinois, A New Method for One Dimensional Adaptive Grid Generation.
picture of health
Performance Plus Childrens Favorites Book 1
Farewell sermons, preached in the parish church of Sedgley
Testimony of John R. McBride before the Natural Resources Committee, Montana House of Representatives, Helena, Montana, January 24, 1976.
CDC 28th Annual Seminar on population issues in the Middle East, Africa, and Asia.
Support to basic education in Zanzibar
A complete pronouncing gazetteer or geographical dictionary of the world
DEA special agent careers.
1870 U.S. Federal Census Index
[Protest Of VA Contract Award For Oxygen Service]... 161164... B-274454.3... U.S. GAO... January 10, 1997.
U.S. commodity price supports and competitiveness of agricultural exports
Holy Bible: The Daily Devotional Bible
A new fully numerical algorithm to solve one-dimensional convection-dominated PDE was proposed. • For the spatial discretization WENO schemes on non-uniform grids in a finite volume approach were used. • Based on equidistribution principles and time-stepping control, the grid space and time step were dynamically adjusted.
•Author: Fernando Ramírez-Correa, Miguel Á ngel Gómez-García, Izabela Dobrosz-Gómez, Carlos Alberto Rojas-Sie. () New characteristic difference method with adaptive mesh for one-dimensional unsteady convection-dominated diffusion equations.
International Journal of Computer Mathematics() Uniform pointwise convergence for a singularly Cited by: () Remapping-Free Adaptive GRP Method for Multi-Fluid Flows I: One Dimensional Euler Equations. Communications in Computational Physics() A High-Order Accurate Gas-Kinetic Scheme for One- and Two-Dimensional Flow by: A method of adaptive grid refinement for the solution of the steady Euler equations for transonic flow is presented.
Algorithm automatically decides where the coarse grid accuracy is insufficient. An algorithm for creation of an optimized adaptive grid for improved explicit finite difference scheme Article (PDF Available) in WSEAS Transactions on Mathematics 7(9) January with 30 Reads.
A Wavelet-Based Adaptive Grid Method for the Resolution of Nonlinear PDEs Article in AIChE Journal 48(4) April with 18 Reads How we measure 'reads'. () An adaptive local mesh refinement method for time-dependent partial differential equations.
Applied Numerical Mathematics() An adaptive moving grid method for one-dimensional systems of partial differential by: This paper investigates the solution of one-dimensional phase field models using an adaptive grid technique. Three problems are considered: (1) the classical Stefan model, (2) the case of a solid sphere in equilibrium with its melt, and (3) a modified Stefan model with a generalized kinetic undercooling by: 4.
() An a posteriori based convergence analysis for a nonlinear singularly perturbed system of delay differential equations on an adaptive mesh. Numerical Algorithms() A robust adaptive grid method for a nonlinear singularly perturbed Cited by: In this work, we presented a new method by constructing a spectral approximation space adaptively based on a greedy algorithm for nonlinear differential equations.
(26) | α l →, i → | ≥ ϵ, for a so-called refinement threshold ϵ ≥ 0. Technically, the adaptive grid refinement can be built on top of the hierarchical grid structure. The points of the classical sparse grid form a tree-like data structure, as displayed in Fig.
4 for the one-dimensional case. Going from one level to the next, we see that there are two sons for each grid point (if l Cited by: 8. For this example, the monitor function is of the form with (α,β)=(6,).Using our moving mesh algorithm, we record data at t= (after singularity) with 30 2 and 60 2 grids.
In Fig. 7, the adaptive mesh and the approximation solutions are is seen that the problem is well resolved with 30 2 grid points, and the desired mesh adaptation effect is clearly by: This paper is the first part in a series of papers on adaptive finite element methods for parabolic problems.
In this paper, an adaptive algorithm is presented and analyzed for choosing the space and time discretization in a finite element method for a linear parabolic problem.
The finite element method uses aspace discretization with meshsize variable in space and time and a third-order Cited by: A fully implicit, nonlinear adaptive grid strategy Article in Journal of Computational Physics March with 10 Reads How we measure 'reads'. Get this from a library.
An adaptive grid algorithm for one-dimensional nonlinear equations. [William E Gutierrez; Richard G Hills; United States. National Aeronautics and Space Administration.]. Adaptive moving grid methods for two-phase flow in porous media, J. Comput. Appl. Math. An adaptive mesh redistribution method for nonlinear Hamilton-Jacobi equations in two- and three dimensions, J.
Comput. Phys. (), no. 2, A moving mesh algorithm for one-dimensional nonlinear hyperbolic conservation laws. An adaptive Huber method for nonlinear systems of Volterra integral equations with weakly singular kernels and solutions.
The present study is inspired by the class of one-dimensional Volterra integral equations (VIEs) (although the adaptive algorithm was found to operate satisfactorily also when the derivatives did not exist at t = 0).Cited by: 5.
Adaptive moving grid strategies for one-dimensional systems of partial differential equations Conference Petzold, L R Recently a scheme has been proposed for choosing a moving mesh based on minimizing the time rate of change of the solution in the moving coordinates for one-dimensional systems of PDEs.
An adaptive multigrid method is presented for the solution of the two-dimensional steady state Van Roosbroeck equations for semiconductor device modeling. The discretisation is based on the (hybrid) mixed finite element method on by: 4.
Implicit Adaptive-Grid Radiation Hydrodynamics result in a grid distribution equidistant in either r or In r. Therefore the success of the ability of the grid to detect and resolve arbitrary structures in the flow depends heavily on the quality of the structure function fs, Cited by:.
Two-Grid based Adaptive Proper Orthogonal Decomposition Algorithm for Time Dependent Partial Differential Equations (with X. Dai, X. Kuang, A. Zhou), arXiv preprint arXiv, Convergence analysis of stochastic structure-preserving schemes for computing effective diffusivity in random flows (with J.
Lyu, Z. Wang, Z. Zhang), arXiv. X. Ma, N. Zabaras, An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations. J. Comput. Phys. (8), – () MathSciNet CrossRef Google ScholarCited by: 3.This paper presents the development and verification of a computational algorithm to approximate the highly nonlinear transport equations of reactive chemical transport and multiphase flow.
The algorithm was developed based on the Lagrangian-Eulerian decoupling method with an adaptive ZOOMing and Peak/valley Capture (LEZOOMPC) scheme.