DQ Based Methods: Theory and Application to Engineering and Physical Sciences

DQ Based Methods: Theory and Application to Engineering and Physical Sciences

Stefania Tomasiello (University of Basilicata, Italy)
DOI: 10.4018/978-1-61350-116-0.ch014
OnDemand PDF Download:


Though relatively unknown, the Differential Quadrature Method (DQM) is a promising numerical technique that produces accurate solutions with less computational effort than other numerical methods such as the Finite Element Method. There are different versions of the former method, so one can refer to a class of methods based on the differential quadrature (DQ) approach. This chapter provides systematic steps to understand DQ based methods: how they work, how to use and develop them, as well as exemplary problems. It is divided into two sections: the first provides fundamentals and theories related to the DQ approach, while the second presents the application of DQ based methods to three significant problems, i.e. free vibrations of a multi-span beam (a typical model for bridge decks and floors), time dependent heat transfer, and vibrations of a rectangular membrane. The main focus is on the application of the method to space-time domains as a whole, an issue not well covered by the current literature.
Chapter Preview


A variety of numerical methods are available for solving problems in science and engineering, when analytical solutions (so-called closed-form solutions) cannot be achieved. Numerical methods are part of the field called scientific computing, which can be defined as (Golub and Ortega, 1992, p. 2):

“The collection of tools, techniques, and theories required to solve on a computer mathematical models of problems in science and engineering”.

Mathematical models very often take the form of differential equations, with initial and/or boundary conditions. The variables of the problem may depend on time and/or n-space coordinates respectively (in this latter case the problem is called n-dimensional, where n=1,2,3 usually). For example, a boundary condition can represent restraints i.e. the supports of the multi-span beam (see the first example in the final section) and an initial condition can be the initial heat profile in the time-dependent problem of heat transfer (see the second example in the final section).

Numerical computations are affected by several types of error, rounding errors are due to machine precision. Discretization errors are created when the “continuous” problem domain is substituted by a “discrete” one. The convergence error is due to the iterative nature of some numerical methods, where a finite sequence of approximations to a solution is generated. An acceptable degree of error depends on the problem being solved: for many problems in industry or engineering three digit accuracy is quite acceptable.

Discretization is the core of almost all the numerical methods (including the methods discussed in this chapter), by introducing a set of points into the problem or computational spatial domain (i.e. where the solution will be computed). These points, often equally spaced, can have different names, e.g. grid points, in the Finite Difference Method (FDM), collocation points in the collocation methods or nodes in the Finite Element Method (FEM). Choosing the points in the computational domain is achieved by constructing the approximate solution of the values at these points. This has the benefit of converting the differential equations into an algebraic system of equations that can be easily solved on a computer.

Replacing the differential equations with an algebraic system of equations can be done by approximating the derivatives of the unknown function (the solution of the problem) by formulas based on the values of the function itself at discrete points and is generally achieved in a systematic way (e.g in FDM) or by using polynomials which interpolate the function at the given points (e.g. FEM or collocation methods). How these interpolating polynomials are chosen and used is the main difference between some numerical methods. In collocation methods a finite-dimensional space of candidate solutions (usually, polynomials up to a certain degree) are chosen, so that the solution satisfies the given equation at the collocation points. The FEM approximates the solution as a linear combination of piecewise functions (usually, polynomials), that are nonzero on small sub-domains. In fact, the basic idea of FEM is to divide the spatial domain of the problem into smaller parts (or sub-domains) called finite elements or elements, connected by points called nodes, giving a topological map which is called a mesh, whereas the process of making the mesh is called mesh generation. The main advantage of the FEM is its ability to reproduce non-smooth solutions, in conjunction with the ability to handle arbitrarily shaped domains. For example, stress analysis is an important process in engineering that requires the solution of a system of partial differential equations that are very difficult to solve by analytical methods except for very simple shapes, such as rectangles; however, engineering problems seldom involve such simple shapes. For linear problems, the solution is determined by solving a system of linear equations, for a certain number of unknowns, which are the nodal values of the problem function. With regard to engineering problems, in order to obtain a reasonably accurate solution, thousands of nodes are usually needed. Generally, the accuracy of the solution improves as the number of elements (and nodes) increases, but the computing time (and hence the cost) also rises.

Key Terms in this Chapter

Boundary Conditions: The conditions that are satisfied on the boundaries of the spatial domain of the problem. The governing differential equation with the boundary conditions represents a boundary value problem (BVP)

Nodes: Points in space where finite elements are connected and where the unknowns of the algebraic equation system are computed.

Grid Points: Points are selected in the problem spatial domain where the numerical solution is computed.

FDM: The Finite Difference Method computes approximate values for the solution at grid points. To compute these values, derivatives are replaced by divided differences. This method can be useful for solving heat transfer problems, fluid mechanics problems and works well for two-dimensional regions with boundaries parallel to coordinates axes.

Meshfree Methods: Numerical method which compute the approximate solution without a predefined mesh.

Initial Conditions: For time dependent problems, the conditions that must be satisfied at the initial/start time. The governing equations with the initial conditions represent the initial value problem (IVP).

Collocation Points: see collocation methods

Collocation Methods: The approximate solution is produced by means of the values it assumes in some locations, called collocation points, where the governing differential equation is satisfied.

FEM: The Finite Element Method, computes the solution by piecewise functions being computed in smaller parts of the problem domain, called finite elements. A set of algebric equations are established and solved. It is employed extensively in the analysis of solids, structures, heat transfer and fluids. It can handle arbitrarily shaped domains.

MeSH: Topological map of the finite element spatial domain as discrete points rather than a continuous field.

Complete Chapter List

Search this Book:
Editorial Advisory Board
Table of Contents
Joanna Leng, Wes Sharrock
Chapter 1
Gabriele Jost, Alice E. Koniges
The upcoming years bring new challenges in high-performance computing (HPC) technology. Fundamental changes in the building blocks of HPC hardware... Sample PDF
Hardware Trends and Implications for Programming Models
Chapter 2
Ivan Girotto, Robert M. Farber
This chapter focuses on the technical/commercial dynamics of multi-threaded hardware architecture development, including a cost/benefit account of... Sample PDF
Multi-Threaded Architectures: Evolution, Costs, Opportunities
Chapter 3
Domingo Benitez
Many accelerator-based computers have demonstrated that they can be faster and more energy-efficient than traditional high-performance multi-core... Sample PDF
High-Performance Customizable Computing
Chapter 4
Rasit O. Topaloglu, Swati R. Manjari, Saroj K. Nayak
Interconnects in semiconductor integrated circuits have shrunk to nanoscale sizes. This size reduction requires accurate analysis of the quantum... Sample PDF
High-Performance Computing for Theoretical Study of Nanoscale and Molecular Interconnects
Chapter 5
Prashobh Balasundaram
This chapter presents a study of leading open source performance analysis tools for high performance computing (HPC). The first section motivates... Sample PDF
Effective Open-Source Performance Analysis Tools
Chapter 6
David Worth, Chris Greenough, Shawn Chin
The purpose of this chapter is to introduce scientific software developers to software engineering tools and techniques that will save them much... Sample PDF
Pragmatic Software Engineering for Computational Science
Chapter 7
Diane Kelly, Daniel Hook, Rebecca Sanders
The aim of this chapter is to provide guidance on the challenges and approaches to testing computational applications. Testing in our case is... Sample PDF
A Framework for Testing Code in Computational Applications
Chapter 8
Judith Segal, Chris Morris
There are significant challenges in developing scientific software for a broad community. In this chapter, we discuss how these challenges are... Sample PDF
Developing Software for a Scientific Community: Some Challenges and Solutions
Chapter 9
Fumie Costen, Akos Balasko
The computational architecture of Enabling Grids for E-sciencE is introduced as it made our code porting very challenging, and the discussion... Sample PDF
Opportunities and Challenges in Porting a Parallel Code from a Tightly-Coupled System to the Distributed EU Grid, Enabling Grids for E-sciencE
Chapter 10
Abid Yahya, Farid Ghani, R. Badlishah Ahmad, Mostafijur Rahman, Aini Syuhada, Othman Sidek, M. F. M. Salleh
This chapter presents performance of a new technique for constructing Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) encrypted codes based on a row... Sample PDF
Development of an Efficient and Secure Mobile Communication System with New Future Directions
Chapter 11
Hubertus J. J. van Dam
Quantum chemistry was a compute intensive field from the beginning. It was also an early adopter of parallel computing, and hence, has more than... Sample PDF
Parallel Quantum Chemistry at the Crossroads
Chapter 12
Marc Hafner, Heinz Koeppl
With the advances in measurement technology for molecular biology, predictive mathematical models of cellular processes come in reach. A large... Sample PDF
Stochastic Simulations in Systems Biology
Chapter 13
C. T. J. Dodson
Many real processes have stochastic features which seem to be representable in some intuitive sense as `close to Poisson’, `nearly random’, `nearly... Sample PDF
Some Illustrations of Information Geometry in Biology and Physics
Chapter 14
Stefania Tomasiello
Though relatively unknown, the Differential Quadrature Method (DQM) is a promising numerical technique that produces accurate solutions with less... Sample PDF
DQ Based Methods: Theory and Application to Engineering and Physical Sciences
Chapter 15
Marco Evangelos Biancolini
Radial Basis Functions (RBF) mesh morphing, its theoretical basis, its numerical implementation, and its use for the solution of industrial... Sample PDF
Mesh Morphing and Smoothing by Means of Radial Basis Functions (RBF): A Practical Example Using Fluent and RBF Morph
Chapter 16
Joanna Leng, Theresa-Marie Rhyne, Wes Sharrock
This chapter focuses on state of the art at the intersection of visualization and CSE. From understanding current trends it looks to future... Sample PDF
Visualization: Future Technology and Practices for Computational Science and Engineering
Chapter 17
Peter Sarlin
Since the 1980s, two severe global waves of sovereign defaults have occurred in less developed countries (LDCs): the LDC defaults in the 1980s and... Sample PDF
Visualizing Indicators of Debt Crises in a Lower Dimension: A Self-Organizing Maps Approach
Chapter 18
Iain Barrass, Joanna Leng
Since infectious diseases pose a significant risk to human health many countries aim to control their spread. Public health bodies faced with a... Sample PDF
Improving Computational Models and Practices: Scenario Testing and Forecasting the Spread of Infectious Disease
Chapter 19
Eldon R. Rene, Sung Joo Kim, Dae Hee Lee, Woo Bong Je, Mirian Estefanía López, Hung Suck Park
Sequencing batch reactor (SBR) is a versatile, eco-friendly, and cost-saving process for the biological treatment of nutrient-rich wastewater, at... Sample PDF
Artificial Neural Network Modelling of Sequencing Batch Reactor Performance
Chapter 20
Joanna Leng, Wes Sharrock
Computational Science and Engineering (CSE) is an emerging, rapidly developing, and potentially very significant force in changing scientific... Sample PDF
The State of Development of CSE
Chapter 21
Kerstin Kleese van Dam, Mark James, Andrew M. Walker
This chapter describes the key principles and components of a good data management system, provides real world examples of how these can be... Sample PDF
Integrating Data Management and Collaborative Sharing with Computational Science Research Processes
Chapter 22
Jens Jensen, David L. Groep
Modern science increasingly depends on international collaborations. Large instruments are expensive and have to be funded by several countries, and... Sample PDF
Security and Trust in a Global Research Infrastructure
Chapter 23
Matt Ratto
Computational science and engineering (CSE) technologies and methods are increasingly considered important tools for the humanities and are being... Sample PDF
CSE as Epistemic Technologies: Computer Modeling and Disciplinary Difference in the Humanities
Chapter 24
Phillip L. Manning, Peter L. Falkingham
Dinosaurs successfully conjure images of lost worlds and forgotten lives. Our understanding of these iconic, extinct animals now comes from many... Sample PDF
Science Communication with Dinosaurs
About the Contributors