About: Tridiagonal matrix algorithm is a research topic. Over the lifetime, 1070 publications have been published within this topic receiving 21084 citations.
TL;DR: The formulation for low Mach number is presented, valid for most cases of reactive flows, and the large-eddy simulations formulation is discussed as an improvement of Reynolds averaged Navier-Stokes (RANS) formulation, which is less expensive than direct numerical simulations (DNS) formulation.
Abstract: First, the Cartesian and generalized coordinate systems and the coordinate transformation are introduced. We also discuss the method of virtual boundaries and the need to introduce a forcing term to represent the geometry. Next, we present the formulation for low Mach number, valid for most cases of reactive flows. Then the large-eddy simulations formulation is discussed as an improvement of Reynolds averaged Navier-Stokes (RANS) formulation, which is less expensive than direct numerical simulations (DNS) formulation. Subsequently, for a reactive flow model, the equations of momentum, energy, enthalpy, and chemical species are written as a general equation, which is approximated by methods of finite difference, finite volume, and finite element, to be integrated by Runge-Kutta methods. After that, approximations of order 3 and 4 are given, as well as some compact schemes of order of approximation 6. Then, we discuss some of the main methods used in the flow solution such as Gauss-Seidel, simplified Runge-Kutta, tridiagonal matrix algorithm (TDMA), Newton, strongly modified implicit procedure (MSI), and LU-SSOR, which is an LU decomposition with the introduction of dissipation. Then, we indicate some methods for solving stiff systems of equations, such as Newton’s method and Rosenbrock’s method, which can be seen as a combination of the methods of Newton and Runge-Kutta. After that, the principal boundary conditions, such as permeable and impermeable wall, symmetry and cut, far field and periodic are given, which are common in jet diffusion flames, and in reactive flows in porous media. Finally, some techniques for the acceleration of convergence as local time-stepping, residual smoothing, and the multigrid technique are introduced. Moreover, some numerical implementation details and the analysis of uncertainties for the solution of reactive flows is discussed.
TL;DR: The main goal in this paper is to find the upper and lower bounds for GMRES residuals on normal tridiagonal Toeplitz linear systems, andLower bounds for residuals of GMRES on solving non-normal tridi diagonal ToePLitzlinear systems.
Abstract: The generalized minimal residual GMRES method is widely used to solve a linear system . This paper establishes upper and lower bounds for GMRES residuals for solving an tridiagonal Toeplitz linear system. For normal matrix A, this problem has been studied previously by Li [Convergence of CG and GMRES on a tridiagonal Toeplitz linear system, BIT 473 2007, 577–599.]. Also, Li and Zhang [The rate of convergence of GMRES on a tridiagonal Toeplitz linear system, Numer. Math. 112 2009, pp. 267–293.] for non-symmetric matrix A, presented upper bound for GMRES residuals. In fact, our main goal in this paper is to find the upper and lower bounds for GMRES residuals on normal tridiagonal Toeplitz linear systems, and lower bounds for residuals of GMRES on solving non-normal tridiagonal Toeplitz linear systems.
TL;DR: A parallel algorithm,PPD algorithm, for the solution of diagonally dominant tridiagonal linear systems, and the results show that speedup improves linearly and the efficiency of the method is up to 90%.
Abstract: This paper gives a parallel algorithm,PPD algorithm, for the solution of diagonally dominant tridiagonal linear systems. Its computation complexity is about as same as the best sequential algorithm and its communication complexity is a constant. But now the computation and communication complexity of the best parallel algorithm are about 17 n and log P . It implements PPD algorithm on a MPP supercomputer. The results show that speedup improves linearly and the efficiency of our method is up to 90%.
TL;DR: A new parallel algorithm for solving positive definite symmetric tridiagonal systems of linear equations is presented, which generalizes to the band and block tridiagon cases and has a redundancy of two.
Abstract: A new parallel algorithm for solving positive definite symmetric tridiagonal systems of linear equations is presented. It generalizes to the band and block tridiagonal cases. It is called the middle p-way BABE (burn at both ends) algorithm. It has a redundancy of two: The best serial algorithm requires 3N multiply-adds, 2N multiplies and N divides. This algorithm requires 6N/p multiple-adds, 5N/p multiplies and N/p divides. There is only one global communication step which is an all-to-all concatenation of six double words from each process.
TL;DR: In this article, the authors propose a method of disassembling a set of disassembly points, called DISSERTATION, which is based on disassemblage-of-dispersal.