A Low Complexity Scaling Method for the Lanczos Kernel in Fixed-Point Arithmetic

DOI10.1109/TC.2013.162MaRDI QIDQ2982377zbMATH OpenFDO

Authors Juan L. Jerez, George A. Constantinides, E. C. Kerrigan

Publication date 16 May 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2013.162

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Roundoff error (65G50) Numerical algorithms for computer arithmetic, etc. (65Y04)

Recommendations

• The Lanczos and conjugate gradient algorithms in finite precision arithmetic
• The Lanczos and conjugate gradient algorithms in finite precision arithmetic
• An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
• A new implementation of the Lanczos method in linear problems
• An efficient nonsymmetric Lanczos method on parallel vector computers
• A class of scaled direct methods for linear systems
• The Lanczos Algorithm With Partial Reorthogonalization
• Low-Rank Modification of the Unsymmetric Lanczos Algorithm
• scientific article; zbMATH DE number 22191
• scientific article; zbMATH DE number 4157770

Cited in

(3)

• Augmented Lagrangian optimization under fixed-point arithmetic
• A modified scaling algorithm for LP
• An integer arithmetic-based AMG preconditioned FGMRES solver

This page was built for publication: A Low Complexity Scaling Method for the Lanczos Kernel in Fixed-Point Arithmetic

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