Search

Your search keyword '"Ji Teng"' showing total 11 results
Start Over Author "Ji Teng" Topic linear systems
11 results on '"Ji Teng"'

4. A New Computational Algorithm for Solving Periodic Sevendiagonal Linear Systems

Author

Lin, Xiao-Lin, Jia, Ji-Teng, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Wang, Fu Lee, editor, Deng, Hepu, editor, Gao, Yang, editor, and Lei, Jingsheng, editor

Published
2010
Full Text
View/download PDF

9. A new algorithm for solving nearly penta-diagonal Toeplitz linear systems

Author

Ji-Teng Jia, Qiongxiang Kong, and Tomohiro Sogabe

Subjects
Maple, Linear system, Diagonal, MathematicsofComputing_NUMERICALANALYSIS, Order (ring theory), Linear systems, engineering.material, Symbolic computation, Sherman–Morrison–Woodbury formula, Toeplitz matrix, Algebra, Computational Mathematics, Computational Theory and Mathematics, Nearly penta-diagonal matrices, Toeplitz matrices, Modelling and Simulation, Modeling and Simulation, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, engineering, Computer Science::Symbolic Computation, MATLAB, computer, Algorithm, computer.programming_language, Mathematics
Abstract

A new numerical algorithm for solving nearly penta-diagonal Toeplitz linear systems is presented. The algorithm is suited for implementation using Computer Algebra Systems (CASs) such as MATLAB, MACSYMA and MAPLE. Numerical examples are given in order to illustrate the efficiency of our algorithm.

Published
2012

10. A novel algorithm and its parallelization for solving nearly penta-diagonal linear systems.

Author

Jia, Ji-Teng and Sogabe, Tomohiro

Subjects
*LINEAR systems, *PROBLEM solving, *ALGEBRA software, *PARALLEL algorithms, *MATHEMATICAL decomposition, *NUMERICAL analysis
Abstract

In the current paper, a new serial algorithm for solving nearly penta-diagonal linear systems is presented. The computational cost of the algorithm is less than or almost equal to those of recent successful algorithms [J. Jia, Q. Kong, and T. Sogabe,A fast numerical algorithm for solving nearly penta-diagonal linear systems, Int. J. Comput. Math. 89 (2012), pp. 851–860; X.G. Lv and J. Le,A note on solving nearly penta-diagonal linear systems, Appl. Math. Comput. 204 (2008), pp. 707–712; S.N. Neossi Nguetchue and S. Abelman,A computational algorithm for solving nearly penta-diagonal linear systems, Appl. Math. Comput. 203 (2008), pp. 629–634]. Moreover, it is suitable for developing its parallel algorithms. One of the parallel algorithms is given and is shown to be promising. The implementation of the algorithms using Computer Algebra Systems such as MATLAB and MAPLE is straightforward. Two numerical examples are given in order to illustrate the validity and efficiency of our algorithms. [ABSTRACT FROM PUBLISHER]

Published
2013
Full Text
View/download PDF

11. A fast numerical algorithm for solving nearly penta-diagonal linear systems.

Author

Jia, Ji-teng, Kong, Qiong-xiang, and Sogabe, Tomohiro

Subjects
*MATHEMATICAL analysis, *LINEAR systems, *DETERMINANTS (Mathematics), *ALGEBRA software, *COMPUTER algorithms, *NUMERICAL analysis, *MATRICES (Mathematics)
Abstract

In this paper, we present a fast numerical algorithm for solving nearly penta-diagonal linear systems and show that the computational cost is less than those of three algorithms in El-Mikkawy and Rahmo, [Symbolic algorithm for inverting cyclic penta-diagonal matrices recursively–Derivation and implementation, Comput. Math. Appl. 59 (2010), pp. 1386–1396], Lv and Le [A note on solving nearly penta-diagonal linear systems, Appl. Math. Comput. 204 (2008), pp. 707–712] and Neossi Nguetchue and Abelman [A computational algorithm for solving nearly penta-diagonal linear systems, Appl. Math. Comput. 203 (2008), pp. 629–634.]. In addition, an efficient way of evaluating the determinant of a nearly penta-diagonal matrix is also discussed. The algorithm is suited for implementation using computer algebra systems (CAS) such as MATLAB, MACSYMA and MAPLE. Some numerical examples are given in order to illustrate the efficiency of our algorithm. [ABSTRACT FROM AUTHOR]

Published
2012
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results