Almost optimal solution of initial-value problems by randomized and quantum algorithms
From MaRDI portal
Abstract: We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms whose error/cost properties improve from step to step. These algorithms yield new upper complexity bounds, which differ from known lower bounds by only an arbitrarily small positive parameter in the exponent, and a logarithmic factor. In both the randomized and quantum settings, initial-value problems turn out to be essentially as difficult as scalar integration.
Recommendations
- Improved bounds on the randomized and quantum complexity of initial-value problems
- Randomized and quantum algorithms yield a speed-up for initial-value problems
- The randomized complexity of initial value problems
- Randomized and quantum algorithms for solving initial-value problems in ordinary differential equations of order \(k\)
- Complexity of initial-value problems for ordinary differential equations of order \(k\)-different models of computation
Cites work
- scientific article; zbMATH DE number 1790425 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- Improved bounds on the randomized and quantum complexity of initial-value problems
- Optimal solution of ordinary differential equations
- Quantum summation with an application to integration.
- Randomized and quantum algorithms yield a speed-up for initial-value problems
Cited in
(36)- Optimal adaptive solution of piecewise regular systems of IVPs with unknown switching hypersurface
- Randomized Runge-Kutta method -- stability and convergence under inexact information
- Turbulence theories and statistical closure approaches
- Solving systems of IVPs with discontinuous derivatives-numerical experiments
- On the randomized solution of initial value problems
- Simulating nonlinear radiation diffusion through quantum computing
- Complexity of initial value problems in Banach spaces
- Randomized and quantum complexity of nonlinear two-point BVPs
- On the randomized Euler schemes for ODEs under inexact information
- Optimal global approximation of SDEs with time-irregular coefficients in asymptotic setting
- Optimality proofs of quantum weight decision algorithms
- Error analysis of randomized Runge-Kutta methods for differential equations with time-irregular coefficients
- On the quantum and randomized approximation of linear functionals on function spaces
- Randomized and quantum algorithms yield a speed-up for initial-value problems
- A note on the probabilistic stability of randomized Taylor schemes
- Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions
- Complexity of initial-value problems for ordinary differential equations of order \(k\)-different models of computation
- Mathematical analysis of a randomized method for fractional Carathéodory type equation with time-irregular coefficients
- Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface
- The quantum query complexity of elliptic PDE
- Quantum lower bounds by entropy numbers
- On the complexity of a two-point boundary value problem in different settings
- On the complexity of parametric ODEs and related problems
- The randomized complexity of initial value problems
- A quantum algorithm for the lattice-Boltzmann method advection-diffusion equation
- Optimal adaptive solution of initial-value problems with unknown singularities
- Solving Burgers' equation with quantum computing
- Randomized and quantum algorithms for solving initial-value problems in ordinary differential equations of order \(k\)
- Strong approximation of solutions of stochastic differential equations with time-irregular coefficients via randomized Euler algorithm
- On the optimal robust solution of IVPs with noisy information
- On a randomized backward Euler method for nonlinear evolution equations with time-irregular coefficients
- On the properties of the exceptional set for the randomized Euler and Runge-Kutta schemes
- Complexity of parametric initial value problems in Banach spaces
- Optimal solution of a class of non-autonomous initial-value problems with unknown singularities
- Existence, uniqueness and approximation of solutions to Carathéodory delay differential equations
- Improved bounds on the randomized and quantum complexity of initial-value problems
This page was built for publication: Almost optimal solution of initial-value problems by randomized and quantum algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855897)
