Efficient certification of numeric solutions to eigenproblems

DOI10.1007/978-3-319-72453-9_6MaRDI QIDQ4628482zbMATH OpenOpenAlexFDO

Authors Joris van der Hoeven, Bernard Mourrain

Publication date 14 March 2019

Published in Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-72453-9_6

zbMATH Keywords

computable analysisinterval arithmeticreliable computingball arithmetic

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30)

Recommendations

• scientific article; zbMATH DE number 4106125
• scientific article; zbMATH DE number 176411
• Precise Matrix Eigenvalues Using Range Arithmetic
• A stable, polynomial-time algorithm for the eigenpair problem
• Algorithm 921: alphaCertified: certifying solutions to polynomial systems

Cited in

(2)

• scientific article; zbMATH DE number 4106125 (Why is no real title available?)
• Newton-type methods for simultaneous matrix diagonalization

This page was built for publication: Efficient certification of numeric solutions to eigenproblems

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