Bit-complexity of solving systems of linear evolutionary partial differential equations

DOI10.1007/978-3-030-79416-3_13OpenAlexW3174796108MaRDI QIDQ2117092FDOQ2117092

Authors: Ivan Koswara, Martin Ziegler, Gleb Pogudin, Svetlana V. Selivanova 

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_13

Recommendations

• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
• Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)
• Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
• On the bit complexity of solving bilinear polynomial systems
• Complexity of solutions of partial differential equations
• The bit-cost of some algorithms for the solution of linear systems
• scientific article; zbMATH DE number 1057762
• Linear complexity solution of parabolic integro-differential equations
• On the bit complexity of polynomial system solving
• The bit-complexity of discrete solutions of partial differential equations: Compact multigrid

zbMATH Keywords

partial differential equationsreliable computingbit-cost

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of satisfiability problems
• Lipschitz continuous ordinary differential equations are polynomial-space complete
• Title not available (Why is that?)
• Maximum norm error estimates of efficient difference schemes for second-order wave equations
• The wave equation with computable initial data such that its unique solution is not computable
• Title not available (Why is that?)
• Specified precision polynomial root isolation is in NC
• Computing over the reals: foundations for scientific computing.
• Computational complexity on computable metric spaces
• On circulant matrices
• Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
• Computational Complexity of Smooth Differential Equations
• Title not available (Why is that?)
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• Title not available (Why is that?)
• Computational complexity of real powering and improved solving linear differential equations
• On the computational complexity of the Dirichlet Problem for Poisson's Equation
• Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
• Complexity Theory of (Functions on) Compact Metric Spaces
• Average-case polynomial-time computability of hamiltonian dynamics
• The bit-complexity of discrete solutions of partial differential equations: Compact multigrid
• Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)
• Complexity Theory for Operators in Analysis
• Computability of the Solutions to Navier-Stokes Equations via Effective Approximation

Cited In (7)

• Computational complexity of classical solutions of partial differential equations
• Out of Non-linearity: Search Impossible Differentials by the Bitwise Characteristic Matrix
• Exact real computation of solution operators for linear analytic systems of partial differential equations
• Primitive recursive ordered fields and some applications
• Primitive recursive ordered fields and some applications
• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
• Computer Science for Continuous Data

This page was built for publication: Bit-complexity of solving systems of linear evolutionary partial differential equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117092)