Optimal algorithms in a Krylov subspace for solving linear inverse problems by MFS
DOI10.1016/J.ENGANABOUND.2014.04.017zbMATH Open1297.65114OpenAlexW2077390308MaRDI QIDQ463521FDOQ463521
Publication date: 16 October 2014
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.04.017
inverse probleminverse Cauchy problemoptimal algorithmsKrylov subspacemethod of fundamental solutionsorthogonal projectioninverse Robin problem
Numerical methods for ill-posed problems for initial value and initial-boundary value problems involving PDEs (65M30) Fundamental solutions, Green's function methods, etc. for initial value and initial-boundary value problems involving PDEs (65M80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Parallel iterative methods for sparse linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Optimization method for the inverse problem of reconstructing the source term in a parabolic equation
- The boundary-element method for the determination of a heat source dependent on one variable
- A survey of applications of the MFS to inverse problems
- Recent computational developments in Krylov subspace methods for linear systems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Control Perspectives on Numerical Algorithms and Matrix Problems
- Some comments on the ill-conditioning of the method of fundamental solutions
- An equilibrated method of fundamental solutions to choose the best source points for the Laplace equation
- A Fictitious Time Integration Method for the Numerical Solution of the Fredholm Integral Equation and for Numerical Differentiation of Noisy Data, and Its Relation to the Filter Theory
- A comparison of some inverse methods for estimating the initial condition of the heat equation
- Novel meshless method for solving the potential problems with arbitrary domain
- Differential equations and solution of linear systems
- Past Cone Dynamics and Backward Group Preserving Schemes for Backward Heat Conduction Problems
- A DISCREPANCY PRINCIPLE FOR THE SOURCE POINTS LOCATION IN USING THE MFS FOR SOLVING THE BHCP
- Novel Algorithms Based on the Conjugate Gradient Method for Inverting Ill-Conditioned Matrices, and a New Regularization Method to Solve Ill-Posed Linear Systems
- Entropy- and Tikhonov-based regularization techniques applied to the backwards heat equation
- A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems
- An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
- A Globally Optimal Iterative Algorithm to Solve an Ill-Posed Linear System
- Inexact Krylov Subspace Methods for Linear Systems
Cited In (4)
- A double optimal iterative algorithm in an affine Krylov subspace for solving nonlinear algebraic equations
- Range-Space Variants and Inexact Matrix-Vector Products in Krylov Solvers for Linear Systems Arising from Inverse Problems
- An algorithm with \(m\)-step residual history for solving linear equations: data interpolation by a multi-shape-factors RBF
- Efficient MFS algorithms for inhomogeneous polyharmonic problems
Recommendations
- Optimal subgradient methods: computational properties for large-scale linear inverse problems π π
- Inexact Krylov Subspace Methods for Linear Systems π π
- Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches π π
- An optimal Q-OR Krylov subspace method for solving linear systems π π
- Krylov Subspace Methods for Linear Systems π π
- Inner-Iteration Krylov Subspace Methods for Least Squares Problems π π
- Title not available (Why is that?) π π
- Krylov Subspace Methods for Linear Infinite-Dimensional Systems π π
- Least squares methods in Krylov subspaces π π
- A preconditioned Krylov subspace method for the solution of least squares problems in inverse scattering π π
This page was built for publication: Optimal algorithms in a Krylov subspace for solving linear inverse problems by MFS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463521)