An algorithm with \(m\)-step residual history for solving linear equations: data interpolation by a multi-shape-factors RBF
type: Item
instance of: scholarly article
title: An algorithm with \(m\)-step residual history for solving linear equations: data interpolation by a multi-shape-factors RBF
zbMATH Open document ID: 1403.65015
published in: Engineering Analysis with Boundary Elements
publication date: 2018-08-09T00:00:00Z
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 6914971
zbMATH Keywords: linear equations system
zbMATH Keywords: double optimal solution
zbMATH Keywords: residual subspace
zbMATH Keywords: double optimal \(m\)-step algorithm
zbMATH Keywords: interpolation by RBF
zbMATH Keywords: multi-shape factors
author: Chein-Shan Liu
MaRDI profile type: Publication
full work available at URL: j.enganabound.2014.10.020
OpenAlex ID: W2002603135
cites work: On the decomposition method for system of linear equations and system of linear Volterra integral equations
cites work: An approach to the solution of linear system of equations by He's homotopy perturbation method
cites work: Application of homotopy perturbation methods for solving systems of linear equations
cites work: Recent computational developments in Krylov subspace methods for linear systems
cites work: Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: QMR: A quasi-minimal residual method for non-Hermitian linear systems
cites work: Inexact Krylov Subspace Methods for Linear Systems
cites work: Methods of conjugate gradients for solving linear systems
cites work: Solution of Sparse Indefinite Systems of Linear Equations
cites work: Q4091368
cites work: CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
cites work: Iterative solution of linear systems in the 20th century
cites work: Parallel iterative methods for sparse linear systems
cites work: Iterative Krylov Methods for Large Linear Systems
cites work: GMRES implementations and residual smoothing techniques for solving ill-posed linear systems
cites work: A doubly optimized solution of linear equations system expressed in an affine Krylov subspace
cites work: A maximal projection solution of ill-posed linear system in a column subspace, better than the least squares solution
cites work: Optimal algorithms in a Krylov subspace for solving linear inverse problems by MFS
cites work: A double optimal descent algorithm for iteratively solving ill-posed linear inverse problems
cites work: Q5443078
cites work: Novel Algorithms Based on the Conjugate Gradient Method for Inverting Ill-Conditioned Matrices, and a New Regularization Method to Solve Ill-Posed Linear Systems
cites work: Why is the Cauchy problem severely ill-posed?
cites work: On Cauchy's problem: I. A variational Steklov–Poincaré theory
cites work: Exponential convergence andH-c multiquadric collocation method for partial differential equations
cites work: Error estimate, optimal shape factor, and high precision computation of multiquadric collocation method
cites work: On the increasingly flat radial basis function and optimal shape parameter for the solution of elliptic PDEs
cites work: Optimal constant shape parameter for multiquadric based RBF-FD method
cites work: Multiquadric and its shape parameter -- a numerical investigation of error estimate, condition number, and round-off error by arbitrary precision computation
cites work: An equilibrated method of fundamental solutions to choose the best source points for the Laplace equation
cites work: Recent advances on radial basis function collocation methods
cites work: Scattered Data Interpolation: Tests of Some Method
cites work: Newton iteration with multiquadrics for the solution of nonlinear PDEs
DOI: 10.1016/J.ENGANABOUND.2014.10.020
description: scientific article; zbMATH DE number 6914971