scientific article

From MaRDI portal
Publication:3883494

zbMath0441.68046MaRDI QIDQ3883494

J. F. Traub, Henryk Woźniakowski

Publication date: 1980


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



Related Items

The infinite-dimensional widths and optimal recovery of generalized Besov classes, Finite-order weights imply tractability of linear multivariate problems, Optimisation impossible, A survey of randomized algorithms for control synthesis and performance verification, On the construction of optimal cubature formulae which use integrals over hyperspheres, Absorbent tuples of aggregation operators, Set membership identification of nonlinear systems, Data-driven control of nonlinear systems: an on-line direct approach, Linear ill-posed problems are solvable on the average for all Gaussian measures, Computing a quantity of interest from observational data, Worst-case identification of nonlinear fading memory systems, Optimal recovery of multivariate functions restricted by second-order differential operator, On the crude multidimensional search, Recovering linear operators and Lagrange function minimality condition, Complexity of a Fredholm equation of the second kind with kernels from classes with dominating mixed derivative, Optimal interpolation of convergent algebraic series, Computing the topological degree with noisy information, Optimal algorithms for a problem of optimal control, Average width and optimal recovery of the anisotropic classes \(W^{r}H^{\alpha}({\mathbb R}^{d})\) in the metric \(C^{k}({\mathbb R}^{d})\), Data assimilation and sampling in Banach spaces, What is the complexity of ill-posed problems?, Differential equations as deterministic models in science and technology Part I: Modelling, Mini-Minimax Uncertainty Quantification for Emulators, On the optimal recovery of integrals of set-valued functions, Metric entropy, \(n\)-widths, and sampling of functions on manifolds, Probabilistic and average linear widths of Sobolev space with Gaussian measure, A sharp upper bound for sampling numbers in \(L_2\), ABC on IBC, Average error bounds of trigonometric approximation on periodic Wiener spaces, Capturing ridge functions in high dimensions from point queries, Optimal recovery methods exact on trigonometric polynomials for the solution of the heat equation, Optimal recovery and extremum theory, On maximal order for local and global numerical problems, Complexity of linear programming, Bisection is optimal, Optimal recovery of isotropic classes of twice-differentiable functions defined on \(d\)-dimensional Euclidean space, Complexity of functions: Some questions, conjectures, and results, Complexity of multilinear problems in the average case setting, Average widths and optimal recovery of multivariate Besov classes in \(L_p (\mathbb{R}^d)\), Optimal residual algorithms for linear operator equations, Linearity of algorithms and a result of Ando, Random approximation of Sobolev embeddings, Optimal estimation theory for dynamic systems with set membership uncertainty: An overview, Complexity of linear problems with a fixed output basis, Optimal quadrature formulas for the Sobolev space \(H^1\), On optimal recovery of a holomorphic function in the unit ball of \(\mathbb{C}^ n\), Parallel information-based complexity, Optimal recovery of solutions of the generalized heat equation in the unit ball from inaccurate data, Measures of uncertainty and information in computation, Complexity of verification and computation for IBC problems, Information complexity of equations of the second kind with compact operators in Hilbert space, Approximation in p-norm of univariate concave functions, Generalized adaptive versus nonadaptive recovery from noisy information, Optimal recovery of twice differentiable functions based on symmetric splines, On the computational complexity of integral equations, Approximation of anisotropic classes by standard information, Optimal quadratures in H(sub)p spaces, Application of deterministic low-discrepancy sequences in global optimization, Monotonicity preserving approximation of multivariate scattered data, Some nonlinear problems are as easy as the approximation problem, Interpolation of Lipschitz functions, Approximation theory and optimization problems, Optimal approximation of elliptic problems by linear and nonlinear mappings. II, Unnamed Item, Absolute value information for IBC problems, Optimal recovery of operators in function \(L\)-spaces, Optimal recovery of linear functionals on sets of finite dimension, The sample complexity of worst-case identification of FIR linear systems, Optimal-by-order quadrature formulae for fast oscillatory functions with inaccurately given a priori information, Relation of Average Error in Prolate Spheroidal Wave Functions Algorithm for Bandlimited Functions Approximation to Radius of Information, Strong convergence rates of probabilistic integrators for ordinary differential equations, A modern retrospective on probabilistic numerics, On the adaptive and continuous information problems, On adaptive information with varying cardinality for linear problems with elliptically contoured measures, Information based complexity for high dimensional sparse functions, Shape from shadows. A Hilbert space setting, A refined model of computation for continuous problems, Counterexamples in optimal quadrature, Information of varying cardinality, An optimal algorithm for search of extrema of a bimodal function, Minimax Estimation of the First Derivative by Finite Number of Noisy Observations, On average case errors in numerical analysis, How powerful is continuous nonlinear information for linear problems?, On linearity of spline algorithms, Approximating band- and energy-limited signals in the presence of jitter, \(\sigma\)-perfect splines and their application to optimal recovery problems, On optimal algorithms for problems defined on groups, Asymptotic error for the global maximum of functions in s dimensions, Spatial shape-preserving interpolation using \(\nu\)-splines, Optimal recovery of the derivative of periodic analytic functions from Hardy classes, Hyperbolic cross and the complexity of various classes of ill-posed linear problems, Complexity and tractability for a class of elliptic partial integro-differential equations, Two-dimensional spline approximation on local integral measurements. Analysis and design of acoustic fish surveys, On central algorithms of approximation under fuzzy information, Optimization of the methods of numerical differentiation for bivariate functions, On the optimal worst-case experiment design for constrained linear systems, Discrete models of coupled dynamic thermoelasticity for stress-temperature formulations., Complexity theory for Lie-group solvers, Optimal-by-accuracy and optimal-by-order cubature formulae in interpolational classes, Estimates for the deviations of integral operators in semilinear metric spaces and their applications, Neural network approximation, Worst-case errors for some spatial approximations to a model problem in two-dimensional transport theory, POINTWISE CONSTRUCTION OF LIPSCHITZ AGGREGATION OPERATORS WITH SPECIFIC PROPERTIES, Optimal recovery forW 2 r (ℝ) inL 2 (ℝ), Errors and optimality for spatial approximations in one-dimensional transport, Personalized Algorithm Generation: A Case Study in Learning ODE Integrators, Korneichuk-Stechkin Lemma, Ostrowski and Landau Inequalities, and Optimal Recovery Problems for L-Space Valued Functions, Optimal Recovery of a Family of Operators from Inaccurate Measurements on a Compact, Optimal recovery of the solution to the Dirichlet problem in the half-plane, Optimal recovery of a family of operators from inaccurate measurements on a compact set, An optimal method for recovering the mixed derivative \(f^{(2,2)}\) of bivariate functions, Optimal learning, The minimal radius of Galerkin information for the problem of numerical differentiation, Optimal recovery and generalized Carlson inequality for weights with symmetry properties, Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case, On the optimal recovery of one family of operators on a class of functions from approximate information about its spectrum, Optimal Recovery of Monotone Operators in Partially Ordered L-Spaces, Optimal error predictors for economic models, On solving operator equations by multipoint iterative methods, Non Asymptotic Minimax Estimation of Functionals with Noisy Observations, The optimal approximations for solving linear ill-posed problems, Smoothing Lipschitz functions, What is the complexity of surface integration?, Average widths and optimal recovery of multivariate Besov classes in \(L_p({\mathbf R}^d)\), FAST SOLVERS OF WEAKLY SINGULAR INTEGRAL EQUATIONS OF THE SECOND KIND, Chebyshev centres, Jung constants, and their applications, A Quasi-Fast Solver for Weakly Singular Integral Equations of the Second Kind, Optimal Recovery of Isotropic Classes ofrth Differentiable Functions on ℝd, COMPLEXITY ESTIMATES FOR SEVERELY ILL-POSED PROBLEMS UNDER A POSTERIORI SELECTION OF REGULARIZATION PARAMETER, 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