Hyperbolic cross and the complexity of various classes of ill-posed linear problems
Heat equation (35K05) Ill-posed problems for PDEs (35R25) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical methods for ill-posed problems for initial value and initial-boundary value problems involving PDEs (65M30) Numerical methods for inverse problems for initial value and initial-boundary value problems involving PDEs (65M32) Complexity and performance of numerical algorithms (65Y20)
The paper focus on the investigation of information and algorithmic complexity of severely ill-posed problems. The construction of numerical methods in these cases is connected with the improvement of their efficiency in order to guarantee the minimum possible use of the information and computing resources with preservation of the accuracy of approximation. Here, on overview of results is shown.
- Hyperbolic cross and complexity of severely ill-posed problems
- On optimization of projection methods for solving some classes of severely ill-posed problems
- The optimal approximations for solving linear ill-posed problems
- Complexity for some classes of well-posed problems
- Complexity of linear ill-posed problems in Hilbert space
- Complexity of the problem of finding the solutions of fredholm equations of the second kind with smooth kernels. I
- Discretization strategy for linear ill-posed problems in variable Hilbert scales
- scientific article; zbMATH DE number 1683274 (Why is no real title available?)
- scientific article; zbMATH DE number 3162145 (Why is no real title available?)
- scientific article; zbMATH DE number 3954180 (Why is no real title available?)
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 3787949 (Why is no real title available?)
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- scientific article; zbMATH DE number 1049039 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 3281217 (Why is no real title available?)
- scientific article; zbMATH DE number 3302837 (Why is no real title available?)
- Hyperbolic cross and the complexity of the approximate solution of Fredholm integral equations of the second kind with differentiable kernels
- Information complexity of equations of the second kind with compact operators in Hilbert space
- Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. I
- Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. II
- Morozov's discrepancy principle for tikhonov
- On optimization of projection methods for solving some classes of severely ill-posed problems
- On the optimal order of accuracy of an approximate solution to the Symm's integral equation
- On the regularization of projection methods for solving ill-posed problems
- Optimality for ill-posed problems under general source conditions
- Optimization of projection methods for linear ill-posed problems
- Optimization of projection methods for solving ill-posed problems
- Probabilistic setting of information-based complexity
- Simultaneous approximation of functions and their (?, ?)-derivatives by Fourier sums
- The minimal radius of Galerkin information for severely ill-posed problems
- The minimal radius of Galerkin information for the Fredholm problem of the first kind
- The optimal approximations for solving linear ill-posed problems
- Tikhonov Regularization for Finitely and Infinitely Smoothing Operators
- What is the complexity of ill-posed problems?
- Optimization of the methods of numerical differentiation for bivariate functions
- Application of Fourier truncation method to numerical differentiation for bivariate functions
- Estimates of efficiency for two methods of stable numerical summation of smooth functions
- Complexity of linear ill-posed problems in Hilbert space
- Hyperbolic cross and complexity of severely ill-posed problems
- Hyperbolic cross approximation in infinite dimensions
- An optimal method for recovering the mixed derivative \(f^{(2,2)}\) of bivariate functions
- The minimal radius of Galerkin information for the problem of numerical differentiation
- An optimal method for high-order mixed derivatives of bivariate functions
- Optimization of methods for mixed derivatives of bivariate functions
This page was built for publication: Hyperbolic cross and the complexity of various classes of ill-posed linear problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2320645)
