Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential Equations
暂无分享，去创建一个
Martin Ziegler | Gleb Pogudin | Ivan Koswara | Svetlana Selivanova | M. Ziegler | G. Pogudin | S. Selivanova | Ivan Koswara
[1] M. B. Pour-El,et al. The wave equation with computable initial data such that its unique solution is not computable , 1981 .
[2] Martin Ziegler,et al. Computability of the Solutions to Navier-Stokes Equations via Effective Approximation , 2020, Complexity and Approximation.
[3] Amaury Pouly,et al. Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains , 2011, MFCS.
[4] Martin Ziegler,et al. A Computable Spectral Theorem , 2000, CCA.
[5] K. Weirauch. Computational complexity on computable metric spaces , 2003 .
[6] Victor L. Selivanov,et al. Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract) , 2018, CiE.
[7] Klaus Weihrauch. 9. Other Approaches to Computable Analysis , 2000 .
[8] Martin Ziegler,et al. Computational Complexity of Real Powering and Improved Solving Linear Differential Equations , 2019, CSR.
[9] Marcelo Epstein,et al. Standing Waves and Separation of Variables , 2017 .
[10] Akitoshi Kawamura,et al. Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[11] Klaus Weihrauch,et al. Is wave propagation computable or can wave computers beat the turing machine? , 2002 .
[12] Victor Y. Pan,et al. The bit-complexity of discrete solutions of partial differential equations: Compact multigrid , 1990 .