default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIvana Pultarová
Person information
- affiliation: Czech Technical University in Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Liya Gaynutdinova, Martin Ladecký, Ivana Pultarová
, Miloslav Vlasák, Jan Zeman:
Preconditioned discontinuous Galerkin method and convection-diffusion-reaction problems with guaranteed bounds to resulting spectra. Numer. Linear Algebra Appl. 31(4) (2024)- 2023
- [j14]Martin Ladecký, Richard J. Leute, Ali Falsafi, Ivana Pultarová, Lars Pastewka, Till Junge, Jan Zeman:
An optimal preconditioned FFT-accelerated finite element solver for homogenization. Appl. Math. Comput. 446: 127835 (2023) - [i8]Liya Gaynutdinova, Martin Ladecký, Ivana Pultarová, Miloslav Vlasák, Jan Zeman:
Preconditioned discontinuous Galerkin method and convection-diffusion-reaction problems with guaranteed bounds to resulting spectra. CoRR abs/2304.13315 (2023) - [i7]Ivana Pultarová:
Generalized spectrum of second order differential operators: 3D problems. CoRR abs/2306.10604 (2023) - 2022
- [j13]Richard J. Leute, Martin Ladecký, Ali Falsafi, Indre Jödicke, Ivana Pultarová, Jan Zeman, Till Junge, Lars Pastewka:
Elimination of ringing artifacts by finite-element projection in FFT-based homogenization. J. Comput. Phys. 453: 110931 (2022) - [i6]Martin Ladecký, Richard J. Leute, Ali Falsafi, Ivana Pultarová, Lars Pastewka, Till Junge, Jan Zeman:
Optimal FFT-accelerated Finite Element Solver for Homogenization. CoRR abs/2203.02962 (2022) - [i5]Liya Gaynutdinova, Martin Ladecký, Ales Nekvinda, Ivana Pultarová, Jan Zeman:
Efficient numerical method for reliable upper and lower bounds on homogenized parameters. CoRR abs/2208.09940 (2022) - 2021
- [j12]Ivana Pultarová, Martin Ladecký:
Two-sided guaranteed bounds to individual eigenvalues of preconditioned finite element and finite difference problems. Numer. Linear Algebra Appl. 28(5) (2021) - [i4]Richard J. Leute, Martin Ladecký, Ali Falsafi, Indre Jödicke, Ivana Pultarová, Jan Zeman, Till Junge, Lars Pastewka:
Elimination of ringing artifacts by finite-element projection in FFT-based homogenization. CoRR abs/2105.03297 (2021) - [i3]Tomás Medrický, Martin Doskár, Ivana Pultarová, Jan Zeman:
Comparison of FETI-based domain decomposition methods for topology optimization problems. CoRR abs/2111.11728 (2021) - 2020
- [j11]Marie Kubínová, Ivana Pultarová:
Block Preconditioning of Stochastic Galerkin Problems: New Two-sided Guaranteed Spectral Bounds. SIAM/ASA J. Uncertain. Quantification 8(1): 88-113 (2020) - [j10]Jakub Hrncír, Ivana Pultarová, Zdenek Strakos:
Decomposition into subspaces preconditioning: abstract framework. Numer. Algorithms 83(1): 57-98 (2020) - [i2]Martin Ladecký, Ivana Pultarová, Jan Zeman:
Guaranteed two-sided bounds on all eigenvalues of preconditioned diffusion and elasticity problems solved by the finite element method. CoRR abs/2001.03673 (2020)
2010 – 2019
- 2016
- [j9]Ivana Pultarová:
Hierarchical preconditioning for the stochastic Galerkin method: Upper bounds to the strengthened CBS constants. Comput. Math. Appl. 71(4): 949-964 (2016) - [j8]Ivana Pultarová:
Convergence theory of exact interpolation scheme for computing several eigenvectors. Numer. Linear Algebra Appl. 23(2): 373-390 (2016) - 2015
- [j7]Owe Axelsson, Radim Blaheta, Maya G. Neytcheva, Ivana Pultarová:
Preconditioning of iterative methods - theory and applications. Numer. Linear Algebra Appl. 22(6): 901-902 (2015) - 2013
- [j6]Ivana Pultarová:
Fourier Analysis of the Aggregation Based Algebraic Multigrid for Stochastic Matrices. SIAM J. Matrix Anal. Appl. 34(4): 1596-1610 (2013) - 2012
- [j5]Ivana Pultarová:
Preconditioning of the coarse problem in the method of balanced domain decomposition by constraints. Math. Comput. Simul. 82(10): 1788-1798 (2012) - 2011
- [j4]Ivana Pultarová, Ivo Marek:
Convergence of multi-level iterative aggregation-disaggregation methods. J. Comput. Appl. Math. 236(3): 354-363 (2011) - [j3]Ivana Pultarová, Ivo Marek:
Physiology and pathology of iterative aggregation-disaggregation methods. Numer. Linear Algebra Appl. 18(6): 1051-1065 (2011)
2000 – 2009
- 2009
- [j2]Ivana Pultarová:
Preconditioning and a posteriori error estimates using h- and p-hierarchical finite elements with rectangular supports. Numer. Linear Algebra Appl. 16(5): 415-430 (2009) - 2008
- [j1]Ivana Pultarová:
Necessary and sufficient local convergence condition of one class of iterative aggregation-disaggregation methods. Numer. Linear Algebra Appl. 15(4): 339-354 (2008) - [c1]Ivana Pultarová:
Iterative aggregation: disaggregation methods and ordering algorithms. VALUETOOLS 2008: 18 - 2007
- [i1]Ivo Marek, Ivana Pultarová, Petr Mayer:
Convergence of iterative aggregation/disaggregation methods based on splittings with cyclic iteration matrices. Web Information Retrieval and Linear Algebra Algorithms 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-23 19:20 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:
