scientific article; zbMATH DE number 176411

MaRDI QIDQ4035563zbMATH OpenFDO

Authors Walter Krämer

Publication date 18 May 1993

zbMATH Keywords

eigenpairinterval arithmeticnumerical examplesparse eigenproblemverified solution

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50) Interval and finite arithmetic (65G30)

Review text

[For the entire collection see Zbl 0753.00017.] A theorem of S. M. Rump on the enclosure of a simple eigenpair of a general matrix is modified so that sparse matrices can be treated efficiently. The exact solution of the sparse eigenproblem is enclosed by an interval vector with sharp bounds.

Recommendations

• scientific article; zbMATH DE number 714519
• A Unified Approach to Enclosure Methods for Eigenpairs
• Publication:4203695
• scientific article; zbMATH DE number 4115819
• scientific article; zbMATH DE number 4106125

Cited in

(9)

• Verified solutions of delay eigenvalue problems
• Fast verification of solutions for sparse monotone matrix equations
• scientific article; zbMATH DE number 4106125 (Why is no real title available?)
• scientific article; zbMATH DE number 4123146 (Why is no real title available?)
• scientific article; zbMATH DE number 1313343 (Why is no real title available?)
• Späth, H., Zweidimensionale Spline‐Interpolations‐Algorithmen. München/Wien, R. Oldenbourg Verlag 1991. 293 S. ISBN 3‐486‐21807‐7
• scientific article; zbMATH DE number 714519 (Why is no real title available?)
• Efficient certification of numeric solutions to eigenproblems
• scientific article; zbMATH DE number 4115819 (Why is no real title available?)

This page was built for publication:

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