Bit-complexity of solving systems of linear evolutionary partial differential equations
From MaRDI portal
Publication:2117092
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
Cites work
- scientific article; zbMATH DE number 5836308 (Why is no real title available?)
- scientific article; zbMATH DE number 3147888 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1181255 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1746051 (Why is no real title available?)
- scientific article; zbMATH DE number 2152342 (Why is no real title available?)
- scientific article; zbMATH DE number 3994964 (Why is no real title available?)
- scientific article; zbMATH DE number 5180707 (Why is no real title available?)
- Average-case polynomial-time computability of Hamiltonian dynamics
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)
- Complexity theory for operators in analysis
- Complexity theory of (functions on) compact metric spaces
- Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
- Computational complexity of real powering and improved solving linear differential equations
- Computational complexity on computable metric spaces
- Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
- Computing over the reals: foundations for scientific computing.
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- Maximum norm error estimates of efficient difference schemes for second-order wave equations
- On circulant matrices
- On the computational complexity of the Dirichlet problem for Poisson's equation
- Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
- Solving analytic differential equations in polynomial time over unbounded domains
- Specified precision polynomial root isolation is in NC
- The bit-complexity of discrete solutions of partial differential equations: Compact multigrid
- The complexity of satisfiability problems
- The wave equation with computable initial data such that its unique solution is not computable
Cited in
(7)- Computational complexity of classical solutions of partial differential equations
- Exact real computation of solution operators for linear analytic systems of partial differential equations
- Primitive recursive ordered fields and some applications
- Out of Non-linearity: Search Impossible Differentials by the Bitwise Characteristic Matrix
- 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)
