摘要
Continuously differentiable radial basis functions (C<sup>∞</sup>-RBFs), while being theoretically exponentially convergent are considered impractical computationally because the coefficient matrices are full and can become very ill- conditioned. Similarly, the Hilbert and Vandermonde have full matrices and become ill-conditioned. The difference between a coefficient matrix generated by C<sup>∞</sup>-RBFs for partial differential or integral equations and Hilbert and Vandermonde systems is that C<sup>∞</sup>-RBFs are very sensitive to small changes in the adjustable parameters. These parameters affect the condition number and solution accuracy. The error terrain has many local and global maxima and minima. To find stable and accurate numerical solutions for full linear equation systems, this study proposes a hybrid combination of block Gaussian elimination (BGE) combined with arbitrary precision arithmetic (APA) to minimize the accumulation of rounding errors. In the future, this algorithm can execute faster using preconditioners and implemented on massively parallel computers.
Continuously differentiable radial basis functions (C<sup>∞</sup>-RBFs), while being theoretically exponentially convergent are considered impractical computationally because the coefficient matrices are full and can become very ill- conditioned. Similarly, the Hilbert and Vandermonde have full matrices and become ill-conditioned. The difference between a coefficient matrix generated by C<sup>∞</sup>-RBFs for partial differential or integral equations and Hilbert and Vandermonde systems is that C<sup>∞</sup>-RBFs are very sensitive to small changes in the adjustable parameters. These parameters affect the condition number and solution accuracy. The error terrain has many local and global maxima and minima. To find stable and accurate numerical solutions for full linear equation systems, this study proposes a hybrid combination of block Gaussian elimination (BGE) combined with arbitrary precision arithmetic (APA) to minimize the accumulation of rounding errors. In the future, this algorithm can execute faster using preconditioners and implemented on massively parallel computers.
作者
Edward J. Kansa
Edward J. Kansa(Convergent Solutions, Livermore, CA, USA)
