default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr Tichý
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Jan Papez, Petr Tichý:
Estimating error norms in CG-like algorithms for least-squares and least-norm problems. Numer. Algorithms 97(1): 1-28 (2024)- 2023
- [j14]Gérard Meurant, Petr Tichý:
The behavior of the Gauss-Radau upper bound of the error norm in CG. Numer. Algorithms 94(2): 847-876 (2023) - [i7]Jan Papez, Petr Tichý:
Estimating the error in CG-like algorithms for least-squares and least-norm problems. CoRR abs/2305.02044 (2023) - 2022
- [i6]Vance Faber, Jörg Liesen, Petr Tichý:
On the Forsythe conjecture. CoRR abs/2209.14579 (2022) - [i5]Gérard Meurant, Petr Tichý:
The behaviour of the Gauss-Radau upper bound of the error norm in CG. CoRR abs/2209.14601 (2022) - 2021
- [j13]Gérard Meurant
, Jan Papez, Petr Tichý:
Accurate error estimation in CG. Numer. Algorithms 88(3): 1337-1359 (2021) - [e2]Tomás Kozubek, Peter Arbenz, Jirí Jaros, Lubomír Ríha, Jakub Sístek, Petr Tichý:
High Performance Computing in Science and Engineering - 4th International Conference, HPCSE 2019, Karolinka, Czech Republic, May 20-23, 2019, Revised Selected Papers. Lecture Notes in Computer Science 12456, Springer 2021, ISBN 978-3-030-67076-4 [contents] - [i4]Gérard Meurant, Jan Papez, Petr Tichý:
Accurate error estimation in CG. CoRR abs/2101.03931 (2021) - [i3]Dorota Simonová, Petr Tichý:
When does the Lanczos algorithm compute exactly? CoRR abs/2106.02068 (2021) - 2020
- [j12]Vít Dolejsí, Petr Tichý:
On Efficient Numerical Solution of Linear Algebraic Systems Arising in Goal-Oriented Error Estimates. J. Sci. Comput. 83(1): 5 (2020) - [i2]Vít Dolejsí, Petr Tichý:
On efficient numerical solution of linear algebraic systems arising in goal-oriented error estimates. CoRR abs/2001.01929 (2020)
2010 – 2019
- 2019
- [j11]Gérard Meurant, Petr Tichý:
Approximating the extreme Ritz values and upper bounds for the A-norm of the error in CG. Numer. Algorithms 82(3): 937-968 (2019) - [i1]Carlos Echeverría, Jörg Liesen, Petr Tichý:
Analysis of the multiplicative Schwarz method for matrices with a special block structure. CoRR abs/1912.09107 (2019) - 2018
- [j10]Erin C. Carson, Miroslav Rozlozník, Zdenek Strakos, Petr Tichý, Miroslav Tuma:
The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology. SIAM J. Sci. Comput. 40(5): A3549-A3580 (2018) - [e1]Tomás Kozubek, Martin Cermák, Petr Tichý, Radim Blaheta, Jakub Sístek, Dalibor Lukás, Jirí Jaros:
High Performance Computing in Science and Engineering - Third International Conference, HPCSE 2017, Karolinka, Czech Republic, May 22-25, 2017, Revised Selected Papers. Lecture Notes in Computer Science 11087, Springer 2018, ISBN 978-3-319-97135-3 [contents] - 2014
- [j9]Gérard Meurant, Petr Tichý:
Erratum to: On computing quadrature-based bounds for the A-norm of the error in conjugate gradients. Numer. Algorithms 66(3): 679-680 (2014) - 2013
- [j8]Gérard Meurant, Petr Tichý:
On computing quadrature-based bounds for the A-norm of the error in conjugate gradients. Numer. Algorithms 62(2): 163-191 (2013) - [j7]Vance Faber, Jörg Liesen, Petr Tichý:
Properties of Worst-Case GMRES. SIAM J. Matrix Anal. Appl. 34(4): 1500-1519 (2013) - 2011
- [j6]Zdenek Strakos, Petr Tichý:
On Efficient Numerical Approximation of the Bilinear Form c*A-1b. SIAM J. Sci. Comput. 33(2): 565-587 (2011) - 2010
- [j5]Vance Faber, Jörg Liesen, Petr Tichý:
On Chebyshev Polynomials of Matrices. SIAM J. Matrix Anal. Appl. 31(4): 2205-2221 (2010)
2000 – 2009
- 2009
- [j4]Vance Faber, Jörg Liesen, Petr Tichý:
On orthogonal reduction to Hessenberg form with small bandwidth. Numer. Algorithms 51(2): 133-142 (2009) - [j3]Jörg Liesen, Petr Tichý:
On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm. SIAM J. Matrix Anal. Appl. 31(2): 853-863 (2009) - 2008
- [j2]Vance Faber, Jörg Liesen, Petr Tichý:
The Faber-Manteuffel Theorem for Linear Operators. SIAM J. Numer. Anal. 46(3): 1323-1337 (2008) - 2007
- [j1]Dianne P. O'Leary, Zdenek Strakos, Petr Tichý:
On sensitivity of Gauss-Christoffel quadrature. Numerische Mathematik 107(1): 147-174 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-17 23:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
