Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix

DOI10.1007/S004530010068MaRDI QIDQ5930160zbMATH OpenOpenAlexFDO

Authors J. Reif

Publication date 3 July 2001

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004530010068

zbMATH Keywords

characteristic polynomialparallel computationsparse factorizationsparse Lanczos methodsparse separable matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Recommendations

• Computing characteristic polynomials of matrices of structured polynomials
• Fast and Efficient Parallel Solution of Sparse Linear Systems
• Faster algorithms for the characteristic polynomial
• Efficient computation of the characteristic polynomial
• Complexity of parallel matrix computations

Cited in

(1)

• A survey of motion planning and related geometric algorithms

This page was built for publication: Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5930160)