scientific article

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

iteration optimal algorithm algebraic complexity information operator analytic computational complexity general information model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) History of computer science (68-03) Bibliographies for mathematics in general (00A15)

Related Items (only showing first 100 items - show all)

Strongly unique minimization of functionals in Banach spaces with applications to theory of approximation and fixed points ⋮ Optimization of approximation-iterative methods for the approximate solution of integral equations with differentiable kernels ⋮ On the optimal solution of large eigenpair problems ⋮ On the Kolmogorov complexity of functions of finite smoothness ⋮ A survey of information-based complexity ⋮ Approximation of linear functionals on a Banach space with a Gaussian measure ⋮ Are linear algorithms always good for linear problems? ⋮ On the local convergence of economic mechanisms ⋮ Parallel and sequential computation: A statistician's view ⋮ Complexity of differential and integral equations ⋮ For which error criteria can we solve nonlinear equations? ⋮ Optimal solution of nonlinear equations ⋮ Optimal recovery of integral operators and its applications ⋮ Optimal quadrature formulae for differentiable functions ⋮ Optimal cubature formulas for calculation of multidimensional integrals in weighted Sobolev spaces ⋮ Finite element methods are not always optimal ⋮ The concept of sequential optimality for problems in numerical analysis ⋮ Linear problems (with extended range) have linear optimal algorithms ⋮ Optimality of central and projection algorithms for bounded uncertainty ⋮ On the existence of optimal affine methods for approximating linear functionals ⋮ Complexity of approximation with relative error criterion in worst, average, and probabilistic settings ⋮ Some informational requirements for convergence ⋮ An information-based approach to ill-posed problems ⋮ The quantum setting with randomized queries for continuous problems ⋮ The algorithm designer versus nature: A game-theoretic approach to information-based complexity ⋮ Communication complexity of convex optimization ⋮ Optimal solution of ordinary differential equations ⋮ A note on the trade-off between sampling and quantization in signal processing ⋮ Information-based numerical practice ⋮ Exact cubature for a class of functions of maximum effective dimension ⋮ Maximum likelihood estimators and worst case optimal algorithms for system identification ⋮ Asymptotic error of algorithms for solving nonlinear problems ⋮ Exactness and optimality of methods for recovering functions from their spectrum ⋮ A note on the optimal recovery of functions in \(H^{\infty}\) ⋮ Engineering control systems and computing in the 90s ⋮ Conditionally optimal algorithms and estimation of reduced order models ⋮ On adaption with noisy information ⋮ Optimal search algorithm for a minimum of a discrete periodic bimodal function ⋮ An optimal sequential algorithm for the uniform approximation of convex functions on \([0,1^ 2\)] ⋮ On a class of omnibus algorithms for zero-finding ⋮ Can we approximate zeros of functions with nonzero topological degree? ⋮ Galerkin method and optimal error algorithms in Hilbert spaces ⋮ Optimal complexity recovery of band- and energy-limited signals. II ⋮ Optimal search algorithm for extrema of a discrete periodic bimodal function ⋮ Handling of neutral information by aggregation operators ⋮ Optimal recovery of isotropic classes of twice-differentiable multivariate functions ⋮ Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements ⋮ Optimal recovery of isotropic classes of \(r\)th differentiable multivariate functions ⋮ Liberating the dimension for function approximation ⋮ On reconstruction of multiplicative transformations of functions in anisotropic spaces ⋮ Optimal recovery of operators and multidimensional Carlson type inequalities ⋮ Discontinuity detection from band-limited signals ⋮ On sequential and parallel solution of initial value problems ⋮ An optimal multivariate spline method of recovery of twice differentiable functions ⋮ Approximation of smooth periodic functions in several variables ⋮ Parameter estimation algorithms for a set-membership description of uncertainty ⋮ On approximation of band-limited signals ⋮ Optimal cubature formulas for tensor products of certain classes of functions ⋮ Diameters of random vectors and their applications in approximation theory ⋮ Linear algorithms for recovering linear functionals from jittered information ⋮ Using reserves for computation optimization to improve the integration of rapidly oscillating functions ⋮ Cloud computing in cryptography and steganography ⋮ Construction of optimal cubature formulas related to computer tomography ⋮ Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces ⋮ Exact orders of computational (numerical) diameters in problems of reconstructing functions and sampling solutions of the Klein-Gordon equation from Fourier coefficients ⋮ Optimal recovery methods for solutions of the Dirichlet problem that are exact on subspaces of spherical harmonics ⋮ On the quality of algorithms based on spline interpolation ⋮ A moment problem for discrete nonpositive measures on a finite interval ⋮ Sharp asymptotics of the metric entropy for ellipsoids ⋮ A note on level-2 condition numbers ⋮ Fast multiplication of a recursive block Toeplitz matrix by a vector and its application ⋮ Complexity of computing topological degree of Lipschitz functions in n dimensions ⋮ Adaption helps for some nonconvex classes ⋮ Average complexity for linear operators over bounded domains ⋮ On the optimality of Krylov information ⋮ Optimal complexity recovery of band- and energy-limited signals ⋮ Optimal recovery of three times differentiable functions on a convex polytope inscribed in a sphere ⋮ Optimal recovery from a finite set in Banach spaces of entire functions ⋮ Complexity of multilinear problems in the worst case setting ⋮ Computing topological degree using noisy information ⋮ On the power of standard information for multivariate approximation in the worst case setting ⋮ New averaging technique for approximating weighted integrals ⋮ s-numbers in information-based complexity ⋮ Probabilistic complexity analysis for linear problems in bounded domains ⋮ On the average complexity of multivariate problems ⋮ Orthogonal projections are optimal algorithms ⋮ Optimal transformations for scalar sequences ⋮ Measuring uncertainty without a norm ⋮ Basic principles of feedback and adaptive approaches in the finite element method ⋮ Best approximation of certain classes of smooth functions on the real axis by splines of a higher order ⋮ Sequential algorithms of optimal order global error for the uniform recovery of functions with monotone (r-1) derivatives ⋮ Estimation theory for nonlinear models and set membership uncertainty ⋮ Hyperbolic cross and the complexity of the approximate solution of Fredholm integral equations of the second kind with differentiable kernels ⋮ n-widths of Sobolev spaces in \(L^ p\) ⋮ What is the complexity of elliptic systems? ⋮ On piecewise-polynomial approximation of functions with a bounded fractional derivative in an \(L_ p\)-norm ⋮ Optimal algorithms for image understanding: Current status and future plans ⋮ Average case optimality ⋮ Average case optimal algorithms in Hilbert spaces ⋮ Best approximation of alternating power series

This page was built for publication: