Zobrazeno 1 - 10
of 87
pro vyhledávání: '"Nicola Mastronardi"'
Publikováno v:
Axioms, Vol 7, Iss 4, p 81 (2018)
The generalized Schur algorithm is a powerful tool allowing to compute classical decompositions of matrices, such as the Q R and L U factorizations. When applied to matrices with particular structures, the generalized Schur algorithm computes these f
Externí odkaz:
https://doaj.org/article/b008708cc927407f86b2a97a93895a92
Autor:
Sabine Van Huffel, Paul Van Dooren, Marc Moonen, Shivkumar Chandrasekaran, Gene H. Golub, Nicola Mastronardi
Publikováno v:
EURASIP Journal on Advances in Signal Processing, Vol 2007 (2007)
Externí odkaz:
https://doaj.org/article/6d272a8ad0b6406a94a66dacf095686f
Autor:
Nicola, Mastronardi, Paul, Van Dooren
We show in this paper that the roots $x_1$ and $x_2$ of a scalar quadratic polynomial $ax^2+bx+c=0$ with real or complex coefficients $a$, $b$ $c$ can be computed in a element-wise mixed stable manner, measured in a relative sense. We also show that
Externí odkaz:
http://arxiv.org/abs/1409.8072
The general properties and mathematical structures of semiseparable matrices were presented in volume 1 of Matrix Computations and Semiseparable Matrices. In volume 2, Raf Vandebril, Marc Van Barel, and Nicola Mastronardi discuss the theory of struct
In recent years several new classes of matrices have been discovered and their structure exploited to design fast and accurate algorithms. In this new reference work, Raf Vandebril, Marc Van Barel, and Nicola Mastronardi present the first comprehensi
In this paper we consider the computation of the modified moments for the system of Laguerre polynomials on the real semiaxis with the Hermite weight. These moments can be used for the computation of integrals with the Hermite weight for the real sem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3d678c60c369346f6640210fdcd2a3e
https://doi.org/10.21203/rs.3.rs-2547815/v1
https://doi.org/10.21203/rs.3.rs-2547815/v1
Publikováno v:
IEEE Transactions on Signal Processing. 70:5913-5925
Autor:
Paul Van Dooren, Nicola Mastronardi
Publikováno v:
IMA journal of numerical analysis 41 (2021): 2516–2529. doi:10.1093/imanum/draa049
info:cnr-pdr/source/autori:Mastronardi n., Van Dooren P./titolo:On QZ Steps with Perfect Shifts and Computing the Index of a Differential Algebraic Equation/doi:10.1093%2Fimanum%2Fdraa049/rivista:IMA journal of numerical analysis/anno:2021/pagina_da:2516/pagina_a:2529/intervallo_pagine:2516–2529/volume:41
info:cnr-pdr/source/autori:Mastronardi n., Van Dooren P./titolo:On QZ Steps with Perfect Shifts and Computing the Index of a Differential Algebraic Equation/doi:10.1093%2Fimanum%2Fdraa049/rivista:IMA journal of numerical analysis/anno:2021/pagina_da:2516/pagina_a:2529/intervallo_pagine:2516–2529/volume:41
In this paper we revisit the problem of performing a $QZ$ step with a so-called ‘perfect shift’, which is an ‘exact’ eigenvalue of a given regular pencil $\lambda B-A$ in unreduced Hessenberg triangular form. In exact arithmetic, the $QZ$ ste
Publikováno v:
Journal of computational and applied mathematics 373 (2020). doi:10.1016/j.cam.2019.05.022
info:cnr-pdr/source/autori:Camps D.; Mastronardi N.; Vandebril R.; Van Dooren P./titolo:Swapping 2 × 2 blocks in the Schur and generalized Schur form/doi:10.1016%2Fj.cam.2019.05.022/rivista:Journal of computational and applied mathematics/anno:2020/pagina_da:/pagina_a:/intervallo_pagine:/volume:373
Journal of Computational and Applied Mathematics, (2019)
info:cnr-pdr/source/autori:Camps D.; Mastronardi N.; Vandebril R.; Van Dooren P./titolo:Swapping 2 × 2 blocks in the Schur and generalized Schur form/doi:10.1016%2Fj.cam.2019.05.022/rivista:Journal of computational and applied mathematics/anno:2020/pagina_da:/pagina_a:/intervallo_pagine:/volume:373
Journal of Computational and Applied Mathematics, (2019)
In this paper we describe how to swap two 2 × 2 blocks in a real Schur form and a generalized real Schur form. We pay special attention to the numerical stability of the method. We also illustrate the stability of our approach by a series of numeric
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5f1327060956ce06d132e74625d7d99
https://lirias.kuleuven.be/handle/123456789/632250
https://lirias.kuleuven.be/handle/123456789/632250
Publikováno v:
Computational Mathematics and Mathematical Physics, Vol. 61, p. p. 733-749 (2021)
Computational mathematics and mathematical physics (Online) 61 (2021): 733–749. doi:10.1134/S0965542521050080
info:cnr-pdr/source/autori:Laudadio T., Mastronardi N., Van Dooren P./titolo:Computing the eigenvectors of nonsymmetric tridiagonal matrices/doi:10.1134%2FS0965542521050080/rivista:Computational mathematics and mathematical physics (Online)/anno:2021/pagina_da:733/pagina_a:749/intervallo_pagine:733–749/volume:61
Computational mathematics and mathematical physics (Online) 61 (2021): 733–749. doi:10.1134/S0965542521050080
info:cnr-pdr/source/autori:Laudadio T., Mastronardi N., Van Dooren P./titolo:Computing the eigenvectors of nonsymmetric tridiagonal matrices/doi:10.1134%2FS0965542521050080/rivista:Computational mathematics and mathematical physics (Online)/anno:2021/pagina_da:733/pagina_a:749/intervallo_pagine:733–749/volume:61
The computation of the eigenvalue decomposition of matrices is one of the most investigated problems in numerical linear algebra. In particular, real nonsymmetric tridiagonal eigenvalue problems arise in a variety of applications. In this paper the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50f44d1000c1a71780a127e46faf4c80
https://hdl.handle.net/2078.1/242881
https://hdl.handle.net/2078.1/242881