Topic
Tridiagonal matrix algorithm
About: Tridiagonal matrix algorithm is a research topic. Over the lifetime, 1070 publications have been published within this topic receiving 21084 citations.
Papers published on a yearly basis
1 / 2
Papers
9 May 2010
TL;DR: In this article, a triangular decomposition method with controlling parameter for cyclic block tridiagonal systems is presented, which can reduce the computation time over 40% more than the directly triangulation method.
Abstract: A triangular decomposition method with controlling parameter for cyclic block tridiagonal systems is presented. Numerical example show that the method can reduce the computation time over 40% more than the directly triangular decomposition method.
TL;DR: In this article, the authors investigated compact interpo- lation problems in tridiagonal algebra, where given vectors x and y in a Hilbert space, when is there a compact operator A in a tridimensional algebra such that Ax = y?
Abstract: Given vectors x and y in a Hilbert space, an inter- polating operator is a bounded operator T such that Tx = y An interpolating operator for n vectors satisfies the equation Txi = yi, for i = 1;2;¢¢¢ ;n In this article, we investigate compact interpo- lation problems in tridiagonal algebra : Given vectors x and y in a Hilbert space, when is there a compact operator A in a tridiagonal algebra such that Ax = y ?
1 Jan 2016
TL;DR: In this paper, the remaining small terms upon dominant balance, if retained the essential physics of the original equation, may exist as an additional equation, and application of this additional equation appears to reduce the unclosed governing equations for the two-dimensional turbulent flow to closed ones.
Abstract: This study introduces a new mathematical approach (NMA) stating that the remaining small terms upon dominant balance, if retains the essential physics of the original equation, may exist as an additional equation. Application of this additional equation appears to reduce the unclosed governing equations for the two-dimensional turbulent flow to closed ones. The closed form equations due to NMA for the turbulent boundary layer and round jet are solved using a Fully Implicit Numerical Scheme and the Tridiagonal Matrix Algorithm. An overall agreement of the obtained results with the existing database for both types of flow show the capability of NMA in solving the complete closure problem of turbulence.
13 Dec 2010
TL;DR: In this paper, the upper bounds on the inverse elements of strictly diagonally dominant periodic adding element tridiagonal matrices are given. But the upper bound is not known.
Abstract: Strictly diagonally dominant periodic adding element tridiagonal matrices play a very important role in the theory and practical applications. In this paper, Motivated by the references, especially [2], we give the estimates for the upper bounds on the inverse elements of strictly diagonally dominant periodic adding element tridiagonal matrices.
24 Mar 2009
TL;DR: In this article, the authors propose to eliminate groups of unknowns in linear systems of algebraic equations by solving smaller systems whose coefficients are just coefficients in the original systems, with no matrix inversions and multiplications being involved.
Abstract: Groups of unknowns in linear systems of algebraic equations are eliminated by solving smaller systems whose coefficients are just coefficients in the original systems, with no matrix inversions and multiplications being involved. This could yield solutions with improved accuracy with respect to other solution methods. The amount of computation involved is only slightly higher than that in the Gaussian elimination.
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2025 | 3 |
| 2024 | 7 |
| 2023 | 11 |
| 2022 | 22 |
| 2021 | 14 |
| 2020 | 11 |