default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMassimiliano Fasi
Person information
- affiliation: University of Leeds, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i8]Andrii Dmytryshyn, Massimiliano Fasi, Nicholas J. Higham, Xiaobo Liu:
Mixed-precision algorithms for solving the Sylvester matrix equation. CoRR abs/2503.03456 (2025)- [i7]Anzhi Zhang, Massimiliano Fasi:
TypedMatrices.jl: An Extensible and Type-Based Matrix Collection for Julia. CoRR abs/2503.11355 (2025) - 2024
- [i6]Massimiliano Fasi, Stéphane Gaudreault, Kathryn Lund, Marcel Schweitzer:
Challenges in computing matrix functions. CoRR abs/2401.16132 (2024) - [i5]El-Mehdi El Arar, Massimiliano Fasi, Silviu-Ioan Filip, Mantas Mikaitis:
Probabilistic error analysis of limited-precision stochastic rounding. CoRR abs/2408.03069 (2024) - 2023
- [j14]Massimiliano Fasi
, Nicholas J. Higham, Xiaobo Liu:
Computing the Square Root of a Low-Rank Perturbation of the Scaled Identity Matrix. SIAM J. Matrix Anal. Appl. 44(1): 156-174 (2023) - [j13]Massimiliano Fasi, Nicholas J. Higham, Florent Lopez, Théo Mary, Mantas Mikaitis:
Matrix Multiplication in Multiword Arithmetic: Error Analysis and Application to GPU Tensor Cores. SIAM J. Sci. Comput. 45(1): 1- (2023) - [j12]Massimiliano Fasi, Mantas Mikaitis:
CPFloat: A C Library for Simulating Low-precision Arithmetic. ACM Trans. Math. Softw. 49(2): 18:1-18:32 (2023) - [i4]François Rousse, Massimiliano Fasi, Andrii Dmytryshyn, Mårten Gulliksson, Magnus Ögren:
Simulations of quantum dynamics with fermionic phase-space representations using numerical matrix factorizations as stochastic gauges. CoRR abs/2304.05149 (2023) - 2022
- [j11]Andrii Dmytryshyn, Massimiliano Fasi, Mårten Gulliksson:
The dynamical functional particle method for multi-term linear matrix equations. Appl. Math. Comput. 435: 127458 (2022) - [j10]Elias Jarlebring, Massimiliano Fasi, Emil Ringh:
Computational Graphs for Matrix Functions. ACM Trans. Math. Softw. 48(4): 39:1-39:35 (2022) - 2021
- [j9]Massimiliano Fasi, Nicholas J. Higham, Mantas Mikaitis, Srikara Pranesh:
Numerical behavior of NVIDIA tensor cores. PeerJ Comput. Sci. 7: e330 (2021) - [j8]Massimiliano Fasi, Nicholas J. Higham:
Matrices with Tunable Infinity-Norm Condition Number and No Need for Pivoting in LU Factorization. SIAM J. Matrix Anal. Appl. 42(1): 417-435 (2021) - [j7]Massimiliano Fasi, Nicholas J. Higham:
Generating Extreme-Scale Matrices With Specified Singular Values or Condition Number. SIAM J. Sci. Comput. 43(1): A663-A684 (2021) - [j6]Massimiliano Fasi, Mantas Mikaitis:
Algorithms for Stochastically Rounded Elementary Arithmetic Operations in IEEE 754 Floating-Point Arithmetic. IEEE Trans. Emerg. Top. Comput. 9(3): 1451-1466 (2021) - [c2]Massimiliano Fasi, Mantas Mikaitis:
Algorithms for Stochastically Rounded Elementary Arithmetic Operations in IEEE 754 Floating-Point Arithmetic. ARITH 2021: 69 - [i3]Elias Jarlebring, Massimiliano Fasi, Emil Ringh:
Computational graphs for matrix functions. CoRR abs/2107.12198 (2021) - 2020
- [i2]Massimiliano Fasi, Leonardo Robol:
Sampling the eigenvalues of random orthogonal and unitary matrices. CoRR abs/2009.11515 (2020)
2010 – 2019
- 2019
- [j5]Massimiliano Fasi, Nicholas J. Higham:
An Arbitrary Precision Scaling and Squaring Algorithm for the Matrix Exponential. SIAM J. Matrix Anal. Appl. 40(4): 1233-1256 (2019) - 2018
- [j4]Massimiliano Fasi, Bruno Iannazzo:
Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector. SIAM J. Matrix Anal. Appl. 39(1): 178-203 (2018) - [j3]Massimiliano Fasi, Nicholas J. Higham:
Multiprecision Algorithms for Computing the Matrix Logarithm. SIAM J. Matrix Anal. Appl. 39(1): 472-491 (2018) - 2016
- [j2]Massimiliano Fasi, Julien Langou, Yves Robert, Bora Uçar:
A backward/forward recovery approach for the preconditioned conjugate gradient method. J. Comput. Sci. 17: 522-534 (2016) - 2015
- [j1]Massimiliano Fasi, Nicholas J. Higham, Bruno Iannazzo:
An Algorithm for the Matrix Lambert W Function. SIAM J. Matrix Anal. Appl. 36(2): 669-685 (2015) - [c1]Massimiliano Fasi, Yves Robert, Bora Uçar:
Combining Backward and Forward Recovery to Cope with Silent Errors in Iterative Solvers. IPDPS Workshops 2015: 980-989 - [i1]Massimiliano Fasi, Julien Langou, Yves Robert, Bora Uçar:
A Backward/Forward Recovery Approach for the Preconditioned Conjugate Gradient Method. CoRR abs/1511.04478 (2015)
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 2025-04-14 21:12 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:
