数値解析セミナー

過去の記録 ~06/14次回の予定今後の予定 06/15~

開催情報 火曜日 16:30~18:00 数理科学研究科棟(駒場) 002号室
担当者 齊藤宣一、柏原崇人
セミナーURL https://sites.google.com/g.ecc.u-tokyo.ac.jp/utnas-bulletin-board/

2016年06月13日(月)

16:30-18:00   数理科学研究科棟(駒場) 056号室
鈴木厚 氏 (大阪大学サイバーメディアセンター)
Dissection : A direct solver with kernel detection for finite element matrices
(日本語)
[ 講演概要 ]
Large-scale sparse matrices are solved in finite element analyses of elasticity and/or flow problems. In some cases, the matrix may be singular, e.g. due to pressure ambiguity of the Navier-Stokes equations, or due to rigid body movements of sub-domain elasticity problems by a domain decomposition method. Therefore, it is better the linear solver understands rank-deficiency of the matrix.
By assuming the matrix is factorized into LDU form with a symmetric partial permutation, and by introducing a threshold to postpone factorization for pseudo null pivots, solvability of the last Schur complement matrix will be examined. Usual procedure for rank-deficiency problem is based on computation of eigenvalues or singular values and an introduced threshold determines the null space. However, developed new algorithm in DOI:10.1002/nme.4729 is based on computation of residuals combined with orthogonal projections onto supposed image spaces and there is no necessary to introduce a threshold for understanding zero value in floating point. The algorithm uses higher precision arithmetic, e.g. quadruple precision, to distinguish numerical round-off errors that occurred during factorization of the whole sparse matrix from ones during the kernel detection procedure itself.
This is joint work with François-Xavier Roux (LJLL, UPMC/ONERA).