Composition constants for raising the orders of unconventional schemes for ordinary differential equations

Many models of physical and chemical processes give rise to ordinary differential equations with special structural properties that go unexploited by general-purpose software designed to solve numerically a wide range of differential equations. If those properties are to be exploited fully for the sake of better numerical stability, accuracy and/or speed, the differential equations may have to be solved by unconventional methods. This short paper is to publish composition constants obtained by the authors to increase efficiency of a family of mostly unconventional methods, called reflexive.

     

高精度TVD有限差分格式的自由梯度条件

1自由流条件守恒性气动方程组的高精度TVD有限差分格式一般通过使用通量限制器加入非线性的人工粘性来构成。在曲线坐标系中，通量限制器比较的两个因子与各自所在单元的界面雅可比转换行列式相关。为了消除畸变网格单元界面雅可比转换行列式的变化对通量限制器比较结果的影响，本文提出了高精度TVD格式的自由梯度性质，并分别就Osher和HartenTVD格式讨论了同时满足自由流和自由梯度的度量张量计算方法，使高精度TVD格式在畸变网格上得以实现。任意曲线坐标系中守恒型二维欧拉方程表示为其中，E、F为笛卡尔坐标系中的通量；J为坐标变…     

Asynchronous and corrected-asynchronous finite difference solutions of PDEs on MIMD multiprocessors

A major problem in achieving significant speed-up on parallel machines is the overhead involved with synchronizing the concurrent processes. Removing the synchronization constraint has the potential of speeding up the computation, while maintaining greater computation flexibility (e.g. differences in processors speed; differences in the data input to processors). We construct asynchronous (AS) finite difference schemes for the solution of PDEs by removing the synchronization constraint. We analyze the numerical properties of these schemes. Based on the analysis, we develop corrected-asynchronous (CA) finite difference schemes which are specifically constructed for an asynchronous processing. We present asynchronous (AS) and corrected-asynchronous (CA) finite difference schemes for the multi-dimensional heat equation. Although our discussion concentrates on the Euler scheme it should serve only as a sample, as it can be extended to other schemes and other PDEs.These schemes are implemented on the shared-memory multi-userSequent Balance machine. Numerical results for one and two dimensional problems are presented. It is shown experimentally that synchronization penalty can be about 50% of run time: in most cases, the asynchronous scheme runs twice as fast as the parallel synchronous scheme. In general, the efficiency of the parallel schemes increases with processor load, with the time-level, and with the problem dimension. The efficiency of the AS may reach 90% and over, but it provides accurate results only for steady-state values. The CA, on the other hand, is less efficient but provides more accurate results for intermediate (non steady-state) values. The results show the potential of developing asynchronous finite deference schemes for steady-state as well as non steadystate problems.This research was partially supported by a grant from The Basic Research Foundation administrated by The Israel Academy of Sciences and Humanities.A reduced version of the paper was presented at the 4th SIAM Conference on Parallel Processing for Scientific Computing, Dec. 11–13, 1989, Chicago, USA.The work by this author was supported by research grant 337 of the Israeli National Council for Research and Development in the years 1990–1991.This research was supported by the National Aeronautics and Space Administration under NASA Contract No. NASI-18107 while the author was in residence at the Institute for Computer Applications in Sciences and Engineering (ICASE), NASA Langley Research Center, Hampton, VA 23665, USA.     

Parameterized families of finite difference schemes for the wave equation

This article is devoted to an analysis of simple families of finite difference schemes for the wave equation. These families are dependent on several free parameters, and methods for obtaining stability bounds as a function of these parameters are discussed in detail. Access to explicit stability bounds such as those derived here may, it is hoped, lead to optimization techniques for so‐called spectral‐like methods, which are difference schemes dependent on many free parameters (and for which maximizing the order of accuracy may not be the defining criterion). Though the focus is on schemes for the wave equation in one dimension, the analysis techniques are extended to two dimensions; implicit schemes such as ADI methods are examined in detail. Numerical results are presented. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 463–480, 2004.     

A note on flux limiting for diffusion discretizations

In this note, a limiting technique is presented to enforcemonotonicity for higher-order spatial diffusion discretizations.The aim is to avoid spurious oscillations and to improve thequalitative behaviour on coarse grids. The technique is relatedto known ones for convection equations, using limiters to boundthe numerical fluxes. Applications arise in pattern formationproblems for reaction–diffusion equations.     

Numerical solution of the steady incompressible Navier—Stokes equations for the flow past a sphere by a multigrid defect correction technique

A nested non-linear multigrid algorithm is developed to solve the Navier–Stokes equations which describe the steady incompressible flow past a sphere. The vorticity–streamfunction formulation of the Navier–Stokes equations is chosen. The continuous operators are discretized by an upwind finite difference scheme. Several algorithms are tested as smoothing steps. The multigrid method itself provides only a first-order-accurate solution. To obtain at least second-order accuracy, a defect correction iteration is used as outer iteration. Results are reported for Re = 50, 100, 400 and 1000.     

A numerical study of flow over a confined backward-facing step

Numerical solutions using the SIMPLE algorithms for laminar flow over a backward-facing step are presented. Five differencing schemes were used: hybrid; quadratic upwind (QUICK); second-order upwind (SOUD); central-differencing and a novel scheme named second-order upwind biased (SOUBD). The SOUBD scheme is shown to be part of a family of schemes which include the central-differencing, SOUD and QUICK schemes for uniform grids. The results of the backward-facing step problem are presented and are compared with other numerical solutions and experimental data to evaluate the accuracy of the differencing schemes. The accuracy of the differencing schemes was ascertained by using uniform grids of various grid densities. The QUICK, SOUBD and SOUD schemes gave very similar accurate results. The hybrid scheme suffered from excessive diffusion except for the finest grids and the central-differencing scheme only converged for the finest grids.     

Twisted cubics, bis

We consider the smooth compactification constructed in [12] for a space of varieties like twisted cubics. We show this compactification embeds naturally in a product of flag varieties.Partially supported by CNPq, Pronex (ALGA)     

Performance analysis of test scheduling schemes for a multi-access communications network

In this paper, we investigate the performance of two implementable test scheduling schemes for a multi-access communication channel whose components are subject to failure or malfunction. We relate the reliability of the system design, as reflected by system failure rate parameters, and the frequency at which the system (or nodal subsystem) is tested for failure detection, to the underlying key message delay and throughput performance. We derive queue-size distribution results for a discreteGeom ^(X)/D/1 system, representing the operation of the multi-access channel, or of a network node operating as a communications or queueing processor, which is maintained by a periodic or near periodic test scheduling scheme. Explicit formulas are presented for the system behavior as exhibited by the generating functions of the system queue-size distributions. The mean message delay is then calculated. The mean delay (or mean system size/workload performance index) can then be optimized by selecting the proper scheme parameters, under specified system (and component) failure conditions, noting that performing a test at too high a rate leads to inefficient system bandwidth utilization, while if tests are not carried out often enough, excessive message (or task) retransmissions and delays ensue.