Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision

DOI10.3233/COM-180215OpenAlexW3120804123WikidataQ114038179 ScholiaQ114038179MaRDI QIDQ4995607

Victor L. Selivanov, Svetlana V. Selivanova

Publication date: 25 June 2021

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-180215

zbMATH Keywords

approximationdifference schemespectral decompositionsymmetric matrixsymbolic computationsguaranteed precisionsolution operatorsymmetric hyperbolic systembit complexityalgebraic real

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Related Items (6)

Primitive recursive ordered fields and some applications ⋮ On the main scientific achievements of Victor Selivanov ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ Primitive recursive ordered fields and some applications ⋮ Computational complexity of classical solutions of partial differential equations ⋮ Computability of Differential Equations

Cites Work

• Existence and uniqueness of structures computable in polynomial time
• Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
• The bit-complexity of discrete solutions of partial differential equations: Compact multigrid
• On the topology of algorithms. I
• Braid group cohomologies and algorithm complexity
• Factoring polynomials with rational coefficients
• Polynomial-time versus recursive models
• Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)
• On constructive number fields and computability of solutions of PDEs
• Computational complexity of real powering and improved solving linear differential equations
• On the degree of extensions generated by finitely many algebraic numbers
• Störungstheorie der Spektralzerlegung. I. Analytische Störung der isolierten Punkteigenwerte eines beschränkten Operators
• The complexity of the matrix eigenproblem
• Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
• Computational complexity on computable metric spaces
• Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests
• Symmetric hyperbolic linear differential equations
• Algorithms in real algebraic geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision