Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Zdeněk Strakoš"'
Autor:
Jörg Liesen, Zdenek Strakos
The mathematical theory of Krylov subspace methods with a focus on solving systems of linear algebraic equations is given a detailed treatment in this principles-based book. Starting from the idea of projections, Krylov subspace methods are character
Publikováno v:
Numerical Algorithms. 91:301-325
Publikováno v:
Numerical Algorithms. 83:57-98
Operator preconditioning based on decomposition into subspaces has been developed in early 90’s in the works of Nepomnyaschikh, Matsokin, Oswald, Griebel, Dahmen, Kunoth, Rude, Xu, and others, with inspiration from particular applications, e.g., to
Autor:
Stefano Pozza, Zdeněk Strakoš
Publikováno v:
Linear Algebra and its Applications. 561:207-227
The Stieltjes problem of moments seeks for a nondecreasing positive distribution function μ ( λ ) on the semi-axis [ 0 , + ∞ ) so that its moments match a given infinite sequence of positive real numbers m 0 , m 1 , … . In his seminal paper Inv
Publikováno v:
SIAM Journal on Numerical Analysis
We analyze the spectrum of the operator $\Delta^{-1} [\nabla \cdot (K\nabla u)]$, where $\Delta$ denotes the Laplacian and $K=K(x,y)$ is a symmetric tensor. Our main result shows that this spectrum can be derived from the spectral decomposition $K=Q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::795f6d66acb691f6319f5961f551e27a
http://arxiv.org/abs/2002.00676
http://arxiv.org/abs/2002.00676
Autor:
Zdeněk Strakoš, Jan Papež
Publikováno v:
IMA Journal of Numerical Analysis. 38:1164-1184
Publikováno v:
Linear Algebra and its Applications. 497:162-166
Autor:
Erin Carson, Zdeněk Strakoš
Publikováno v:
Philos Trans A Math Phys Eng Sci
With exascale-level computation on the horizon, the art of predicting the cost of computations has acquired a renewed focus. This task is especially challenging in the case of iterative methods, for which convergence behaviour often cannot be determi
Publikováno v:
Electronic transactions on numerical analysis 50 (2018): 1–19. doi:10.1553/etna_vol50s1
info:cnr-pdr/source/autori:Pozza S.; Pranic M.S.; Strakos Z./titolo:The lanczos algorithm and complex gauss quadrature/doi:10.1553%2Fetna_vol50s1/rivista:Electronic transactions on numerical analysis/anno:2018/pagina_da:1/pagina_a:19/intervallo_pagine:1–19/volume:50
info:cnr-pdr/source/autori:Pozza S.; Pranic M.S.; Strakos Z./titolo:The lanczos algorithm and complex gauss quadrature/doi:10.1553%2Fetna_vol50s1/rivista:Electronic transactions on numerical analysis/anno:2018/pagina_da:1/pagina_a:19/intervallo_pagine:1–19/volume:50
Gauss quadrature can be naturally generalized in order to approximate quasi-definite linear functionals, where the interconnections with (formal) orthogonal polynomials, (complex) Jacobi matrices, and the Lanczos algorithm are analogous to those in t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d500d35799164779941f4e2fd1c820d
http://www.cnr.it/prodotto/i/424337
http://www.cnr.it/prodotto/i/424337
In [IMA J. Numer. Anal., 29 (2009), pp. 24--42], Nielsen, Tveito, and Hackbusch study the operator generated by using the inverse of the Laplacian as the preconditioner for second order elliptic PDEs $-\nabla \cdot (k(x) \nabla u) = f$. They prove th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c66ef0dcb0ab859646b37a459a27923e