Block-marching in time with DQ discretization: an efficient method for time-dependent problems

By Chi-Wang Shu, Qinghe Yao, K. S. Yeo. 2002

63 citations recorded by the source corpus.

Abstract In this paper, an efficient method is presented to solve time-dependent problems. The proposed method marches in the time direction block by block. In each block, there are several time levels, and the numerical results at these time levels are obtained simultaneously. The global method of differential quadrature is applied in each block to discretize both the spatial and temporal derivatives. The proposed method is validated by a sample problem, which has an exact solution for easy comparison. It was found that as compared to the conventional 4-stage Runge–Kutta method, the present method could give much higher order of accuracy for numerical results and require much less computational effort.

Subfields: Computational Mechanics, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/c78cff44fa15bfc7f84e94eba4677abf93021df6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

1. S. Khalili
2. S. Ali Eftekhari
3. Ö. Civalek
4. Afshar Jafari

In Numerical Analysis

1. S. Khalili
2. S. Ali Eftekhari
3. Ö. Civalek
4. Afshar Jafari

Citations in the corpus

• Nonlinear analysis of thin rectangular plates on Winkler–Pasternak elastic foundations by DSC–HDQ methods (2007, methodology): “[59] developed block-marching technique in both the spatial and temporal directions by DQ method for time-dependent problems.”
• A MIXED RITZ-DQ METHOD FOR FORCED VIBRATION OF FUNCTIONALLY GRADED BEAMS CARRYING MOVING LOADS (2010, methodology): “Shu [29] proposed a block marching technique with DQ discretization for the solution of timedependent problems.”