An algorithm with \(m\)-step residual history for solving linear equations: data interpolation by a multi-shape-factors RBF
From MaRDI portal
Publication:1654596
DOI10.1016/j.enganabound.2014.10.020zbMath1403.65015OpenAlexW2002603135MaRDI QIDQ1654596
Publication date: 9 August 2018
Published in: Engineering Analysis with Boundary Elements (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.enganabound.2014.10.020
linear equations systemdouble optimal \(m\)-step algorithmdouble optimal solutioninterpolation by RBFmulti-shape factorsresidual subspace
Related Items (4)
A multiple-scale MQ-RBF for solving the inverse Cauchy problems in arbitrary plane domain ⋮ An energy regularization of the MQ-RBF method for solving the Cauchy problems of diffusion-convection-reaction equations ⋮ Kansa radial basis function method with fictitious centres for solving nonlinear boundary value problems ⋮ A time-efficient variable shape parameter Kansa-radial basis function method for the solution of nonlinear boundary value problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recent advances on radial basis function collocation methods
- GMRES implementations and residual smoothing techniques for solving ill-posed linear systems
- On the increasingly flat radial basis function and optimal shape parameter for the solution of elliptic PDEs
- Multiquadric and its shape parameter -- a numerical investigation of error estimate, condition number, and round-off error by arbitrary precision computation
- Optimal algorithms in a Krylov subspace for solving linear inverse problems by MFS
- An approach to the solution of linear system of equations by He's homotopy perturbation method
- Application of homotopy perturbation methods for solving systems of linear equations
- Optimal constant shape parameter for multiquadric based RBF-FD method
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- On the decomposition method for system of linear equations and system of linear Volterra integral equations
- Iterative solution of linear systems in the 20th century
- Newton iteration with multiquadrics for the solution of nonlinear PDEs
- Error estimate, optimal shape factor, and high precision computation of multiquadric collocation method
- A maximal projection solution of ill-posed linear system in a column subspace, better than the least squares solution
- A doubly optimized solution of linear equations system expressed in an affine Krylov subspace
- An equilibrated method of fundamental solutions to choose the best source points for the Laplace equation
- A double optimal descent algorithm for iteratively solving ill-posed linear inverse problems
- Novel Algorithms Based on the Conjugate Gradient Method for Inverting Ill-Conditioned Matrices, and a New Regularization Method to Solve Ill-Posed Linear Systems
- On Cauchy's problem: I. A variational Steklov–Poincaré theory
- Recent computational developments in Krylov subspace methods for linear systems
- Why is the Cauchy problem severely ill-posed?
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Scattered Data Interpolation: Tests of Some Method
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Exponential convergence andH-c multiquadric collocation method for partial differential equations
- Inexact Krylov Subspace Methods for Linear Systems
- Iterative Krylov Methods for Large Linear Systems
- Methods of conjugate gradients for solving linear systems
This page was built for publication: An algorithm with \(m\)-step residual history for solving linear equations: data interpolation by a multi-shape-factors RBF
