default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuca Gemignani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Paola Boito, Yuli Eidelman, Luca Gemignani:
Numerical Solution of Nonclassical Boundary Value Problems. CoRR abs/2402.06943 (2024)- [i7]Lidia Aceto, Luca Gemignani:
Computing the Action of the Generating Function of Bernoulli Polynomials on a Matrix with An Application to Non-local Boundary Value Problems. CoRR abs/2406.01437 (2024) - 2023
- [j41]Luca Gemignani, Beatrice Meini:
Relaxed fixed point iterations for matrix equations arising in Markov chain modeling. Numer. Algorithms 94(1): 149-173 (2023) - [c7]Valerio Besozzi
, M. Della Bartola, Luca Gemignani:
Experimental Study of a Parallel Iterative Solver for Markov Chain Modeling. ICCS (2) 2023: 47-61 - [i6]Valerio Besozzi, M. Della Bartola, Luca Gemignani:
Experimental Study of a Parallel Iterative Solver for Markov Chain Modeling. CoRR abs/2302.07551 (2023) - [i5]Luca Gemignani:
Efficient Inversion of Matrix φ-Functions of Low Order. CoRR abs/2302.07565 (2023) - 2022
- [j40]Paola Boito, Yuli Eidelman, Luca Gemignani:
Computing the reciprocal of a ϕ-function by rational approximation. Adv. Comput. Math. 48(1): 1 (2022) - [j39]Luca Gemignani, Lucia Romani, Alberto Viscardi:
Bezout-like polynomial equations associated with dual univariate interpolating subdivision schemes. Adv. Comput. Math. 48(1): 4 (2022) - [j38]Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani:
Orthogonal Iterations on Companion-Like Pencils. J. Sci. Comput. 91(1): 6 (2022) - [i4]Luca Gemignani, Beatrice Meini:
An Acceleration of Fixed Point Iterations for M/G/1-type Markov Chains by Means of Relaxation Techniques. CoRR abs/2205.13187 (2022) - 2021
- [i3]Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani:
Orthogonal iterations on Structured Pencils. CoRR abs/2104.10946 (2021) - [i2]Luca Gemignani, Federico Poloni:
Comparison Theorems for Splittings of M-matrices in (block) Hessenberg Form. CoRR abs/2106.10492 (2021) - 2020
- [j37]Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani:
Fast QR iterations for unitary plus low rank matrices. Numerische Mathematik 144(1): 23-53 (2020) - [j36]Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani:
Efficient Reduction of Compressed Unitary Plus Low Rank Matrices to Hessenberg Form. SIAM J. Matrix Anal. Appl. 41(3): 984-1003 (2020) - [i1]Luca Gemignani, Lucia Romani, Alberto Viscardi:
Bezout-like polynomial equations associated with dual univariate interpolating subdivision schemes. CoRR abs/2009.13396 (2020)
2010 – 2019
- 2018
- [j35]Paola Boito, Yuli Eidelman, Luca Gemignani:
Efficient solution of parameter-dependent quasiseparable systems and computation of meromorphic matrix functions. Numer. Linear Algebra Appl. 25(6) (2018) - 2017
- [j34]Luca Gemignani, Leonardo Robol:
Fast Hessenberg Reduction of Some Rank Structured Matrices. SIAM J. Matrix Anal. Appl. 38(2): 574-598 (2017) - 2016
- [j33]Luca Gemignani:
Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems. Comput. Math. Appl. 72(4): 992-1001 (2016) - [j32]Paola Boito, Yuli Eidelman, Luca Gemignani:
Implicit QR for companion-like pencils. Math. Comput. 85(300): 1753-1774 (2016) - 2015
- [j31]Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani:
Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding. J. Comput. Appl. Math. 278: 326-335 (2015) - [j30]Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani:
A CMV-Based Eigensolver for Companion Matrices. SIAM J. Matrix Anal. Appl. 36(3): 1046-1068 (2015) - 2014
- [j29]Simone Brugiapaglia, Luca Gemignani:
On the simultaneous refinement of the zeros of H-palindromic polynomials. J. Comput. Appl. Math. 272: 293-303 (2014) - 2013
- [j28]Costanza Conti, Luca Gemignani, Lucia Romani:
A constructive algebraic strategy for interpolatory subdivision schemes induced by bivariate box splines. Adv. Comput. Math. 39(2): 395-424 (2013) - 2012
- [j27]Luca Gemignani, Vanni Noferini:
Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials. Numer. Algorithms 61(2): 315-329 (2012) - 2011
- [j26]Costanza Conti, Luca Gemignani, Lucia Romani:
From approximating to interpolatory non-stationary subdivision schemes with the same generation properties. Adv. Comput. Math. 35(2-4): 217-241 (2011) - [j25]Luca Gemignani:
On some classes of structured matrices with algebraic trigonometric eigenvalues. Appl. Math. Comput. 217(19): 7573-7578 (2011) - 2010
- [c6]Costanza Conti, Luca Gemignani, Lucia Romani:
Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes. ISSAC 2010: 251-256
2000 – 2009
- 2008
- [j24]Dario Andrea Bini, Yuli Eidelman, Luca Gemignani, Israel Gohberg:
The unitary completion and QR iterations for a class of structured matrices. Math. Comput. 77(261): 353-378 (2008) - [j23]Yuli Eidelman, Luca Gemignani, Israel Gohberg:
Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations. Numer. Algorithms 47(3): 253-273 (2008) - 2007
- [j22]Dario Fasino, Luca Gemignani:
Structured eigenvalue problems for rational gauss quadrature. Numer. Algorithms 45(1-4): 195-204 (2007) - [j21]Dario Andrea Bini, Yuli Eidelman, Luca Gemignani, Israel Gohberg:
Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank-One Perturbations of Unitary Matrices. SIAM J. Matrix Anal. Appl. 29(2): 566-585 (2007) - [c5]Luca Gemignani:
Structured matrix methods for polynomial root-finding. ISSAC 2007: 175-180 - 2005
- [j20]Dario A. Bini, Luca Gemignani:
Solving quadratic matrix equations and factoring polynomials: new fixed point iterations based on Schur complements of Toeplitz matrices. Numer. Linear Algebra Appl. 12(2-3): 181-189 (2005) - [j19]Dario A. Bini, Luca Gemignani, Joab R. Winkler:
Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis. Numer. Linear Algebra Appl. 12(8): 685-698 (2005) - [j18]Dario A. Bini, Luca Gemignani, Victor Y. Pan:
Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations. Numerische Mathematik 100(3): 373-408 (2005) - [j17]Marc Van Barel, Dario Fasino, Luca Gemignani, Nicola Mastronardi:
Orthogonal Rational Functions and Structured Matrices. SIAM J. Matrix Anal. Appl. 26(3): 810-829 (2005) - [j16]Dario Andrea Bini, Luca Gemignani, Françoise Tisseur:
The Ehrlich-Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem. SIAM J. Matrix Anal. Appl. 27(1): 153-175 (2005) - 2004
- [j15]Luca Gemignani, Grazia Lotti:
Rounding Error Analysis in Solving M-Matrix Linear Systems of Block Hessenberg Form. Numer. Algorithms 36(2): 157-168 (2004) - [j14]Dario Bini, Luca Gemignani:
Bernstein-Bezoutian matrices. Theor. Comput. Sci. 315(2-3): 319-333 (2004) - 2003
- [j13]Dario Andrea Bini, Giuseppe Fiorentino, Luca Gemignani, Beatrice Meini:
Effective Fast Algorithms for Polynomial Spectral Factorization. Numer. Algorithms 34(2-4): 217-227 (2003) - [j12]Dario Fasino, Luca Gemignani:
Direct and Inverse Eigenvalue Problems for Diagonal-Plus-Semiseparable Matrices. Numer. Algorithms 34(2-4): 313-324 (2003) - [j11]Luca Gemignani, Grazia Lotti:
Efficient and Stable Solution of M-Matrix Linear Systems of (Block) Hessenberg Form. SIAM J. Matrix Anal. Appl. 24(3): 852-876 (2003) - 2002
- [j10]Dario Fasino, Luca Gemignani:
A Lanczos-type algorithm for the QR factorization of regular Cauchy matrices. Numer. Linear Algebra Appl. 9(4): 305-319 (2002) - 2001
- [j9]Dario Andrea Bini, Luca Gemignani, Beatrice Meini:
Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations. Numerische Mathematik 89(1): 49-82 (2001) - [c4]Luca Gemignani:
A generalized Graeffe's iteration for evaluating polynomials and rational functions. ISSAC 2001: 143-149 - 2000
- [j8]Luca Gemignani:
Efficient and stable solution of structured Hessenberg linear systems arising from difference equations. Numer. Linear Algebra Appl. 7(5): 319-335 (2000)
1990 – 1999
- 1998
- [j7]Luca Gemignani:
Computing a Factor of a Polynomial by Means of Multishift LR Algorithms. SIAM J. Matrix Anal. Appl. 19(1): 161-181 (1998) - 1997
- [j6]Luca Gemignani:
Chebyshev rational interpolation. Numer. Algorithms 15(1): 91-110 (1997) - [c3]Luca Gemignani:
GCD of Polynomials and Bezout Matrices. ISSAC 1997: 271-277 - 1996
- [j5]Dario Bini, Luca Gemignani:
Erratum: Fast Parallel Computation of the Polynomial Remainder Sequence via Bezout and Hankel Matrices. SIAM J. Comput. 25(6): 1358 (1996) - 1995
- [j4]Dario Bini, Luca Gemignani:
Fast Parallel Computation of the Polynomial Remainder Sequence Via Bezout and Hankel Matrices. SIAM J. Comput. 24(1): 63-77 (1995) - 1994
- [j3]Luca Gemignani:
Solving Hankel Systems over the Integers. J. Symb. Comput. 18(6): 573-584 (1994) - 1992
- [j2]Luca Gemignani:
Fast Inversion of Hankel and Toeplitz Matrices. Inf. Process. Lett. 41(3): 119-123 (1992) - [j1]Dario Bini, Luca Gemignani:
On the Complexity of Polynomial Zeros. SIAM J. Comput. 21(4): 781-799 (1992) - 1991
- [c2]Dario Bini, Luca Gemignani, Victor Y. Pan:
Improved Parallel Computations with Matrices and Polynomials. ICALP 1991: 520-531 - 1990
- [c1]Dario Bini, Luca Gemignani:
On the Euclidean Scheme for Polynomials Having Interlaced Real Zeros. SPAA 1990: 254-258
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-07-05 21:04 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:
