Standard

Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (Extended abstract). / Selivanova, Svetlana V.; Selivanov, Victor L.

Sailing Routes in the World of Computation. 2018. p. 376-385 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10936).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Harvard

Selivanova, SV & Selivanov, VL 2018, Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (Extended abstract). in Sailing Routes in the World of Computation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10936, pp. 376-385, computability in europe, 2018, 30/07/18. https://doi.org/10.1007/978-3-319-94418-0_38

APA

Selivanova, S. V., & Selivanov, V. L. (2018). Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (Extended abstract). In Sailing Routes in the World of Computation (pp. 376-385). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10936). https://doi.org/10.1007/978-3-319-94418-0_38

Vancouver

Selivanova SV, Selivanov VL. Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (Extended abstract). In Sailing Routes in the World of Computation. 2018. p. 376-385. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-94418-0_38

Author

Selivanova, Svetlana V. ; Selivanov, Victor L. / Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (Extended abstract). Sailing Routes in the World of Computation. 2018. pp. 376-385 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{9b4f9bde159148059f62e1ea1c7eb56a,
title = "Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (Extended abstract)",
abstract = "We establish upper bounds of bit complexity of computing solution operators for symmetric hyperbolic systems of PDEs. Here we continue the research started in our papers of 2009 and 2017, where computability, in the rigorous sense of computable analysis, has been established for solution operators of Cauchy and dissipative boundary-value problems for such systems.",
keywords = "Algebraic real, Bit complexity, Difference scheme, Eigenvalue, Eigenvector, Guaranteed precision, Solution operator, Symbolic computations, Symmetric hyperbolic system, Symmetric matrix",
author = "Selivanova, {Svetlana V.} and Selivanov, {Victor L.}",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-319-94418-0_38",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "376--385",
booktitle = "Sailing Routes in the World of Computation",
note = "computability in europe, 2018 ; Conference date: 30-07-2018",

}

RIS

TY - GEN

T1 - Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (Extended abstract)

AU - Selivanova, Svetlana V.

AU - Selivanov, Victor L.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We establish upper bounds of bit complexity of computing solution operators for symmetric hyperbolic systems of PDEs. Here we continue the research started in our papers of 2009 and 2017, where computability, in the rigorous sense of computable analysis, has been established for solution operators of Cauchy and dissipative boundary-value problems for such systems.

AB - We establish upper bounds of bit complexity of computing solution operators for symmetric hyperbolic systems of PDEs. Here we continue the research started in our papers of 2009 and 2017, where computability, in the rigorous sense of computable analysis, has been established for solution operators of Cauchy and dissipative boundary-value problems for such systems.

KW - Algebraic real

KW - Bit complexity

KW - Difference scheme

KW - Eigenvalue

KW - Eigenvector

KW - Guaranteed precision

KW - Solution operator

KW - Symbolic computations

KW - Symmetric hyperbolic system

KW - Symmetric matrix

UR - http://www.scopus.com/inward/record.url?scp=85051135764&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-94418-0_38

DO - 10.1007/978-3-319-94418-0_38

M3 - Conference contribution

AN - SCOPUS:85051135764

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 376

EP - 385

BT - Sailing Routes in the World of Computation

T2 - computability in europe, 2018

Y2 - 30 July 2018

ER -

ID: 126994848