.png){kind=icon}
返回
Numerical algorithms for solving comrade linear systems based on tridiagonal solvers
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.08.029.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, two efficient algorithms for solving comrade linear systems have been proposed by Karawia [A. A. Karawia, Two algorithms for solving comrade linear systems, Appl. Math. Comput. 189 (2007) 291-297]. The two algorithms are based on the LU decomposition of the comrade matrix. In this paper, two algorithms are presented for solving the comrade linear systems based on the use of conventional fast tridiagonal solvers and an efficient way of evaluating the determinant of the comrade matrix is discussed. (C) 2007 Elsevier Inc. All rights reserved.
Keyword:
comrade matrices
tridiagonal matrices
linear systems
determinants
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
A rare case of paediatric primary central nervous system lymphoma treated with high-dose methotrexate and rituximab-based chemoimmunotherapy and whole brain radiotherapy followed by tumour bed boost with three-dimensional conformal radiation technique一例接受大剂量甲氨蝶呤和利妥昔单抗为基础的化免疫疗法及全脑放射治疗，随后采用三维适形放射技术进行肿瘤床推量放疗的儿科原发性中枢神经系统淋巴瘤的罕见病例。
.png){kind=icon}
PREAI
分享收藏