http://scholars.ntou.edu.tw/handle/123456789/2517
Title: | Effective condition number and its applications | Authors: | Zi-Cai Li Hung-Tsai Huang Jeng-Tzong Chen Yimin Wei |
Keywords: | Stability analysis;Condition number;Effective condition number;Radius parameter;Particular solutions;Collocation Trefftz method;Singularity problem;Motz's problem | Issue Date: | 22-Jun-2010 | Publisher: | Springer | Journal Volume: | 89 | Journal Issue: | 1-2 | Start page/Pages: | 87-112 | Source: | Computing | Abstract: | Consider the over-determined system Fx = b where F∈Rm×n,m≥n and rank (F) = r ≤ n, the effective condition number is defined by Cond−eff=∥b∥σr∥x∥, where the singular values of F are given as σ max = σ 1 ≥ σ 2 ≥ . . . ≥ σ r > 0 and σ r+1 = . . . = σ n = 0. For the general perturbed system (A+ΔA)(x+Δx) = b+Δb involving both ΔA and Δb, the new error bounds pertinent to Cond_eff are derived. Next, we apply the effective condition number to the solutions of Motz’s problem by the collocation Trefftz methods (CTM). Motz’s problem is the benchmark of singularity problems. We choose the general particular solutions vL=∑Lk=0dk(rRp)k+12 cos(k+12)θ with a radius parameter R p . The CTM is used to seek the coefficients d i by satisfying the boundary conditions only. Based on the new effective condition number, the optimal parameter R p = 1 is found. which is completely in accordance with the numerical results. However, if based on the traditional condition number Cond, the optimal choice of R p is misleading. Under the optimal choice R p = 1, the Cond grows exponentially as L increases, but Cond_eff is only linear. The smaller effective condition number explains well the very accurate solutions obtained. The error analysis in [14,15] and the stability analysis in this paper grant the CTM to become the most efficient and competent boundary method. |
URI: | http://scholars.ntou.edu.tw/handle/123456789/2517 | ISSN: | 1436-5057 | DOI: | 10.1007/s00607-010-0098-8 |
Appears in Collections: | 河海工程學系 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.