Cover Image

Mixed-Precision Paterson--Stockmeyer Method for Evaluating Polynomials of Matrices

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Liu, Xiaobo
Format:	Preprint
Published:	2023
Subjects:	Numerical Analysis 15A16, 65F60, 65G50
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Polynomial Preconditioning for the Action of the Matrix Square Root and Inverse Square Root
by: Frommer, Andreas, et al.
Published: (2024)

A Systematic Framework for Stable and Cost-Efficient Matrix Polynomial Evaluation
by: Alonso, J. M., et al.
Published: (2026)

Mixed-precision iterative refinement for low-rank Lyapunov equations
by: Benner, Peter, et al.
Published: (2025)

Splitting methods based on the nonzero diagonal pattern for computing matrix functions
by: Hamadi, Majed, et al.
Published: (2024)

Mixed-precision algorithms for solving the Sylvester matrix equation
by: Dmytryshyn, Andrii, et al.
Published: (2025)

A scaling and recovering algorithm for the matrix $φ$-functions
by: Al-Mohy, Awad H., et al.
Published: (2025)

Estimating the numerical range with a Krylov subspace
by: Chen, Cecilia, et al.
Published: (2024)

Improving Matrix Exponential for Generative AI Flows: A Taylor-Based Approach Beyond Paterson--Stockmeyer
by: Sastre, Jorge, et al.
Published: (2025)

Shifted CholeskyQR for sparse matrices
by: Guan, Haoran, et al.
Published: (2024)

Accurate Bidiagonal Decomposition and Computations with Generalized Pascal Matrices
by: Delgado, Jorge, et al.
Published: (2025)

Numerical Stability of the Nyström Method
by: Bucci, Alberto, et al.
Published: (2025)

Computing the action of a matrix exponential on an interval via the $\star$-product approach
by: Pozza, Stefano, et al.
Published: (2026)

Balancing Inexactness in Mixed Precision Matrix Computations
by: Carson, Erin Claire
Published: (2026)

Approximating Sparse Matrices and their Functions using Matrix-vector products
by: Park, Taejun, et al.
Published: (2023)

A mixed precision preconditioned Jacobi method for the symmetric eigenvalue problem
by: Zhang, Zhiyuan, et al.
Published: (2022)

Structure-preserving Krylov Subspace Approximations for the Matrix Exponential of Hamiltonian Matrices: A Comparative Study
by: Benner, Peter, et al.
Published: (2026)

Structure-Informed Bounds on the Kronecker Rank of Block-Structured Matrices
by: Fuller, Allison, et al.
Published: (2026)

On finite precision block Lanczos computations
by: Šimonová, Dorota, et al.
Published: (2025)

Accuracy and Stability of CUR decompositions with Oversampling
by: Park, Taejun, et al.
Published: (2024)

Analysis of randomized CholeskyQR for sparse matrices
by: Guan, Haoran, et al.
Published: (2025)

An improved error analysis of CholeskyQR with the randomized model
by: Guan, Haoran, et al.
Published: (2024)

An improved Shifted CholeskyQR based on columns
by: Fan, Yuwei, et al.
Published: (2024)

Randomized LU-Householder CholeskyQR
by: Guan, Haoran, et al.
Published: (2024)

Stochastic Rounding Implicitly Regularizes Tall-and-Thin Matrices
by: Dexter, Gregory, et al.
Published: (2024)

Iterative Refinement for a Subset of Eigenvectors of Symmetric Matrices via Matrix Multiplications
by: Terao, Takeshi, et al.
Published: (2026)

A Contour Integral-Based Algorithm for Computing Generalized Singular Values
by: Liu, Yuqi, et al.
Published: (2023)

An new polar factor retraction on the Stiefel manifold with closed-form inverse
by: Jensen, Rasmus, et al.
Published: (2026)

Computing the Action of the Generating Function of Bernoulli Polynomials on a Matrix with An Application to Non-local Boundary Value Problems
by: Aceto, Lidia, et al.
Published: (2024)

Growth factors of orthogonal matrices and local behavior of Gaussian elimination with partial and complete pivoting
by: Peca-Medlin, John
Published: (2023)

An augmented matrix-based CJ-FEAST SVDsolver for computing a partial singular value decomposition with the singular values in a given interval
by: Jia, Zhongxiao, et al.
Published: (2023)

Variants of thick-restart Lanczos for the Bethe-Salpeter eigenvalue problem
by: Alvarruiz, Fernando, et al.
Published: (2025)

Minimizing the Arithmetic and Communication Complexity of Jacobi's Method for Eigenvalues and Singular Values: Part One -- Serial Algorithms
by: Demmel, James, et al.
Published: (2025)

Mixed precision thin SVD algorithms based on the Gram matrix
by: Carson, Erin, et al.
Published: (2026)

Adaptive Polynomial Filtering for Hermitian Interior Eigenproblems: Convergence Analysis
by: Xu, Xiaofei, et al.
Published: (2026)

A low-memory Lanczos method with rational Krylov compression for matrix functions
by: Casulli, Angelo A., et al.
Published: (2024)

Challenges in computing matrix functions
by: Fasi, Massimiliano, et al.
Published: (2024)

Randomized block Gram-Schmidt process for solution of linear systems and eigenvalue problems
by: Balabanov, Oleg, et al.
Published: (2021)

Small singular values can increase in lower precision
by: Boutsikas, Christos, et al.
Published: (2023)

Iterative Methods for Computing the T-Square Root of Third-Order Tensors
by: Sharma, Hemant, et al.
Published: (2026)

Sharp Convergence Rates and Optimal Weights for Cimmino's Reflection Algorithm
by: Sharma, Hemant
Published: (2026)